Automated repair of heap-manipulating programs using deductive synthesis
From MaRDI portal
Recommendations
Cites work
- Automated mutual explicit induction proof in separation logic
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic
- Automatic program repair using formal verification and expression templates
- BI as an assertion language for mutable data structures
- Compositional shape analysis by means of bi-abduction
- Concise read-only specifications for better synthesis of programs with pointers
- Enhancing Program Verification with Lemmas
- Enhancing modular OO verification with separation logic
- Sequent calculi for induction and infinite descent
- Specification-based program repair using SAT
Cited in
(4)- Connecting program synthesis and reachability: automatic program repair using test-input generation
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
- Fast Automated Abstract Machine Repair Using Simultaneous Modifications and Refactoring
- Automatic program repair using formal verification and expression templates
This page was built for publication: Automated repair of heap-manipulating programs using deductive synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234087)