Automated program repair using formal verification techniques
From MaRDI portal
Publication:6113992
DOI10.1007/978-3-031-22337-2_25zbMath1528.68079OpenAlexW4312620143MaRDI QIDQ6113992
Sarai Sheinvald, Hadar Frenkel, Orna Grumberg, Bat-Chen Rothenberg
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22337-2_25
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Program repair without regret
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automated assumption generation for compositional verification
- Learning regular sets from queries and counterexamples
- Must fault localization for program repair
- Sound and complete mutation-based program repair
- Automatic program repair using formal verification and expression templates
- Maximal specification synthesis
- Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation
- Learning Minimal Separating DFA’s for Compositional Verification
- Proofs of Networks of Processes
- Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement
- Assume, Guarantee or Repair
- Automated Circular Assume-Guarantee Reasoning
- Tools and Algorithms for the Construction and Analysis of Systems
- Synthesis of Circular Compositional Program Proofs via Abduction
- Computer Aided Verification
- Refining Interface Alphabets for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
This page was built for publication: Automated program repair using formal verification techniques