Reachability modulo theories

DOI10.1007/978-3-642-41036-9_4MaRDI QIDQ5168511zbMATH OpenOpenAlexFDO

Authors Akash Lal, Shaz Qadeer

Publication date 7 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41036-9_4

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Theory refinement for program verification
• Dafny: an automatic program verifier for functional correctness
• Towards a Theory of Reach
• Modular reasoning about heap paths via effectively propositional formulas
• On Bounded Reachability of Programs with Set Comprehensions

Cited in

(8)

• Theory refinement for program verification
• Resourceful reachability as HORN-LA
• Solving constrained Horn clauses using dependence-disjoint expansions
• What's decidable about program verification modulo axioms?
• On Bounded Reachability of Programs with Set Comprehensions
• Verification Modulo theories
• Proof-Guided Underapproximation Widening for Bounded Model Checking
• Distributed bounded model checking

This page was built for publication: Reachability modulo theories

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