Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Fourth International Conference on Formal methods for open object-based distributed systems IV
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
Formal Methods in System Design
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Abstraction and Completeness for Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Formal simulation and analysis of the CASH scheduling algorithm in real-time maude
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast protocol components. Because of the time-sensitive and resource-sensitive behavior and the composability of its components, AER/NCA poses challenging new problems for its formal specification and analysis. Real-Time Maude is a natural extension of the Maude rewriting logic language and tool for the specification and analysis of real-time object-based distributed systems. It supports a wide spectrum of formal methods, including: executable specification; symbolic simulation; and infinite-state model checking of temporal logic formulas. These methods complement those offered by finite-state model checkers and general-purpose theorem provers. Real-Time Maude has proved to be well-suited to meet the AER/NCA modeling challenges, and its methods have been effective in uncovering subtle and important errors in the informal use case specification.