Solving constrained Horn clauses using dependence-disjoint expansions

MaRDI QIDQ3384902zbMATH OpenFDO

Authors

Publication date 17 December 2021

Full work available at URL https://arxiv.org/abs/1705.03167, http://eptcs.web.cse.unsw.edu.au/paper.cgi?HCVS2018.3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• Synchronizing constrained Horn clauses
• Solving constrained Horn clauses over algebraic data types
• Solving Horn clauses on inductive data types without induction

Cites work

• scientific article; zbMATH DE number 1956554 (Why is no real title available?)
• An interpolating theorem prover
• Avoiding exponential explosion: generating compact verification conditions
• Generalized property directed reachability
• Lazy Abstraction with Interpolants
• Nested interpolants
• On recursion-free Horn clauses and Craig interpolation
• Reachability modulo theories
• SMT-based model checking for recursive programs
• Verification, Model Checking, and Abstract Interpretation
• Whale: an interpolation-based algorithm for inter-procedural verification

Cited in

(7)

• Solving constrained Horn clauses over algebraic data types
• On a generalization of Horn constraint systems
• Maximizing branch coverage with constrained Horn clauses
• scientific article; zbMATH DE number 1507192 (Why is no real title available?)
• Autark assignments of Horn CNFs
• An algorithm to compute maximal contractions for Horn clauses
• scientific article; zbMATH DE number 19146 (Why is no real title available?)

This page was built for publication: Solving constrained Horn clauses using dependence-disjoint expansions

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