Memoized symbolic execution

Authors:
Guowei Yang;Corina S. Păsăreanu;Sarfraz Khurshid
Affiliations:
University of Texas at Austin, USA;CMU, USA / NASA Ames Research Center, USA;University of Texas at Austin, USA
Venue:
Proceedings of the 2012 International Symposium on Software Testing and Analysis
Year:
2012

Citing 24
Cited 7

New trie data structures which support very fast search operations

Journal of Computer and System Sciences
Symbolic execution and program testing

Communications of the ACM
Trie memory

Communications of the ACM
A program testing system

ACM '76 Proceedings of the 1976 annual conference
Continuous testing in eclipse

Proceedings of the 27th international conference on Software engineering
DART: directed automated random testing

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Compositional dynamic test generation

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combining symbolic execution with model checking to verify parallel numerical programs

ACM Transactions on Software Engineering and Methodology (TOSEM)
Incremental state-space exploration for programs with dynamically allocated data

Proceedings of the 30th international conference on Software engineering
Combining unit-level symbolic execution and system-level concrete execution for testing nasa software

ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Improving Structural Testing of Object-Oriented Programs via Integrating Evolutionary Testing and Symbolic Execution

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Compositional may-must program analysis: unleashing the power of alternation

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Demand-driven compositional symbolic execution

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Parallel symbolic execution for structural test generation

Proceedings of the 19th international symposium on Software testing and analysis
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs

OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Symbolic PathFinder: symbolic execution of Java bytecode

Proceedings of the IEEE/ACM international conference on Automated software engineering
Search-carrying code

Proceedings of the IEEE/ACM international conference on Automated software engineering
FITE: future integrated testing environment

Proceedings of the FSE/SDP workshop on Future of software engineering research
CORAL: solving complex constraints for symbolic pathfinder

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Directed incremental symbolic execution

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Automatic partial loop summarization in dynamic test generation

Proceedings of the 2011 International Symposium on Software Testing and Analysis
Polyglot: modeling and analysis for multiple Statechart formalisms

Proceedings of the 2011 International Symposium on Software Testing and Analysis
CUTE and jCUTE: concolic unit testing and explicit path model-checking tools

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Model-based safety analysis of simulink models using SCADE design verifier

SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security

Ranged Model Checking

ACM SIGSOFT Software Engineering Notes
Scaling symbolic execution using ranged analysis

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Green: reducing, reusing and recycling constraints in program analysis

Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering
Memoise: a tool for memoized symbolic execution

Proceedings of the 2013 International Conference on Software Engineering
Precision reuse for efficient regression verification

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Multi-solver support in symbolic execution

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Maintaining the health of software monitors

Innovations in Systems and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces memoized symbolic execution (Memoise), a new approach for more efficient application of forward symbolic execution, which is a well-studied technique for systematic exploration of program behaviors based on bounded execution paths. Our key insight is that application of symbolic execution often requires several successive runs of the technique on largely similar underlying problems, e.g., running it once to check a program to find a bug, fixing the bug, and running it again to check the modified program. Memoise introduces a trie-based data structure that stores the key elements of a run of symbolic execution. Maintenance of the trie during successive runs allows re-use of previously computed results of symbolic execution without the need for re-computing them as is traditionally done. Experiments using our prototype implementation of Memoise show the benefits it holds in various standard scenarios of using symbolic execution, e.g., with iterative deepening of exploration depth, to perform regression analysis, or to enhance coverage using heuristics.