Bottom-Up Shape Analysis
From MaRDI portal
Recommendations
- Shape analysis and structuring
- Shape analysis with geometric primitives
- Learning shape analysis
- Static Analysis
- scientific article; zbMATH DE number 56337
- scientific article; zbMATH DE number 53254
- scientific article; zbMATH DE number 2043763
- Shape Analysis by Graph Decomposition
- Shape and object data analysis
Cites work
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Automated Technology for Verification and Analysis
- Bottom-Up Shape Analysis
- Compositional shape analysis by means of bi-abduction
- Computer Aided Verification
- CONCUR 2004 - Concurrency Theory
- Heap Assumptions on Demand
- scientific article; zbMATH DE number 1142325 (Why is no real title available?)
- scientific article; zbMATH DE number 1841809 (Why is no real title available?)
- Iterating transducers in the large (extended abstract)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Regular model checking using widening techniques
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(13)- Convergence: integrating termination and abort-freedom
- A relational shape abstract domain
- Interprocedural shape analysis using separation logic-based transformer summaries
- Ball-Based Shape Processing
- Bottom-Up Shape Analysis
- Arithmetic Strengthening for Shape Analysis
- scientific article; zbMATH DE number 56337 (Why is no real title available?)
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- Compositional shape analysis by means of bi-abduction
- Tools and Algorithms for the Construction and Analysis of Systems
- Semantic-directed clumping of disjunctive abstract states
- Compositional shape analysis by means of bi-abduction
- Verifying pointer safety for programs with unknown calls
This page was built for publication: Bottom-Up Shape Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392926)
