Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

DOI10.1007/978-3-540-77050-3_44zbMath1135.68481OpenAlexW1536576409MaRDI QIDQ5458863

Matthias Schmalz, Daniele Varacca, Hagen Völzer

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/69252

Mathematics Subject Classification ID

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

Related Items (1)

Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

Cites Work

• Modalities for model checking: Branching time logic strikes back
• The complexity of propositional linear temporal logics
• The complexity of probabilistic verification
• Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths