Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Sequential circuit verification using symbolic model checking
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Model checking and Boolean graphs
ESOP'92 Symposium proceedings on 4th European symposium on programming
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
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
Proceedings of the 6th International Conference on Computer Aided Verification
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Semantics Based Verification Tool for Finite State Systems
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
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
A Note on Model Checking the Modal nu-Calculus
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Local Model Checking in the Modal Mu-Calculus
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Branching Time Temporal Logic and Amorphous Tree Automata
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion
Proceedings of the 7th International Conference on Computer Aided Verification
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Computation tree logic and regular omega-languages
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
CTL* and ECTL* as Fragments of the Modal µ-Calculus
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Symbolic Model Checking for Rectangular Hybrid Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Efficient Model Checking Via Büchi Tableau Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model Checking the World Wide Web
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
From Pre-Historic to Post-Modern Symbolic Model Checking
Formal Methods in System Design
An optimizing compiler for batches of temporal logic formulas
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking communicative agent-based systems
Knowledge-Based Systems
Model Checking Communicative Agent-Based Systems
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Distributed synthesis for alternating-time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Parameterized verification of π-calculus systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
This paper studies the use of an equational variant of the modal /spl mu/-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the /spl mu/-calculus. Using this translation, one may then employ /spl mu/-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*.