Maude: specification and programming in rewriting logic

DOI10.1016/S0304-3975(01)00359-0zbMath1001.68059OpenAlexW2134287022WikidataQ123905910 ScholiaQ123905910MaRDI QIDQ1608917

Steven Eker, Francisco Durán, Manuel Clavel, Patrick D. Lincoln, Narciso Martí-Oliet

Publication date: 13 August 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00359-0

zbMATH Keywords

reflection parameterization rewriting logic Maude internal strategies functional modules system modules

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Grammars and rewriting systems (68Q42)

Related Items (82)

Modelling and analysing neural networks using a hybrid process algebra ⋮ Rewriting logic: Roadmap and bibliography ⋮ Executable structural operational semantics in Maude ⋮ Structured theories and institutions ⋮ Invariant-driven specifications in Maude ⋮ Algebraic simulations ⋮ A Rewriting Logic Approach to Type Inference ⋮ Creol: A type-safe object-oriented model for distributed concurrent systems ⋮ Modular and incremental proofs of AC-termination ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Specification and analysis of the AER/NCA active network protocol suite in real-time Maude ⋮ Verifiable abstractions for contract-oriented systems ⋮ Dynamic rebinding for concurrent object groups: theory and practice ⋮ Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic ⋮ A rewriting logic framework for operational semantics of membrane systems ⋮ The rewriting logic semantics project ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ Semantics and pragmatics of real-time maude ⋮ Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types ⋮ Static checking of GDPR-related privacy compliance for object-oriented distributed systems ⋮ Two Decades of Maude ⋮ Twenty years of rewriting logic ⋮ Strategy based semantics for mobility with time and access permissions ⋮ Parallelized sequential composition and hardware weak memory models ⋮ A model learning based testing approach for kernel P systems ⋮ Connectors as designs: modeling, refinement and test case generation ⋮ A generic framework for \(n\)-protocol compatibility checking ⋮ A survey of strategies in rule-based program transformation systems ⋮ Executable component-based semantics ⋮ Equational abstractions ⋮ Travelling salesman problem in tissue P systems with costs ⋮ Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules ⋮ Backwards type analysis of asynchronous method calls ⋮ Reachability in Conditional Term Rewriting Systems ⋮ Maude as a Platform for Designing and Implementing Deep Inference Systems ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Relating State-Based and Process-Based Concurrency through Linear Logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework ⋮ Behavioral abstraction is hiding information ⋮ Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors ⋮ Memory Representations in Rewriting Logic Semantics Definitions ⋮ Proof Search for the First-Order Connection Calculus in Maude ⋮ Combining Techniques to Reduce State Space and Prove Strong Properties ⋮ Proving weak properties of rewriting ⋮ Proving operational termination of membership equational programs ⋮ Concurrent Objects à la Carte ⋮ Defining and Executing P Systems with Structured Data in K ⋮ A wide-spectrum language for verification of programs on weak memory models ⋮ Semantic foundations for generalized rewrite theories ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ An Object-Oriented Component Model for Heterogeneous Nets ⋮ Validating Timed Models of Deployment Components with Parametric Concurrency ⋮ Soft constraint automata with memory ⋮ An operational semantics for object-oriented concepts based on the class hierarchy ⋮ Programming and symbolic computation in Maude ⋮ A rewriting logic approach to operational semantics ⋮ Maude ⋮ Generating Series in the Cohomology of Hilbert Schemes of Points on Surfaces ⋮ Maximally Parallel Contextual String Rewriting ⋮ Strong and NV-sequentiality of constructor systems ⋮ Defining Actions in Concurrent Declarative Programming ⋮ Comparing Meseguer's Rewriting Logic with the Logic CRWL ⋮ Operational termination of conditional term rewriting systems ⋮ Dynamic structural operational semantics ⋮ Testing Concurrent Objects with Application-Specific Schedulers ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems ⋮ Normal forms for algebras of connections. ⋮ Deduction, Strategies, and Rewriting ⋮ Recent Advances in Real-Time Maude ⋮ An Account of Implementing Applicative Term Rewriting ⋮ A Rewriting Logic Approach to Operational Semantics (Extended Abstract) ⋮ Regular Strategies as Proof Tactics for CIRC ⋮ Partial Order Reduction for Rewriting Semantics of Programming Languages ⋮ Solving Sudoku Puzzles with Rewriting Rules ⋮ Reflection in conditional rewriting logic ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ Two case studies of semantics execution in Maude: CCS and LOTOS

Uses Software

Cites Work

This page was built for publication: Maude: specification and programming in rewriting logic