Proving Modal Properties of Rewrite Theories Using Maude's Metalevel

Authors:
Isabel Pita;Miguel Palomino
Affiliations:
Departamento de Sistemas Informáticos, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos, Universidad Complutense de Madrid, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 0

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ELAN from a rewriting logic point of view

Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Towards a Verification Logic for Rewriting Logic

WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Proving VLRL Action Properties with the Maude Model Checker

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rewriting logic is a very expressive formalism for the specification of concurrent and distributed systems; more generally, it is a logic of change. In contrast, VLRL is a modal logic built on top of rewriting logic to reason precisely about that change. Here we present a technique to mechanically prove VLRL properties of rewrite theories using the reflective capability of rewriting logic through its Maude implementation.