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
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
Computer-Aided reasoning
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Binary Decision Diagrams by Shard Rewriting
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Verified Model Checker for the Modal µ-calculus in Coq
TACAS '98 Proceedings of the 4th International Conference 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
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Rewriting Logic as a Metalogical Framework
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Operating System Concepts
μ-Calculus Model Checking in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Intuitively, reflection is the feature that can represent and reason meta-level entities at the object level. In this paper, we use a reflective language to implement a local model checker and analyze the implementation. The implementation is greatly simplified by reflection. Further, we show the feature can be applied to verify the concise implementation rather easily. The simplicity of our approach suggests that reflection may be useful in the implementation and verification of other explicit-state model checking algorithms.