Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Combining matching algorithms: The regular case
Journal of Symbolic Computation
Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
Information and Computation
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Fourth International Conference on Formal methods for open object-based distributed systems IV
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Communication and Concurrency
Algebraic Foundations of Systems Specification
Algebraic Foundations of Systems Specification
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
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
Actor theories in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
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
Solving the Inheritance Anomaly in Concurrent Object-Oriented Programming
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Rewriting: An Effective Model of Concurrency
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Rewriting Logic and Maude: Concepts and Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
Rewriting modulo a rewrite system
Rewriting modulo a rewrite system
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
The Extensibility of Maude's Module Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Towards a Toolkit for Actor System Specification
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Semantic Models for Distributed Object Reflection
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Building Tools for LOTOS Symbolic Semantics in Maude
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Transformations and Software Modeling Languages: Automating Transformations in UML
UML '02 Proceedings of the 5th International Conference on The Unified Modeling Language
A compositional formalism for object viewpoints
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Formalizing ODP enterprise specifications in Maude
Computer Standards & Interfaces
Certifying Domain-Specific Policies
Proceedings of the 16th IEEE international conference on Automated software engineering
Monitoring Programs Using Rewriting
Proceedings of the 16th IEEE international conference on Automated software engineering
Revisiting the algebra of Petri net processes under the collective token philosophy
Fundamenta Informaticae - Concurrency specification and programming
Simplification and termination of strategies in rule-based languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Formal approaches to systems analysis using UML: an overview
Advanced topics in database research vol. 1
Structured theories and institutions
Theoretical Computer Science
Strong and NV-sequentiality of constructor systems
Information Processing Letters
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
The transient combinator, higher-order strategies, and the distributed data problem
Science of Computer Programming - Special issue on program transformation
Formal prototyping in early stages of protocol design
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Behavioral abstraction is hiding information
Theoretical Computer Science - Selected papers of CMCS'03
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Rewriting-Based Techniques for Runtime Verification
Automated Software Engineering
Operational termination of conditional term rewriting systems
Information Processing Letters
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
A specification language for coordinated objects
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Generic programming and high-performance libraries
International Journal of Parallel Programming - Special issue: The next generation software program
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
Formal Methods in System Design
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
A rewriting logic framework for operational semantics of membrane systems
Theoretical Computer Science
The rewriting logic semantics project
Theoretical Computer Science
Writing and executing ODP computational viewpoint specifications using Maude
Computer Standards & Interfaces
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Science of Computer Programming
Modeling and verification of real-time systems based on equations
Science of Computer Programming
Recent Advances in Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
An Account of Implementing Applicative Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Rewriting Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving Sudoku Puzzles with Rewriting Rules
Electronic Notes in Theoretical Computer Science (ENTCS)
On Modelling Sensor Networks in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A rewriting approach to the design and evolution of object-oriented languages
Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
Algebraic Stuttering Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Regular Strategies as Proof Tactics for CIRC
Electronic Notes in Theoretical Computer Science (ENTCS)
Validating Behavioral Component Interfaces in Rewriting Logic
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
An Open System Operational Semantics for an Object-Oriented and Component-Based Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Model-checking agent refinement
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Computational Logical Frameworks and Generic Program Analysis Technologies
Verified Software: Theories, Tools, Experiments
Testing Concurrent Objects with Application-Specific Schedulers
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Maude as a Platform for Designing and Implementing Deep Inference Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards composition of distributed evolving services: the Credo approach (invited paper)
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
An Object-Oriented Component Model for Heterogeneous Nets
Formal Methods for Components and Objects
Coordinating Object Oriented Components Using Data-Flow Networks
Formal Methods for Components and Objects
Defining and Executing P Systems with Structured Data in K
Membrane Computing
A rewriting logic approach to operational semantics
Information and Computation
Comparison of Maude and SAL by Conducting Case Studies Model Checking a Distributed Algorithm
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Algebraic Framework for Modeling of Mobile Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof Search for the First-Order Connection Calculus in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Memory Representations in Rewriting Logic Semantics Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining Techniques to Reduce State Space and Prove Strong Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
The Second Rewrite Engines Competition
Electronic Notes in Theoretical Computer Science (ENTCS)
Different models for model matching: An analysis of approaches to support model differencing
CVSM '09 Proceedings of the 2009 ICSE Workshop on Comparison and Versioning of Software Models
Invariant-driven specifications in Maude
Science of Computer Programming
Dynamic Symbolic Execution of Distributed Concurrent Objects
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Dynamic Symbolic Execution for Testing Distributed Objects
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Web Services and Interoperability for the Maude Termination Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
A formalization of the SMEPP model in Maude
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
Modeling and Testing Multi-Threaded Asynchronous Systems with Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Intra-Object versus Inter-Object: Concurrency and Reasoning in Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Tool Support for Holistic Modelling of Distributed Embedded Systems in Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Maude to write and execute ODP information viewpoint specifications
Computer Standards & Interfaces
Checking Protocol Compatibility using Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling and Analysis of Thread-Pools in an Industrial Communication Platform
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Proving Modal Properties of Rewrite Theories Using Maude's Metalevel
Electronic Notes in Theoretical Computer Science (ENTCS)
An Environment for the Development of Concurrent Object-Based Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
New Evaluation Commands for Maude Within Full Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Communicating Concurrent Objects in HiddenCCS
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Rewriting Semantics in Practice
Electronic Notes in Theoretical Computer Science (ENTCS)
A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls
Electronic Notes in Theoretical Computer Science (ENTCS)
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational Semantics and Rewriting Logic in Membrane Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
The Rewriting Logic Semantics Project
Electronic Notes in Theoretical Computer Science (ENTCS)
Validating Behavioral Component Interfaces in Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Toolkit for Generating and Displaying Proof Scores in the OTS/CafeOBJ Method
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Mobile Ambients in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational termination of conditional term rewriting systems
Information Processing Letters
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Verifying safety properties of concurrent heap-manipulating programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experiments with test case generation and runtime analysis
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Rule-based analysis of dimensional safety
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A complete guide to the future
ESOP'07 Proceedings of the 16th European conference on Programming
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
The maude formal tool environment
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
CIRC: a circular coinductive prover
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On formal analysis of OO languages using rewriting logic: designing for performance
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
A probabilistic formal analysis approach to cross layer optimization in distributed embedded systems
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
KOOL: an application of rewriting logic to language prototyping and analysis
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Combining formal verification with observed system execution behavior to tune system parameters
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Rocket-fast proof checking for SMT solvers
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th 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
Tool support for generation and validation of traces between requirements and architecture
Proceedings of the 6th ECMFA Traceability Workshop
Electronic Notes in Theoretical Computer Science (ENTCS)
Resource Modeling for Timed Creol Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Dating concurrent objects: real-time modeling and schedulability analysis
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Model checking agent programs by using the program interpreter
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A rule-based approach to XML processing and web reasoning
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
The third rewrite engines competition
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Formal modeling and verification of sensor network encryption protocol in the OTS/CafeOBJ method
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Dynamic resource reallocation between deployment components
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Confluent Term Rewriting for Only-knowing Logics
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Validating timed models of deployment components with parametric concurrency
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Designing and Implementing the OP and OP2 Web Browsers
ACM Transactions on the Web (TWEB)
Functional term rewriting systems towards symbolic model-checking
International Journal of Critical Computer-Based Systems
Reasoning about metamodeling with formal specifications and automatic proofs
Proceedings of the 14th international conference on Model driven engineering languages and systems
Evaluation of tools and slicing techniques for efficient verification of UML/OCL class diagrams
Advances in Software Engineering
Towards a Maude formal environment
Formal modeling
Expressing control mechanisms of membranes by rewriting strategies
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Specification and analysis of distributed object-based stochastic hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A dynamic binding strategy for multiple inheritance and asynchronously communicating objects
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Induction-guided falsification
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Rule-based programming and proving: the ELAN experience outcomes
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Structural operational semantics of p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Cellular meta-programming over membranes
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Functorial semantics of rewrite theories
Formal Methods in Software and Systems Modeling
Executable specifications of p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
A dynamic class construct for asynchronous concurrent objects
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Transforming information in RDF to rewriting logic
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Natural rewriting for general term rewriting systems
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Theoroidal maps as algebraic simulations
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Specifying DIMA multi-agents models using maude
PRIMA'04 Proceedings of the 7th Pacific Rim international conference on Intelligent Agents and Multi-Agent Systems
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Automatic support for traceability in a generic model management framework
ECMDA-FA'05 Proceedings of the First European conference on Model Driven Architecture: foundations and Applications
Grouping nodes in wireless sensor networks using coalitional game theory
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
An algebraic specification of generic OCL queries within the eclipse modeling framework
ECMDA-FA'06 Proceedings of the Second European conference on Model Driven Architecture: foundations and Applications
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Term rewriting meets aspect-oriented programming
Processes, Terms and Cycles
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Type-Safe runtime class upgrades in creol
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Concurrency, Compositionality, and Correctness
Algebraic specification of a model transformation engine
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
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
Connectors as designs: Modeling, refinement and test case generation
Science of Computer Programming
A generic framework for n-protocol compatibility checking
Science of Computer Programming
High-Level Petri Net Model Checking with AlPiNA
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Dynamic symbolic computation for domain-specific language implementation
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Validating Behavioral Component Interfaces in Rewriting Logic
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
A timed mobility semantics based on rewriting strategies
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Formal analysis of TESLA protocol in the timed OTS/CafeOBJ method
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Probabilistic graph transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Understanding specification languages through their model theory
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Formal Modeling and Verification of Security Property in Handel C Program
International Journal of Secure Software Engineering
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Banana Algebra: Compositional syntactic language extension
Science of Computer Programming
Efficient and fully abstract routing of futures in object network overlays
Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control
Journal of Systems and Software
Hi-index | 0.01 |
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. 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, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude.