Pages that link to "Item:Q3189844"
From MaRDI portal
The following pages link to Relational inductive shape analysis (Q3189844):
Displaying 14 items.
- A generic framework for heap and value analyses of object-oriented programming languages (Q278744) (← links)
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- Bunched logics displayed (Q1935559) (← links)
- A relational shape abstract domain (Q2058389) (← links)
- Concrete Memory Models for Shape Analysis (Q2814114) (← links)
- Invariants Synthesis over a Combined Domain for Automated Program Verification (Q2842643) (← links)
- Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
- A Unified Display Proof Theory for Bunched Logic (Q3178253) (← links)
- Galois Connections for Recursive Types (Q3297839) (← links)
- Automated Cyclic Entailment Proofs in Separation Logic (Q5200020) (← links)
- Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
