Automated program repair using formal verification techniques
From MaRDI portal
Publication:6113992
Recommendations
Cites work
- scientific article; zbMATH DE number 1670774 (Why is no real title available?)
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 3935016 (Why is no real title available?)
- scientific article; zbMATH DE number 1283472 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- Assume, guarantee or repair
- Automated assumption generation for compositional verification
- Automated circular assume-guarantee reasoning
- Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
- Automatic program repair using formal verification and expression templates
- Computer Aided Verification
- Connecting program synthesis and reachability: automatic program repair using test-input generation
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning regular sets from queries and counterexamples
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Maximal specification synthesis
- Must fault localization for program repair
- Optimized L*-Based Assume-Guarantee Reasoning
- Program repair without regret
- Proofs of Networks of Processes
- Refining Interface Alphabets for Compositional Verification
- Sound and complete mutation-based program repair
- Synthesis of circular compositional program proofs via abduction
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(3)
This page was built for publication: Automated program repair using formal verification techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113992)