Efficient debugging in a formal verification environment

DOI10.1007/3-540-44798-9_23MaRDI QIDQ4787239zbMATH OpenFDO

Authors Fady Copty, Amitai Irron, Osnat Weissberg, Nathan Kropp, Gila Kamhi

Publication date 9 January 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2144/21440275

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Specification and verification (program logics, model checking, etc.) (68Q60) Computing methodologies and applications (68U99)

Recommendations

• Fundamental Approaches to Software Engineering
• Debugging of concurrent systems using counterexample analysis
• Semi-formal verification of memory systems by symbolic simulation
• Temporal debugging for concurrent systems
• Reveal: A Formal Verification Tool for Verilog Designs

Cited in

(7)

• CTL Model-Checking with Graded Quantifiers
• scientific article; zbMATH DE number 1191738 (Why is no real title available?)
• A formal semantics for program debugging
• Explaining counterexamples using causality
• Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging
• Understanding counterexamples for relational properties with \textit{DIbugger}
• Semi-formal verification of memory systems by symbolic simulation

This page was built for publication: Efficient debugging in a formal verification environment

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