Automatic verification of pointer programs using grammar-based shape analysis
From MaRDI portal
Recommendations
- Automated verification of recursive programs with pointers
- Automating regression verification of pointer programs by predicate abstraction
- Pointer logic for verification of pointer programs
- Completeness and expressiveness of pointer program verification by separation logic
- Automatic verification of pointer data-structure systems for all numbers of processes
- Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs
- Verifying pointer and string analyses with region type systems
Cited in
(15)- Generalised multi-pattern-based verification of programs with linear linked structures
- Compile-time debugging of C programs working on trees
- Automated verification of recursive programs with pointers
- Verifying pointer and string analyses with region type systems
- Generating abstract graph-based procedure summaries for pointer programs
- Abstracting Complex Data Structures by Hyperedge Replacement
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic
- Learning shape analysis
- Programs with lists are counter automata
- Automated Verification of Shape and Size Properties Via Separation Logic
- Checking the shape safety of pointer manipulations
- Increasing the accuracy of shape and safety analysis of pointer-based codes
- A shape graph logic and a shape system
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Extending separation logic with fixpoints and postponed substitution
This page was built for publication: Automatic verification of pointer programs using grammar-based shape analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316560)