Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
On-the-Fly Model Checking Under Fairness that Exploits Symmetry
Formal Methods in System Design
SMC: a symmetry-based model checker for verification of safety and liveness properties
ACM Transactions on Software Engineering and Methodology (TOSEM)
From model checking to a temporal proof
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Focusing qualitative simulation using temporal logic: theoretical foundations
Annals of Mathematics and Artificial Intelligence
Multiple State and Single State Tableaux for Combining Local and Global Model Checking
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Scalable Distributed On-the-Fly Symbolic Model Checking
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Verification Using Tabled Logic Programming
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Partial-Order Methods for Model Checking: From Linear Time to Branching Time
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Efficient temporal-logic query checking for presburger systems
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
A verification methodology for concurrent software with synchronous communication
Formal methods and models for system design
Local Module Checking for CTL Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal verification of an automotive scenario in service-oriented computing
Proceedings of the 30th international conference on Software engineering
A Model Checking Approach to Protocol Conversion
Electronic Notes in Theoretical Computer Science (ENTCS)
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
SoC design approach using convertibility verification
EURASIP Journal on Embedded Systems - Model-driven high-level programming of embedded systems: selected papers from SLA++P'07 and SLA++P'08
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Game Over: The Foci Approach to LTL Satisfiability and Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
A model checking approach for verifying COWS specifications
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Multi-clock SoC design using protocol conversion
Proceedings of the Conference on Design, Automation and Test in Europe
An abstract, on the fly framework for the verification of service-oriented systems
Rigorous software engineering for service-oriented systems
Rigorous software engineering for service-oriented systems
A tableau method for verifying dialogue game protocols for agent communication
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Modeling and verification of distributed autonomous agents using logic programming
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Incremental, inductive CTL model checking
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Temporal Logics for Phylogenetic Analysis via Model Checking
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL*. The time complexity of our algorithm matches that of the best existing ``global algorithm'' for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice.