The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Reasoning about infinite computations
Information and Computation
Testing language containment for &ohgr;-automata using BDDs
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
High-density reachability analysis
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Forward model checking techniques oriented to buggy designs
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Hybrid techniques for fast functional simulation
DAC '98 Proceedings of the 35th annual Design Automation Conference
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
Program Verification
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On Combining Formal and Informal Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Checking formal specifications under simulation
ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
Synthesis of communicating processes from temporal logic specifications
Synthesis of communicating processes from temporal logic specifications
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Do We Need Liveness? - Approximation of Liveness Properties by Safety Properties
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Model Checking Based on Sequential ATPG
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Maria: Modular Reachability Analyser for Algebraic System Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A Unifying Model Checking Approach for Safety Properties of Parameterized Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Sampling-based runtime verification
FM'11 Proceedings of the 17th international conference on Formal methods
Shortest counterexamples for symbolic model checking of LTL with past
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Efficient monitoring of ω-languages
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
Formal Methods in System Design
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Hi-index | 0.00 |
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region.A computation that violates a general linear property reaches a bad cycle, which witnesses the violation of the property. Accordingly, current methods and tools for model checking of linear properties are based on a search for bad cycles. A symbolic implementation of such a search involves the calculation of a nested fixed-point expression over the system's state space, and is often very difficult. Every computation that violates a safety property has a finite prefix along which the property is violated. We use this fact in order to base model checking of safety properties on a search for finite bad prefixes. Such a search can be performed using a simple forward or backward symbolic reachability check. A naive methodology that is based on such a search involves a construction of an automaton (or a tableau) that is doubly exponential in the property.We present an analysis of safety properties that enables us to prevent the doubly-exponential blow up and to use the same automaton used for model checking of general properties, replacing the search for bad cycles by a search for bad prefixes.