Compositional may-must program analysis: unleashing the power of alternation
From MaRDI portal
Recommendations
Cited in
(14)- How testing helps to diagnose proof failures
- Demand-driven interprocedural analysis for map-based abstract domains
- Backward symbolic execution with loop folding
- Reusing predicate precision in value analysis
- A two-phase approach for conditional floating-point verification
- Unbounded procedure summaries from bounded environments
- An abstraction-refinement framework for trigger querying
- Refinement checking on parametric modal transition systems
- Whale: an interpolation-based algorithm for inter-procedural verification
- Combining model checking and testing
- Formal testing for separation assurance
- SMT-based model checking for recursive programs
- Doomed program points
- Parallel program analysis via range splitting
This page was built for publication: Compositional may-must program analysis: unleashing the power of alternation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255061)