Incompleteness of states w.r.t. traces in model checking

DOI10.1016/j.ic.2006.01.001zbMath1103.68074OpenAlexW1980205677MaRDI QIDQ2492186

Francesco Ranzato, Roberto Giacobazzi

Publication date: 9 June 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.01.001

zbMATH Keywords

specification languagesautomatic verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Calculational design of a regular model checker by abstract interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Results on the propositional \(\mu\)-calculus
• Counterexample-guided abstraction refinement for symbolic model checking
• “Sometimes” and “not never” revisited
• Temporal abstract interpretation
• Programming Languages and Systems
• Making abstract interpretations complete
• Programming Languages and Systems
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Incompleteness of states w.r.t. traces in model checking