Compact Symbolic Execution
Author:
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Abstracting path conditions2012
- Automatic partial loop summarization in dynamic test generation2011
- Efficient and formal generalized symbolic executionAutomated Software Engineering, 2011
- Exploiting program dependencies for scalable multiple-path symbolic execution2010
- Demand-Driven Compositional Symbolic Execution2008
- Generalized Symbolic Execution for Model Checking and Testing2003
- Symbolic execution and program testingCommunications of the ACM, 1976