Integrating maude into hets

Authors:
Mihai Codescu;Till Mossakowski;Adrián Riesco;Christian Maeder
Affiliations:
DFKI GmbH Bremen and University of Bremen, Germany;DFKI GmbH Bremen and University of Bremen, Germany;Facultad de Informáatica, Universidad Complutense de Madrid, Spain;DFKI GmbH Bremen and University of Bremen, Germany
Venue:
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Year:
2010

Citing 10
Cited 0

Initial computability, algebraic specifications, and partial algebras

Initial computability, algebraic specifications, and partial algebras
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
Specification and proof in membership equational logic

Theoretical Computer Science - Trees in algebra and programming
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
MTT: The Maude Termination Tool (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Institution-independent Model Theory

Institution-independent Model Theory
The heterogeneous tool set, HETS

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Maude modules can be understood as models that can be formally analyzed and verified with respect to different properties expressing various formal requirements. However, Maude lacks the formal tools to perform some of these analyses and thus they can only be done by hand. The Heterogeneous Tool Set Hets is an institution-based combination of different logics and corresponding rewriting, model checking and proof tools. We present in this paper an integration of Maude into Hets that allows to use the logics and tools already integrated in Hets with Maude specifications. To achieve such integration we have defined an institution for Maude based on preordered algebras and a comorphism between Maude and CASL, the central logic in HETS.