Simplifying the Verification of Quantified Array Assertions via Code Transformation
From MaRDI portal
Publication:2848907
Recommendations
- Verifying Array Programs by Transforming Verification Conditions
- Abstraction Refinement for Quantified Array Assertions
- An assume guarantee approach for checking quantified array assertions
- Transformational Verification of Parameterized Protocols Using Array Formulas
- Artificial Intelligence and Symbolic Computation
- Scaling bounded model checking by transforming programs with arrays
- scientific article; zbMATH DE number 7453193
- A rule-based verification strategy for array manipulating programs
- Putting the squeeze on array programs: loop verification via inductive rank reduction
Cited in
(8)- Verifying array manipulating programs with full-program induction
- \textsc{Diffy}: inductive reasoning of array programs using difference invariants
- Scaling bounded model checking by transforming programs with arrays
- Verifying Array Programs by Transforming Verification Conditions
- Abstraction Refinement for Quantified Array Assertions
- An assume guarantee approach for checking quantified array assertions
- Automatic program instrumentation for automatic verification
- scientific article; zbMATH DE number 6687732 (Why is no real title available?)
This page was built for publication: Simplifying the Verification of Quantified Array Assertions via Code Transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848907)