Property Directed Reachability for Proving Absence of Concurrent Modification Errors
From MaRDI portal
Recommendations
- Property preserving abstractions for the verification of concurrent systems
- Reachability in Concurrent Uninterpreted Programs.
- The Lattice-Theoretic Essence of Property Directed Reachability Analysis
- Generalized property directed reachability
- Adequate proof principles for invariance and liveness properties of concurrent programs
- Formal verification of concurrent systems via directed model checking
Cites work
- Deciding effectively propositional logic using DPLL and substitution sets
- Generalized property directed reachability
- Modular reasoning about heap paths via effectively propositional formulas
- Property-directed inference of universal invariants or proving their absence
- SAT-Based Model Checking without Unrolling
- SMT-based model checking for recursive programs
- Verification, Model Checking, and Abstract Interpretation
Cited in
(3)
This page was built for publication: Property Directed Reachability for Proving Absence of Concurrent Modification Errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961566)