Demand-Driven Compositional Symbolic Execution

DOI10.1007/978-3-540-78800-3_28zbMATH Open1134.68355DBLPconf/tacas/AnandGT08OpenAlexW2171469152WikidataQ60163236 ScholiaQ60163236MaRDI QIDQ5458338FDOQ5458338

Authors: Saswat Anand, Patrice Godefroid, Nikolai Tillmann 

Publication date: 11 April 2008

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_28

Recommendations

• Symbolic execution as DPLL modulo theories
• Symbolic execution formally explained
• Compact symbolic execution
• scientific article; zbMATH DE number 1956607
• Concolic execution and test case generation in Prolog

Mathematics Subject Classification ID

Theory of software (68N99)

Cited In (9)

• Symbolic computation via program transformation
• Sound and complete concolic testing for higher-order functions
• Compact symbolic execution
• Combining model checking and testing
• Backward symbolic execution with loop folding
• Demand-driven interprocedural analysis for map-based abstract domains
• Strategies for scalable symbolic execution-driven test generation for programs
• Maximizing branch coverage with constrained Horn clauses
• A slice-based decision procedure for type-based partial orders

This page was built for publication: Demand-Driven Compositional Symbolic Execution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458338)