Tableau-based model checking in the propositional mu-calculus
Acta Informatica
A note on model checking the model &ngr;-calculus
Selected papers of the 16th international colloquium on Automata, languages, and programming
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
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
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Rewriting Logic and Maude: Concepts and Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Automatic verification of a model checker by reflection
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
In this paper, a rewrite theory for checking @m-calculus properties is developed. We use the same framework proposed in [Steven Eker, Jose Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth International Workshop on Rewriting Logic, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002] and demonstrate how rewriting logic can be used as a unified formalism from model specification to verification algorithm implementation. Furthermore, since @m-calculus is more expressive than LTL, this work can be seen as an extension to [Steven Eker, Jose Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth International Workshop on Rewriting Logic, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002] in theory. We also develop a CTL to @m-calculus translator to help users write CTL specifications more easily. However, the corresponding LTL to @m-calculus translator is missing. The LTL model checker in [Steven Eker, Jose Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth International Workshop on Rewriting Logic, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002] is still preferred in practice.