Automated repair of heap-manipulating programs using deductive synthesis
From MaRDI portal
Publication:2234087
DOI10.1007/978-3-030-67067-2_17zbMath1472.68040OpenAlexW3119757231MaRDI QIDQ2234087
Thanh-Toan Nguyen, Quang-Trung Ta, Ilya Sergey, Wei-Ngan Chin
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_17
Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
Cites Work
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic
- Automated mutual explicit induction proof in separation logic
- Automatic program repair using formal verification and expression templates
- Specification-Based Program Repair Using SAT
- Sequent calculi for induction and infinite descent
- Enhancing modular OO verification with separation logic
- Enhancing Program Verification with Lemmas
- Concise Read-Only Specifications for Better Synthesis of Programs with Pointers
- BI as an assertion language for mutable data structures
- Compositional Shape Analysis by Means of Bi-Abduction
This page was built for publication: Automated repair of heap-manipulating programs using deductive synthesis
