Program repair without regret
DOI10.1007/S10703-015-0223-6zbMATH Open1322.68056OpenAlexW2144540268MaRDI QIDQ746769FDOQ746769
Authors: Christian von Essen, Barbara Jobstmann 
Publication date: 20 October 2015
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/283987
Recommendations
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tighter Bounds for the Determinisation of Büchi Automata
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Title not available (Why is that?)
- Enhancing model checking in verification by AI techniques
- Symbolic synthesis of masking fault-tolerant distributed programs
- Finding and fixing faults
- On the power of bounded concurrency I
- Computer Aided Verification
- Simulation distances
- Title not available (Why is that?)
- Abstraction-guided synthesis of synchronization
- Tools and Algorithms for the Construction and Analysis of Systems
- Solving Sequential Conditions by Finite-State Strategies
- Repair of Boolean Programs with an Application to C
- Open Implication
- Synthesis from LTL specifications with mean-payoff objectives
- Inferring Synchronization under Limited Observability
- Program repair without regret
Cited In (19)
- Program Repair for Hyperproperties
- Assume, guarantee or repair
- Explaining safety violations in real-time systems
- Model and program repair via group actions
- Specification-based program repair using SAT
- Bounded repairability of word languages
- Ensuring average recovery with adversarial scheduler
- Automatic addition of conflicting properties
- Repair of Boolean Programs with an Application to C
- Optimal repair for omega-regular properties
- Repairing real-time requirements
- Automated repair of heap-manipulating programs using deductive synthesis
- Repairing decision-making programs under uncertainty
- Program repair without regret
- Toward a theory of program repair
- Computer Aided Verification
- Sound and complete mutation-based program repair
- On module-based abstraction and repair of behavioral programs
- Automated program repair using formal verification techniques
Uses Software
This page was built for publication: Program repair without regret
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746769)
