Buscar
Mostrando ítems 1-3 de 3
Towards a Maude Formal Environment
(Springer, 2011)
Maude is a declarative and reflective language based on rewriting logic in which computation corresponds to efficient deduction by rewriting. Because of its reflective capabilities, Maude has been useful as a metatool in ...
Tool Interoperability in the Maude Formal Environment
(Springer, 2011)
We present the Maude Formal Environment (MFE), an executable formal specification in Maude within which a user can seamlessly interact with the Maude Termination Tool, the Maude Sufficient Completeness Checker, the ...
Proving Safety Properties of Rewrite Theories
(Springer, 2011)
Rewrite theories are a general and expressive formalism for specifying concurrent systems in which states are axiomatized by equations and transitions among states are axiomatized by rewrite rules. We present a deductive ...