Towards modularly comparing programs using automated theorem provers
From MaRDI portal
Recommendations
Cited in
(13)- Automating regression verification of pointer programs by predicate abstraction
- Relational program reasoning using compiler IR
- Certified verification of relational properties
- Equivalence checking of two functional programs using inductive theorem provers
- Modular verification of procedure equivalence in the presence of memory allocation
- Relational verification via invariant-guided synchronization
- A language-independent proof system for full program equivalence
- Verifying procedural programs via constrained rewriting induction
- Verifying relative safety, accuracy, and termination for program approximations
- Alignment complete relational Hoare logics for some and all
- Proving mutual termination
- Product programs in the wild: retrofitting program verifiers to check information flow security
- Constraint-based relational verification
This page was built for publication: Towards modularly comparing programs using automated theorem provers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928447)