Abstraction-driven verification of array programs
From MaRDI portal
Recommendations
- Abstraction Refinement for Quantified Array Assertions
- Abstraction Refinement of Linear Programs with Arrays
- Formal Methods at the Crossroads. From Panacea to Foundational Support
- Data abstraction: a general framework to handle program verification of data structures
- An extension of lazy abstraction with interpolation for programs with arrays
Cited in
(15)- Cell morphing: from array programs to array-free Horn clauses
- Theory refinement for program verification
- Data abstraction: a general framework to handle program verification of data structures
- Scaling bounded model checking by transforming programs with arrays
- Simplifying the Verification of Quantified Array Assertions via Code Transformation
- Proving infinite satisfiability
- Distributing the workload in a lazy theorem-prover
- Verifying Array Programs by Transforming Verification Conditions
- scientific article; zbMATH DE number 6687732 (Why is no real title available?)
- A new acceleration-based combination framework for array properties
- Abstraction Refinement for Quantified Array Assertions
- Array Abstractions from Proofs
- On model checking data-independent systems with arrays with whole-array operations
- Abstraction Refinement of Linear Programs with Arrays
- Putting the squeeze on array programs: loop verification via inductive rank reduction
This page was built for publication: Abstraction-driven verification of array programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464711)