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
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking large software specifications
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
CTL model checking based on forward state traversal
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Symbolic Model Checking
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Using induction and BDDs to model check invariants
Proceedings of the IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods: Advances in Hardware Design and Verification
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Verification of the Futurebus+ Cache Coherence Protocol
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
Symbolic model checking, smc, is a decision procedure that verifies that some finite-state structure is a model for a formula of Computation Tree Logic (CTL). smc is based on fixpoint computations. Unfortunately, as the size of a structure grows exponentially with the number of state components, smc is not always powerful enough to handle realistic problems. We first show that a subset of CTL formulas can be checked by testing simple sufficient conditions, that do not require any fixpoint computation. Based on these observations, we identify a second, larger, subset of CTL that can by verified with fewer fixpoint computations than smc. We propose a model checking algorithm for CTL that tests the identified sufficient conditions whenever possible and falls back to smc otherwise. In the best (resp. worst) case, the complexity of this algorithm is exponentially better (resp. the same) in terms of state components than that of smc.