Towards a lazier symbolic pathfinder

Authors:
Benjamin Hillery;Eric Mercer;Neha Rungta;Suzette Person
Affiliations:
Brigham Young University, Provo, UT;Brigham Young University, Provo, UT;NASA Ames, Mountain View, CA;NASA Langley, Hampton, VA
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2014

Citing 12
Cited 0

Symbolic execution and program testing

Communications of the ACM
Data Structures and Algorithm Analysis in Java

Data Structures and Algorithm Analysis in Java
A program testing system

ACM '76 Proceedings of the 1976 annual conference
DART: directed automated random testing

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
CUTE: a concolic unit testing engine for C

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Bogor/Kiasan: A k-bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems

ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs

SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
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
Generalized symbolic execution for model checking and testing

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic PathFinder: symbolic execution of Java bytecode

Proceedings of the IEEE/ACM international conference on Automated software engineering
Execution generated test cases: how to make systems code crash itself

SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Efficient and formal generalized symbolic execution

Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

To explore the state space of programs with complex user-defined data structures, most symbolic execution engines use the lazy initialization algorithm. Symbolic Pathfinder (SPF) is the symbolic execution engine for the Java PathFinder (JPF) model checker; SPF too contains an implementation of the lazy initialization algorithm. A number of extensions to the original lazy initialization algorithm have since been published. One such extension is the lazier# algorithm which demonstrated dramatic performance gains over the other algorithms. There is, however, no open-source implementation of the lazier# algorithm available. This work is an implementation of the the lazier# algorithm within the Symbolic PathFinder framework. In addition, this work describes the implementation of two heap bounding techniques in SPF, namely k-bounding and n-bounding. The purpose of this paper is to discuss the nature of the improvements, implementation details, usage and performance test results.