Relational program reasoning using compiler IR
From MaRDI portal
Recommendations
Cites work
- A data driven approach for algebraic loop invariants
- An \(O(ND)\) difference algorithm and its variations
- Beyond 2-safety: asymmetric product programs for relational program verification
- Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
- From invariant checking to invariant inference using randomized search
- Generalized property directed reachability
- Relational decomposition
- Relational logic with framing and hypotheses
- Relational verification through Horn clause transformation
- The Daikon system for dynamic detection of likely invariants
- Towards modularly comparing programs using automated theorem provers
Cited in
(9)- Understanding counterexamples for relational properties with \textit{DIbugger}
- scientific article; zbMATH DE number 7589540 (Why is no real title available?)
- Product programs and relational program logics
- Relational verification via invariant-guided synchronization
- Verifying equivalence of Spark programs
- Certified verification of relational properties
- Using Relational Verification for Program Slicing
- Leveraging compiler intermediate representation for multi- and cross-language verification
- Abstract execution
This page was built for publication: Relational program reasoning using compiler IR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703014)