• Publications
  • Influence
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic
I: Core Maude.- Using Maude.- Syntax and Basic Parsing.- Functional Modules.- A Hierarchy of Data Types: From Trees to Sets.- System Modules.- Playing with Maude.- Module Operations.- Predefined DataExpand
  • 869
  • 110
Maude: specification and programming in rewriting logic
TLDR
This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules. Expand
  • 894
  • 102
  • PDF
The Maude 2.0 System
This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the newExpand
  • 314
  • 28
  • PDF
The Maude System
TLDR
Maude is a high-performance language and system supporting both equational and rewriting logic computation for a wide range of applications, including development of theorem proving tools, language prototyping, executable specification and analysis of concurrent and distributed systems, and logical framework applications. Expand
  • 123
  • 5
Towards Maude 2.0
TLDR
Maude 2.0 is the new version of the Maude rewriting logic language currently under development. Expand
  • 39
  • 4
Termination Modulo Combinations of Equational Theories
TLDR
This work proposes a modular termination proof method based on semantics- and termination-preserving transformations that can reduce the proof of termination of rules R modulo E to an equivalent proof of the transformed rules modulo a typically much simpler set B of axioms. Expand
  • 44
  • 3
  • PDF
Adaptive management of applications across multiple clouds: The SeaClouds Approach
TLDR
Seamless adaptive multi-cloud management of service-based applications by supporting the distribution, monitoring and migration of application modules over multiple heterogeneous cloud platforms. Expand
  • 27
  • 3
  • PDF
Building Equational Proving Tools by Reflection in Rewriting Logic
Publisher Summary This chapter explains the design and use of two proving tools such as inductive theorem prover and a Church-Rosser checker. It uses these tools to prove theorems about equationalExpand
  • 88
  • 2
Proving operational termination of membership equational programs
TLDR
We present a sequence of theory transformations that can be used to bridge the gap between expressive membership equational programs and such termination tools and prove the correctness of such transformations. Expand
  • 80
  • 2
  • PDF
Formal Specification and Analysis of Domain Specific Models Using Maude
TLDR
We use Maude as a formal notation for describing models, metamodels, and their dynamic behavior, making models amenable to formal analysis, reasoning, and simulation. Expand
  • 57
  • 2
  • PDF
...
1
2
3
4
5
...