Predicate Abstraction via Symbolic Decision Procedures
From MaRDI portal
Publication:5310686
DOI10.2168/LMCS-3(2:1)2007zbMATH Open1128.03019OpenAlexW3103629895MaRDI QIDQ5310686FDOQ5310686
Authors: Shuvendu K. Lahiri, Thomas Ball, Byron Cook
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-3(2:1)2007
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)
Cited In (13)
- Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
- Verification, Model Checking, and Abstract Interpretation
- Computer Aided Verification
- Verification Modulo theories
- Abstraction and abstraction refinement
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
- Predicate Abstraction with Under-approximation Refinement
- On height and happiness
- A symbolic approach to predicate abstraction.
- Predicate Abstraction in a Program Logic Calculus
- Predicate abstraction with indexed predicates
- Tools and Algorithms for the Construction and Analysis of Systems
- Mixed concrete-symbolic predicate transformer
This page was built for publication: Predicate Abstraction via Symbolic Decision Procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310686)