Function summarization modulo theories
From MaRDI portal
Publication:5222945
Recommendations
Cited in
(7)- Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic
- Unbounded procedure summaries from bounded environments
- Efficient modular SMT-based model checking of pointer programs
- SMT-based verification of program changes through summary repair
- Formula normalizations in verification
- Transition power abstractions for deep counterexample detection
- Theory refinement for program verification
This page was built for publication: Function summarization modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222945)