Solving the incremental satisfiability problem
Journal of Logic Programming
Symbolic execution and program testing
Communications of the ACM
Automated Software Engineering
A study of branch prediction strategies
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
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
Compositional dynamic test generation
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
EXE: Automatically Generating Inputs of Death
ACM Transactions on Information and System Security (TISSEC)
Symbolic execution with abstraction
International Journal on Software Tools for Technology Transfer (STTT)
Pruning the Search Space in Path-Based Test Generation
ICST '09 Proceedings of the 2009 International Conference on Software Testing Verification and Validation
HAMPI: a solver for string constraints
Proceedings of the eighteenth international symposium on Software testing and analysis
Heuristics for Scalable Dynamic Test Generation
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Cloud9: a software testing service
ACM SIGOPS Operating Systems Review
A simple and flexible way of computing small unsatisfiable cores in SAT modulo theories
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
CAV'07 Proceedings of the 19th international conference on Computer aided verification
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
Pex: white box test generation for .NET
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Artificial Intelligence: Structures and Strategies for Complex Problem Solving
Artificial Intelligence: Structures and Strategies for Complex Problem Solving
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
S2E: a platform for in-vivo multi-path analysis of software systems
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Operating system support for application-specific speculation
Proceedings of the sixth conference on Computer systems
Computing small unsatisfiable cores in satisfiability modulo theories
Journal of Artificial Intelligence Research
Repairing structurally complex data
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Efficient state merging in symbolic execution
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Unbounded symbolic execution for program verification
RV'11 Proceedings of the Second international conference on Runtime verification
IIS-Guided DFS for efficient bounded reachability analysis of linear hybrid automata
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
Recently, symbolic execution has gained a significant progress in its techniques and applications. However, in practice, scalability is still a key challenge for symbolic execution. In this paper, we present S2PF, which improves the scalability of Symbolic PathFinder by integrating speculative symbolic execution with the general heuristic search framework. In addition, two optimizations are proposed to improve the speculative symbolic execution in S2PF. Experimental results on six programs show that, S2PF can reduce the solver invocations by 36.4% to 48.7% (with an average of 40.3%), and save the search time by 30.6% to 43.5% (with an average of 35%).