On the complexity of error explanation

DOI10.1007/978-3-540-30579-8_29MaRDI QIDQ5711507zbMATH OpenOpenAlexFDO

Authors Nirman Kumar, Viraj Kumar, Mahesh Viswanathan

Publication date 6 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105073

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• What went wrong: Explaining counterexamples
• Explaining counterexamples using causality
• Tools and Algorithms for the Construction and Analysis of Systems
• Explaining Counterexamples Using Causality
• Making the most of BMC counterexamples

Cited in

(7)

• Generating error traces from verification-condition counterexamples
• Finding and fixing faults
• Fate and free will in error traces
• Error invariants
• Tools and Algorithms for the Construction and Analysis of Systems
• Automated Technology for Verification and Analysis
• Correct Hardware Design and Verification Methods

This page was built for publication: On the complexity of error explanation

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