Pages that link to "Item:Q5255075"
From MaRDI portal
The following pages link to Automatic numeric abstractions for heap-manipulating programs (Q5255075):
Displaying 13 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)
- Recognition of logically related regions based heap abstraction (Q1942939) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171) (← links)
- Invariants Synthesis over a Combined Domain for Automated Program Verification (Q2842643) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Relational Decomposition (Q3087994) (← links)
- Disproving Inductive Entailments in Separation Logic via Base Pair Approximation (Q3455777) (← links)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)
- Termination analysis of programs with multiphase control-flow (Q6647299) (← links)