Verification of multi-linked heaps
From MaRDI portal
Recommendations
Cites work
- A combination framework for tracking partition sizes
- A Logic-Based Framework for Reasoning about Composite Data Structures
- Automatic Termination Proofs for Programs with Shape-Shifting Heaps
- Automatically validating temporal safety properties of interfaces
- Counterexample-guided abstraction refinement
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3714896 (Why is no real title available?)
- scientific article; zbMATH DE number 3735091 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- MODULAR RANKING ABSTRACTION
- Parameterized verification with automatically computed inductive assertions
- Predicate abstraction and canonical abstraction for singly-linked lists
- Programs with Lists Are Counter Automata
- Relative completeness of abstraction refinement for software model checking
- Shape analysis by predicate abstraction
- Shape Analysis of Single-Parent Heaps
- The boundary between decidability and undecidability for transitive-closure logics
- Undecidability results on two-variable logics
- Verification by augmented finitary abstraction
- Verification via structure simulation
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
Cited in
(3)
This page was built for publication: Verification of multi-linked heaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439948)