Program repair without regret

DOI10.1007/S10703-015-0223-6MaRDI QIDQ746769zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

synthesisreactive systemsgameslinear temporal logicprogram repair

Mathematics Subject Classification ID

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)

Recommendations

• Computer Aided Verification
• Toward a theory of program repair
• Program Repair for Hyperproperties
• Must fault localization for program repair

Cites work

• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1982201 (Why is no real title available?)
• scientific article; zbMATH DE number 1903365 (Why is no real title available?)
• Abstraction-guided synthesis of synchronization
• Computer Aided Verification
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Enhancing model checking in verification by AI techniques
• Finding and fixing faults
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Inferring Synchronization under Limited Observability
• On the power of bounded concurrency I
• Open Implication
• Program repair without regret
• Repair of Boolean Programs with an Application to C
• Simulation distances
• Solving Sequential Conditions by Finite-State Strategies
• Symbolic synthesis of masking fault-tolerant distributed programs
• Synthesis from LTL specifications with mean-payoff objectives
• Tighter Bounds for the Determinisation of Büchi Automata
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(20)

• Repair of Boolean Programs with an Application to C
• Bounded repairability of word languages
• Assume, guarantee or repair
• An automated system repair framework with signal temporal logic
• Sound and complete mutation-based program repair
• On module-based abstraction and repair of behavioral programs
• Explaining safety violations in real-time systems
• Toward a theory of program repair
• Ensuring average recovery with adversarial scheduler
• Specification-based program repair using SAT
• Optimal repair for omega-regular properties
• Repairing real-time requirements
• Repairing decision-making programs under uncertainty
• Program repair without regret
• Model and program repair via group actions
• Computer Aided Verification
• Program Repair for Hyperproperties
• Automated program repair using formal verification techniques
• Automatic addition of conflicting properties
• Automated repair of heap-manipulating programs using deductive synthesis

Describes a project that uses

Uses Software

• NuSMV
• CESAR

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)