Demand-Driven Compositional Symbolic Execution

DOI10.1007/978-3-540-78800-3_28MaRDI QIDQ5458338zbMATH OpenOpenAlexDBLPWikidataFDO

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

Mathematics Subject Classification ID

Theory of software (68N99)

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

Cited in

(11)

• Symbolic computation via program transformation
• Demand-driven interprocedural analysis for map-based abstract domains
• Backward symbolic execution with loop folding
• Sound and complete concolic testing for higher-order functions
• Combining model checking and testing
• Strategies for scalable symbolic execution-driven test generation for programs
• Compact symbolic execution
• Symbolic execution as DPLL modulo theories
• A slice-based decision procedure for type-based partial orders
• Maximizing branch coverage with constrained Horn clauses
• Automatically testing console I/O behavior of student submissions in Haskell

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)