Lex & yacc
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
Computer-Aided reasoning
Operating System Concepts
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
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
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
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
In this paper, we propose to model and analyze applications with domain-specific languages by reflection. We argue that both tasks can be significantly simplified by using a reflective modeling language. To make our arguments, we model and analyze a model checker in the reflective language Maude. The simplicity of our methodology suggests our methodology is useful for such applications.