Demand-Driven Compositional Symbolic Execution
Abstract elided by the publisher.
Related papers
- Higher-order demand-driven symbolic evaluation ICFP 2020
- The Program Dependence Web: A Representation Supporting Control, Data, and Demand-Driven Interpretation of Imperative Languages PLDI 1990
- Symbolic heap abstraction with demand-driven axiomatization of memory invariants OOPSLA 2010
- Adapton: composable, demand-driven incremental computation PLDI 2014
- Snugglebug: a powerful approach to weakest preconditions PLDI 2009
- Specification-Driven Generation of Summaries for Symbolic Execution ESOP 2026
- A demand-driven adaptive type analysis ICFP 2002
- Compatible Branch Coverage Driven Symbolic Execution for Efficient Bug Finding PLDI 2024