- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
- Maude: specification and programming in rewriting logic
- Towards Maude 2. 0
Cited in
(only showing first 100 items - show all)- A parallelized theorem prover for a logic with parallel execution
- The rewriting logic semantics project: a progress report
- Model of distributed computing system operation with time
- scientific article; zbMATH DE number 1231664 (Why is no real title available?)
- Backwards type analysis of asynchronous method calls
- scientific article; zbMATH DE number 1841841 (Why is no real title available?)
- State Space Reduction of Rewrite Theories Using Invisible Transitions
- Proving termination properties with \textsc{mu-term}
- Validating timed models of deployment components with parametric concurrency
- Mapping modular SOS to rewriting logic
- Compositional specification in rewriting logic
- A hierarchy of semantics for non-deterministic term rewriting systems
- The rewriting logic semantics project: a progress report
- Travelling salesman problem in tissue P systems with costs
- A dependency pair framework for \(A \vee C\)-termination
- On the behavioral semantics of real-time domain specific visual languages
- ROLA: a new distributed transaction protocol and its formal analysis
- scientific article; zbMATH DE number 2079670 (Why is no real title available?)
- Generalized rewrite theories, coherence completion, and symbolic methods
- Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics
- Operational termination of conditional rewriting with built-in numbers and semantic data structures
- Twenty years of rewriting logic
- Theoretical Aspects of Computing – ICTAC 2005
- Operational termination of membership equational programs: the order-sorted way
- Libraries for generic programming in Haskell
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- ABS-NET: fully decentralized runtime adaptation for distributed objects
- CiMPG+F: a proof generator and fixer-upper for CafeOBJ specifications
- Strict coherence of conditional rewriting modulo axioms
- Modular termination of basic narrowing and equational unification
- Singular and plural functions for functional logic programming
- FORMAL VALIDATION AND VERIFICATION OF ATOMIC RESOLUTION MICROSCOPE CONTROL AND TOPOGRAPHY
- Simulation and verification of synchronous set relations in rewriting logic
- Modelling and analysing neural networks using a hybrid process algebra
- Explaining safety failures in NetKAT
- Mitigating covert channels based on analysis of the potential for communication
- An Object-Oriented Component Model for Heterogeneous Nets
- Functorial models for Petri nets
- A rewriting framework and logic for activities subject to regulations
- Rewriting logic semantics of a plan execution language
- A Modular Equational Generalization Algorithm
- Model checking of a mobile robots perpetual exploration algorithm
- Algebraic theories for contextual pre-nets.
- Symbolic computation in Maude: some tapas
- Stability of termination and sufficient-completeness under pushouts via amalgamation
- Towards a trustworthy semantics-based language framework via proof generation
- Leveraging the information contained in theory presentations
- Partial evaluation of order-sorted equational programs modulo axioms
- \({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance
- Concurrent objects à la carte
- Automatic generation of logical models with AGES
- A Verification Logic for Rewriting Logic
- Dynamic structural operational semantics
- Synchronous products of rewrite systems
- Hierarchical design rewriting with Maude
- Symbolic analysis tools for CSP
- A scalable module system
- Equational formulas and pattern operations in initial order-sorted algebras
- Dynamic connectors for concurrency
- Building a Modal Interface Theory for Concurrency and Data
- A Distributed Logic for Networked Cyber-Physical Systems
- Memory representations in rewriting logic semantics definitions
- The ARC programming model -- language constructs for coordination
- Translating stochastic CLS into Maude
- Two case studies of semantics execution in Maude: CCS and LOTOS
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Specification and verification of the tree identify protocol of IEEE 1394 in rewriting logic
- CRADLE
- Executable component-based semantics
- Combining graph transformation and algebraic specification into model transformation
- Equational formulas and pattern operations in initial order-sorted algebras
- Reflection in conditional rewriting logic
- Semantics and pragmatics of real-time maude
- The rewriting logic semantics project
- scientific article; zbMATH DE number 2043550 (Why is no real title available?)
- mu-term: Verify Termination Properties Automatically (System Description)
- scientific article; zbMATH DE number 1860617 (Why is no real title available?)
- Feasible Trace Reconstruction for Rewriting Approximations
- Behavioural analysis of sessions using the calculus of structures
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Ground confluence of order-sorted conditional specifications modulo axioms
- Structural induction in institutions
- Contracts as games on event structures
- A timed semantics of Orc
- Rewriting-based repairing strategies for XML repositories
- Proving operational termination of membership equational programs
- Modeling and analysis of real-time systems with mutex components
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis
- Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations
- Timed CTL model checking in Real-Time Maude
- An algebraic semantics for MOF
- Maude's module algebra
- Just-in-time: on strategy annotations
- A rewriting logic approach to operational semantics
- scientific article; zbMATH DE number 1950558 (Why is no real title available?)
- A Transformational Approach to Prove Outermost Termination Automatically
- Computer modeling in neuroscience: from imperative to declarative programming. Maude modeling in neuroscience.
- Alice and Bob meet equational theories
- Algebraic reinforcement learning. Hypothesis induction for relational reinforcement learning using term generalization.
- A Maude specification of an object-oriented model for telecommunication networks
This page was built for software: Maude
