Compact Symbolic Execution

Details Compact Symbolic Execution Compact Symbolic Execution

2012-01-23

arxiv.org/abs/1201.4715v1

Computer Science

Programming Languages

Scientific paper

We present a generalisation of King's symbolic execution technique called compact symbolic execution. It is based on a concept of templates: a template is a declarative parametric description of such a program part, generating paths in symbolic execution tree with regularities in program states along them. Typical sources of these paths are program loops and recursive calls. Using the templates we fold the corresponding paths into single vertices and therefore considerably reduce size of the tree without loss of any information. There are even programs for which compact symbolic execution trees are finite even though the classic symbolic execution trees are infinite.

Affiliated with

Also associated with

No associations

Rating

Compact Symbolic Execution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compact Symbolic Execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact Symbolic Execution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497940