Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Introduction to algorithms
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
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
IEEE Spectrum
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
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Formal verification in a commercial setting
DAC '97 Proceedings of the 34th annual Design Automation Conference
Model checking
A New Heuristic for Bad Cycle Detection Using BDDs
Formal Methods in System Design - Special issue on CAV '97
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Symbolic Model Checking
Model Checking of Safety Properties
Formal Methods in System Design
Another Look at LTL Model Checking
Formal Methods in System Design
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
On the Verification of Temporal Properties
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
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
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Analysis of Symbolic SCC Hull Algorithms
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Is There a Best Symbolic Cycle-Detection Algorithm?
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
The Complexity of Graph Problems fore Succinctly Represented Graphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The Quest for Efficient Boolean Satisfiability Solvers
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
From complementation to certification
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Efficient LTL compilation for SAT-based model checking
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Nested emptiness search for generalized Büchi automata
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
From PSL to NBA: a Modular Symbolic Encoding
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Cluster-Based LTL model checking of large systems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Simple is better: efficient bounded model checking for past LTL
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A note on on-the-fly verification algorithms
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On-the-fly emptiness checks for generalized büchi automata
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
PSL model checking and run-time verification via testers
FM'06 Proceedings of the 14th international conference on Formal Methods
Deterministic dynamic monitors for linear-time assertions
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
25 Years of Model Checking
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Formal Methods in System Design
Büchi Complementation and Size-Change Termination
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Model Checking as A Reachability Problem
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On-the-fly Emptiness Check of Transition-Based Streett Automata
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
LTL Model Checking for Recursive Programs
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Linear-time model checking: automata theory in practice
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Pillars of computer science
Choreography conformance via synchronizability
Proceedings of the 20th international conference on World wide web
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
State coverage metrics for specification-based testing with Büchi automata
TAP'11 Proceedings of the 5th international conference on Tests and proofs
State/event-based LTL model checking under parametric generalized fairness
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
Science of Computer Programming
Model checking LTLR formulas under localized fairness
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Enforceable Security Policies Revisited
ACM Transactions on Information and System Security (TISSEC)
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
In automata-theoretic model checking we compose the design under verification with a Büchi automaton that accepts traces violating the specification. We then use graph algorithms to search for a counterexample trace. The basic theory of this approach was worked out in the 1980s, and the basic algorithms were developed during the 1990s. Both explicit and symbolic implementations, such as SPIN and and SMV, are widely used. It turns out, however, that there are still many gaps in our understanding of the algorithmic issues involved in automata-theoretic model checking. This paper covers the fundamentals of automata-theoretic model checking, review recent progress, and outlines areas that require further research.