Journal of Symbolic Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Formal prototyping in early stages of protocol design
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
Formal Methods in System Design
Fundamentals of Database Systems (5th Edition)
Fundamentals of Database Systems (5th Edition)
The rewriting logic semantics project
Theoretical Computer Science
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
A Systematic Approach to Uncover Security Flaws in GUI Logic
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
State Space Reduction in the Maude-NRL Protocol Analyzer
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Theoretical Computer Science
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
This paper advocates teaching formal methods based on rewriting logic and the Maude tool for the purpose of widening access to formal methods. On the one hand, Maude's elegant, intuitive, and expressive programming/modeling language, its high-performance analysis methods, and some of its academic and industrial applications should make it appealing to a wide range of computer science students. On the other hand, teaching rewriting logic allows us to naturally incorporate substantial formal methods theory, such as equational logic and inductive theorem proving, TRS theory, and model checking. This paper also gives an overview of the content of --- and the student feedback to --- an introductory formal methods course based on rewriting logic that has been given at the University of Oslo since 2002.