Finding and fixing faults

DOI10.1016/J.JCSS.2011.05.005MaRDI QIDQ414907zbMATHOpenAlexFDO

Authors Barbara Jobstmann, Stefan Staber, Andreas Griesmayer, Roderick Bloem

Publication date 11 May 2012

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2011.05.005

zbMATH Keywords

verificationgameslinear temporal logicdebuggingfault correctionfault localization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) 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

• Correct Hardware Design and Verification Methods
• Computer Aided Verification
• Repair of Boolean Programs with an Application to C
• Verification, Model Checking, and Abstract Interpretation
• Fault Localization and Correction with QBF

Cites work

• scientific article; zbMATH DE number 1670781 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1982201 (Why is no real title available?)
• scientific article; zbMATH DE number 1744961 (Why is no real title available?)
• scientific article; zbMATH DE number 2087625 (Why is no real title available?)
• scientific article; zbMATH DE number 2089877 (Why is no real title available?)
• scientific article; zbMATH DE number 918600 (Why is no real title available?)
• scientific article; zbMATH DE number 1392310 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• A theory of diagnosis from first principles
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Church's Problem Revisited
• Computer Aided Verification
• Computer aided verification. 8th international conference, CAV '96, New Brunswick, NJ, USA, July 31 -- August 3, 1996. Proceedings
• Correct Hardware Design and Verification Methods
• Deterministic generators and games for LTL fragments
• Diagnosing multiple faults
• Enhancing model checking in verification by AI techniques
• Fault Localization and Correction with QBF
• Lazy abstraction
• Model-based diagnosis of hardware designs
• Myths about the mutual exclusion problem
• On observability of discrete-event systems
• On the synthesis of strategies in infinite games
• Repair of Boolean Programs with an Application to C
• The directed subgraph homeomorphism problem
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• ``More deterministic vs. ``smaller Büchi automata for efficient LTL model checking

Cited in

(15)

• Repair of Boolean Programs with an Application to C
• On faults and faulty programs
• Vacuity in synthesis
• A game-theoretic approach to fault diagnosis and identification of hybrid systems
• CTL update of Kripke models through protections
• Graph Games and Reactive Synthesis
• Fault Localization and Correction with QBF
• Defect and evaluations
• Program repair without regret
• Synthesizing non-vacuous systems
• Computer Aided Verification
• Must fault localization for program repair
• Symbolic model checking in non-Boolean domains
• Correct Hardware Design and Verification Methods
• Bug localization by constructing reduced traces

Describes a project that uses

Uses Software

• CBMC
• CodeSurfer
• VIS

This page was built for publication: Finding and fixing faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414907)