Twenty years of rewriting logic
type: Item
instance of: scholarly article
title: Twenty years of rewriting logic
zbMATH Open document ID: 1267.03043
author: José Meseguer
published in: The Journal of Logic and Algebraic Programming
publication date: 2013-01-16T00:00:00Z
review text: This very dense paper touches upon many, if not all, aspects of rewriting logic: 476 references are cited in the 49 pages of the paper. The first sections of the paper could be read as a dense introduction to rewriting logic, but, first and foremost, the paper is a survey paper in style and scope. Thus, the most likely reader is a researcher in rewriting logic who wishes to broaden his view of the field or find related work.
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6126072
zbMATH Keywords: rewriting logic
zbMATH Keywords: concurrency
zbMATH Keywords: logical frameworks
zbMATH Keywords: temporal logics
zbMATH Keywords: formal specification and verification
zbMATH Keywords: programming language semantics
zbMATH Keywords: networks and distributed systems
zbMATH Keywords: real-time systems
zbMATH Keywords: probabilistic systems
zbMATH Keywords: security
zbMATH Keywords: bioinformatics
zbMATH Keywords: survey paper
describes a project that uses: Maude
describes a project that uses: ReSpecT
describes a project that uses: CafeOBJ
describes a project that uses: Ptolemy
describes a project that uses: PMaude
describes a project that uses: PVeStA
describes a project that uses: VESTA
describes a project that uses: K tool
describes a project that uses: K-Maude
describes a project that uses: MFE
describes a project that uses: DDebugger
describes a project that uses: NRL
describes a project that uses: Maude-NPA
describes a project that uses: Elf
describes a project that uses: K Prover
describes a project that uses: Stratego
describes a project that uses: JavaFAN
describes a project that uses: PAGODA
describes a project that uses: MTT
describes a project that uses: Tom
describes a project that uses: ITP
describes a project that uses: SCC
describes a project that uses: MU-TERM
describes a project that uses: CARIBOO
describes a project that uses: Dist-Orc
describes a project that uses: SymPLFIED
describes a project that uses: Java+ITP
describes a project that uses: KOOL
describes a project that uses: MMT
describes a project that uses: AProVE
describes a project that uses: ITP/OCL
describes a project that uses: OBJ3
describes a project that uses: Nuprl
describes a project that uses: 2OBJ
describes a project that uses: MOMENT2
describes a project that uses: vlogsl
MaRDI profile type: Publication
full work available at URL: j.jlap.2012.06.003
OpenAlex ID: W2006766139
cites work: Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
cites work: Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics
cites work: Context-sensitive dependency pairs
cites work: Abstract Certification of Global Non-interference in Rewriting Logic
cites work: FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
cites work: A Modular Equational Generalization Algorithm
cites work: Order-Sorted Generalization
cites work: Executable rewriting logic semantics of Orc and formal analysis of Orc programs
cites work: A theory of timed automata
cites work: Data-driven modeling of Alzheimer disease pathogenesis
cites work: A rewriting logic framework for operational semantics of membrane systems
cites work: Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application
cites work: A Port Graph Calculus for Autonomic Computing and Invariant Verification
cites work: Strategy-Based Proof Calculus for Membrane Systems
cites work: Q3045455
cites work: Using typed lambda calculus to implement formal systems on a machine
cites work: Term rewriting and applications. 18th international conference, RTA 2007, Paris, France, June 26--28, 2007. Proceedings
cites work: Computer security -- ESORICS 2009. 14th European symposium on research in computer security, Saint-Malo, France, September 21--23, 2009. Proceedings

Twenty years of rewriting logic (cites work)
cites work: A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting

Twenty years of rewriting logic (cites work)
cites work: The Linear Temporal Logic of Rewriting Maude Model Checker

Twenty years of rewriting logic (cites work)
cites work: Verifying hierarchical Ptolemy II discrete-event models using real-time maude

Twenty years of rewriting logic (cites work)
cites work: Q4270055

Twenty years of rewriting logic (cites work)
cites work: Q4138149

Twenty years of rewriting logic (cites work)
cites work: A rewriting calculus for cyclic higher-order term graphs

Twenty years of rewriting logic (cites work)
cites work: The gamma model and its discipline of programming

Twenty years of rewriting logic (cites work)
cites work: Formal methods for open object-based distributed systems. 10th IFIP WG 6.1 international conference, FMOODS 2008, Oslo, Norway, June 4--6, 2008. Proceedings

Twenty years of rewriting logic (cites work)
cites work: Reflective metalogical frameworks

Twenty years of rewriting logic (cites work)
cites work: Q4261732

Twenty years of rewriting logic (cites work)
cites work: Q3896478

Twenty years of rewriting logic (cites work)
cites work: The chemical abstract machine

Twenty years of rewriting logic (cites work)
cites work: Sequential and concurrent behaviour in Petri net theory

Twenty years of rewriting logic (cites work)
cites work: Formal methods for open object-based distributed systems. 9th IFIP WG 6.1 international conference FMOODS 2007, Paphos, Cyprus, June 6--8, 2007. Proceedings.

Twenty years of rewriting logic (cites work)
cites work: What Is a Multi-modeling Language?

Twenty years of rewriting logic (cites work)
cites work: An algebraic semantics for MOF

Twenty years of rewriting logic (cites work)
cites work: ELAN from a rewriting logic point of view

Twenty years of rewriting logic (cites work)
cites work: REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS

Twenty years of rewriting logic (cites work)
cites work: Specification and proof in membership equational logic

Twenty years of rewriting logic (cites work)
cites work: Q4447221

Twenty years of rewriting logic (cites work)
cites work: Q4447223

Twenty years of rewriting logic (cites work)
cites work: From chemical rules to term rewriting

Twenty years of rewriting logic (cites work)
cites work: Q4808751

Twenty years of rewriting logic (cites work)
cites work: Modular rewriting semantics in practice

Twenty years of rewriting logic (cites work)
cites work: Q4449180

Twenty years of rewriting logic (cites work)
cites work: Semantic foundations for generalized rewrite theories

Twenty years of rewriting logic (cites work)
cites work: Symmetric monoidal and cartesian double categories as a semantic framework for tile logic

Twenty years of rewriting logic (cites work)
cites work: Tiling transactions in rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Q4222985

Twenty years of rewriting logic (cites work)
cites work: Q4222997

Twenty years of rewriting logic (cites work)
cites work: Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types

Twenty years of rewriting logic (cites work)
cites work: Q1008937

Twenty years of rewriting logic (cites work)
cites work: Q4447234

Twenty years of rewriting logic (cites work)
cites work: Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN

Twenty years of rewriting logic (cites work)
cites work: Q2769430

Twenty years of rewriting logic (cites work)
cites work: Rewriting calculus with(out) types

Twenty years of rewriting logic (cites work)
cites work: Rewrite strategies in the rewriting calculus

Twenty years of rewriting logic (cites work)
cites work: Reflection in rewriting logic. Metalogical foundations and metaprogramming applications

Twenty years of rewriting logic (cites work)
cites work: Maude: specification and programming in rewriting logic

Twenty years of rewriting logic (cites work)
cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.

Twenty years of rewriting logic (cites work)
cites work: Q4222853

Twenty years of rewriting logic (cites work)
cites work: Algebraic Methodology and Software Technology

Twenty years of rewriting logic (cites work)
cites work: Q4222856

Twenty years of rewriting logic (cites work)
cites work: Reflection in conditional rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Term Rewriting and Applications

Twenty years of rewriting logic (cites work)
cites work: The calculus of constructions

Twenty years of rewriting logic (cites work)
cites work: Generalized Theoroidal Institution Comorphisms

Twenty years of rewriting logic (cites work)
cites work: A causal semantics for CCS via rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Axiomatizing the algebra of net computations and processes

Twenty years of rewriting logic (cites work)
cites work: Proved trees

Twenty years of rewriting logic (cites work)
cites work: Rewriting semantics of meta-objects and composable distributed services

Twenty years of rewriting logic (cites work)
cites work: Automated Deduction – CADE-19

Twenty years of rewriting logic (cites work)
cites work: CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification

Twenty years of rewriting logic (cites work)
cites work: Higher order unification via explicit substitutions

Twenty years of rewriting logic (cites work)
cites work: HOL-\(\lambda\sigma\): An intentional first-order expression of higher-order logic

Twenty years of rewriting logic (cites work)
cites work: Theorem proving modulo

Twenty years of rewriting logic (cites work)
cites work: Q5150132

Twenty years of rewriting logic (cites work)
cites work: Q2767191

Twenty years of rewriting logic (cites work)
cites work: Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6

Twenty years of rewriting logic (cites work)
cites work: Proving operational termination of membership equational programs

Twenty years of rewriting logic (cites work)
cites work: MTT: The Maude Termination Tool (System Description)

Twenty years of rewriting logic (cites work)
cites work: Methods for proving termination of rewriting-based programming languages by transformation

Twenty years of rewriting logic (cites work)
cites work: Termination Modulo Combinations of Equational Theories

Twenty years of rewriting logic (cites work)
cites work: Maude's module algebra

Twenty years of rewriting logic (cites work)
cites work: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories

Twenty years of rewriting logic (cites work)
cites work: Q2989001

Twenty years of rewriting logic (cites work)
cites work: Formal modeling: actors, open systems, biological systems. Essays dedicated to Carolyn Talcott on the occasion of her 70th birthday

Twenty years of rewriting logic (cites work)
cites work: Q4447218

Twenty years of rewriting logic (cites work)
cites work: Deduction, strategies, and rewriting

Twenty years of rewriting logic (cites work)
cites work: A Rewriting Logic Approach to Type Inference

Twenty years of rewriting logic (cites work)
cites work: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties

Twenty years of rewriting logic (cites work)
cites work: State space reduction in the Maude-NRL protocol analyzer

Twenty years of rewriting logic (cites work)
cites work: Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties

Twenty years of rewriting logic (cites work)
cites work: Symbolic Model Checking of Infinite-State Systems Using Narrowing

Twenty years of rewriting logic (cites work)
cites work: Effectively Checking the Finite Variant Property

Twenty years of rewriting logic (cites work)
cites work: Narrowing and rewriting logic: from foundations to applications

Twenty years of rewriting logic (cites work)
cites work: Folding Variant Narrowing and Optimal Variant Termination

Twenty years of rewriting logic (cites work)
cites work: Computer Aided Verification

Twenty years of rewriting logic (cites work)
cites work: State Space Reduction of Rewrite Theories Using Invisible Transitions

Twenty years of rewriting logic (cites work)
cites work: Partial order reduction for rewriting semantics of programming languages

Twenty years of rewriting logic (cites work)
cites work: Algebraic Methodology and Software Technology

Twenty years of rewriting logic (cites work)
cites work: Q4698612

Twenty years of rewriting logic (cites work)
cites work: Q3491030

Twenty years of rewriting logic (cites work)
cites work: Modal logic for rewriting theories

Twenty years of rewriting logic (cites work)
cites work: Q4409149

Twenty years of rewriting logic (cites work)
cites work: A Sound and Complete Deductive System for CTL* Verification

Twenty years of rewriting logic (cites work)
cites work: Processes and games

Twenty years of rewriting logic (cites work)
cites work: Term Rewriting and Applications

Twenty years of rewriting logic (cites work)
cites work: Termination of rewriting under strategies

Twenty years of rewriting logic (cites work)
cites work: Institutions: abstract model theory for specification and programming

Twenty years of rewriting logic (cites work)
cites work: Proving Termination in the Context-Sensitive Dependency Pair Framework

Twenty years of rewriting logic (cites work)
cites work: A logic for reasoning about time and reliability

Twenty years of rewriting logic (cites work)
cites work: Q4471717

Twenty years of rewriting logic (cites work)
cites work: A framework for defining logics

Twenty years of rewriting logic (cites work)
cites work: Term Rewriting and Applications

Twenty years of rewriting logic (cites work)
cites work: Coverset Induction with Partiality and Subsorts: A Powerlist Case Study

Twenty years of rewriting logic (cites work)
cites work: On the Completeness of Context-Sensitive Order-Sorted Specifications

Twenty years of rewriting logic (cites work)
cites work: Order-sorted Equational Unification Revisited

Twenty years of rewriting logic (cites work)
cites work: Propositional Tree Automata

Twenty years of rewriting logic (cites work)
cites work: Which Soft Constraints do you Prefer?

Twenty years of rewriting logic (cites work)
cites work: Rewriting techniques and applications. 6th international conference, RTA-95, Kaiserslautern, Germany, April 5--7, 1995. Proceedings

Twenty years of rewriting logic (cites work)
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Twenty years of rewriting logic (cites work)
cites work: A run-time environment for concurrent objects with asynchronous method calls

Twenty years of rewriting logic (cites work)
cites work: Type Fusion

Twenty years of rewriting logic (cites work)
cites work: Algebraic methodology and software technology. 11th international conference, AMAST 2006, Kuressaare, Estonia, July 5--8, 2006. Proceedings.

Twenty years of rewriting logic (cites work)
cites work: Completion of a Set of Rules Modulo a Set of Equations

Twenty years of rewriting logic (cites work)
cites work: Q3664457

Twenty years of rewriting logic (cites work)
cites work: Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits

Twenty years of rewriting logic (cites work)
cites work: Rewriting semantics of production rule sets

Twenty years of rewriting logic (cites work)
cites work: A rewriting semantics for ABEL with applications to hardware/software co-design and analysis

Twenty years of rewriting logic (cites work)
cites work: vlogsl: A Strategy Language for Simulation-Based Verification of Hardware

Twenty years of rewriting logic (cites work)
cites work: Formal modeling and analysis of timed systems. 5th international conference, FORMATS 2007, Salzburg, Austria, October 3--5, 2007. Proceedings

Twenty years of rewriting logic (cites work)
cites work: Q4222980

Twenty years of rewriting logic (cites work)
cites work: Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories

Twenty years of rewriting logic (cites work)
cites work: Combining symbolic constraint solvers on algebraic domains

Twenty years of rewriting logic (cites work)
cites work: Q4357065

Twenty years of rewriting logic (cites work)
cites work: Timed rewriting logic with an application to object-based specification

Twenty years of rewriting logic (cites work)
cites work: Formal Methods for Open Object-Based Distributed Systems

Twenty years of rewriting logic (cites work)
cites work: Axiomatizing permutation equivalence

Twenty years of rewriting logic (cites work)
cites work: FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

Twenty years of rewriting logic (cites work)
cites work: Timed CTL Model Checking in Real-Time Maude

Twenty years of rewriting logic (cites work)
cites work: The polymorphic rewriting-calculus [type checking vs. type inference]

Twenty years of rewriting logic (cites work)
cites work: Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions

Twenty years of rewriting logic (cites work)
cites work: Q4259966

Twenty years of rewriting logic (cites work)
cites work: Context-sensitive rewriting strategies

Twenty years of rewriting logic (cites work)
cites work: Operational termination of conditional term rewriting systems

Twenty years of rewriting logic (cites work)
cites work: Termination of just/fair computations in term rewriting

Twenty years of rewriting logic (cites work)
cites work: Operational Termination of Membership Equational Programs: the Order-Sorted Way

Twenty years of rewriting logic (cites work)
cites work: Correct Hardware Design and Verification Methods

Twenty years of rewriting logic (cites work)
cites work: Modular and incremental proofs of AC-termination

Twenty years of rewriting logic (cites work)
cites work: Q4698614

Twenty years of rewriting logic (cites work)
cites work: Q4246796

Twenty years of rewriting logic (cites work)
cites work: Handbook of philosophical logic. Vol. 9

Twenty years of rewriting logic (cites work)
cites work: Rewriting logic: Roadmap and bibliography

Twenty years of rewriting logic (cites work)
cites work: Recent Trends in Algebraic Development Techniques

Twenty years of rewriting logic (cites work)
cites work: A Rewriting Semantics for Maude Strategies

Twenty years of rewriting logic (cites work)
cites work: The NRL Protocol Analyzer: An Overview

Twenty years of rewriting logic (cites work)
cites work: Q3032225

Twenty years of rewriting logic (cites work)
cites work: Conditional rewriting logic as a unified model of concurrency

Twenty years of rewriting logic (cites work)
cites work: Conditional rewriting logic: Deduction, models and concurrency

Twenty years of rewriting logic (cites work)
cites work: Rewriting logic as a semantic framework for concurrency: a progress report

Twenty years of rewriting logic (cites work)
cites work: Q3839051

Twenty years of rewriting logic (cites work)
cites work: Q4762648

Twenty years of rewriting logic (cites work)
cites work: Q2723887

Twenty years of rewriting logic (cites work)
cites work: Formal methods in software and systems modeling. Essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday

Twenty years of rewriting logic (cites work)
cites work: Theoretical Aspects of Computing – ICTAC 2005

Twenty years of rewriting logic (cites work)
cites work: The Temporal Logic of Rewriting: A Gentle Introduction

Twenty years of rewriting logic (cites work)
cites work: Q3839052

Twenty years of rewriting logic (cites work)
cites work: Equational abstractions

Twenty years of rewriting logic (cites work)
cites work: Algebraic simulations

Twenty years of rewriting logic (cites work)
cites work: Automated Reasoning

Twenty years of rewriting logic (cites work)
cites work: The rewriting logic semantics project

Twenty years of rewriting logic (cites work)
cites work: The Rewriting Logic Semantics Project: A Progress Report

Twenty years of rewriting logic (cites work)
cites work: Hybrid Systems: Computation and Control

Twenty years of rewriting logic (cites work)
cites work: Q4270072

Twenty years of rewriting logic (cites work)
cites work: Q3046721

Twenty years of rewriting logic (cites work)
cites work: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

Twenty years of rewriting logic (cites work)
cites work: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

Twenty years of rewriting logic (cites work)
cites work: Formal Methods for Open Object-Based Distributed Systems

Twenty years of rewriting logic (cites work)
cites work: Q4790669

Twenty years of rewriting logic (cites work)
cites work: External rewriting for skeptical proof assistants

Twenty years of rewriting logic (cites work)
cites work: Rewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. Proceedings

Twenty years of rewriting logic (cites work)
cites work: Solving SAT and SAT Modulo Theories

Twenty years of rewriting logic (cites work)
cites work: Formal Methods for Open Object-Based Distributed Systems

Twenty years of rewriting logic (cites work)
cites work: Q2783416

Twenty years of rewriting logic (cites work)
cites work: Rewriting logic and its applications. 8th international workshop, WRLA 2010, held as a satellite event of ETAPS 2010, Paphos, Cyprus, March 20--21, 2010. Revised selected papers

Twenty years of rewriting logic (cites work)
cites work: Q2764137

Twenty years of rewriting logic (cites work)
cites work: Formal methods for industrial applications. Specification and programming the Steam Boiler Control

Twenty years of rewriting logic (cites work)
cites work: Q4222863

Twenty years of rewriting logic (cites work)
cites work: Specification of real-time and hybrid systems in rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Abstraction and completeness for real-time Maude

Twenty years of rewriting logic (cites work)
cites work: Semantics and pragmatics of real-time maude

Twenty years of rewriting logic (cites work)
cites work: Specification and analysis of the AER/NCA active network protocol suite in real-time Maude

Twenty years of rewriting logic (cites work)
cites work: Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude

Twenty years of rewriting logic (cites work)
cites work: Algebra and Coalgebra in Computer Science

Twenty years of rewriting logic (cites work)
cites work: Recent trends in algebraic development techniques. 12th international workshop, WADT '97, Tarquinia, Italy, June 3--7, 1997. Selected papers

Twenty years of rewriting logic (cites work)
cites work: SymPLFIED: Symbolic Program-Level Fault Injection and Error Detection Framework

Twenty years of rewriting logic (cites work)
cites work: Isabelle. A generic theorem prover

Twenty years of rewriting logic (cites work)
cites work: Membrane computing. An introduction.

Twenty years of rewriting logic (cites work)
cites work: Complete Sets of Reductions for Some Equational Theories

Twenty years of rewriting logic (cites work)
cites work: Q3204068

Twenty years of rewriting logic (cites work)
cites work: Q3696524

Twenty years of rewriting logic (cites work)
cites work: Q3783524

Twenty years of rewriting logic (cites work)
cites work: Q4315289

Twenty years of rewriting logic (cites work)
cites work: Algebraic Methodology and Software Technology

Twenty years of rewriting logic (cites work)
cites work: Declarative Debugging of Rewriting Logic Specifications

Twenty years of rewriting logic (cites work)
cites work: On the Behavioral Semantics of Real-Time Domain Specific Visual Languages

Twenty years of rewriting logic (cites work)
cites work: Theorem Proving Modulo Based on Boolean Equational Procedures

Twenty years of rewriting logic (cites work)
cites work: Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories

Twenty years of rewriting logic (cites work)
cites work: Proving Safety Properties of Rewrite Theories

Twenty years of rewriting logic (cites work)
cites work: A secret-sharing protocol modelled in Maude

Twenty years of rewriting logic (cites work)
cites work: Matching Logic: An Alternative to Hoare/Floyd Logic

Twenty years of rewriting logic (cites work)
cites work: An overview of the K semantic framework

Twenty years of rewriting logic (cites work)
cites work: Tests and proofs. 4th international conference, TAP 2010, Málaga, Spain, July 1--2, 2010. Proceedings

Twenty years of rewriting logic (cites work)
cites work: Characterizing and proving operational termination of deterministic conditional term rewriting systems

Twenty years of rewriting logic (cites work)
cites work: An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf

Twenty years of rewriting logic (cites work)
cites work: Computer Aided Verification

Twenty years of rewriting logic (cites work)
cites work: A rewriting logic approach to operational semantics

Twenty years of rewriting logic (cites work)
cites work: Monadic Elementary Formal Systems

Twenty years of rewriting logic (cites work)
cites work: Q4222999

Twenty years of rewriting logic (cites work)
cites work: Q5472887

Twenty years of rewriting logic (cites work)
cites work: Q5472892

Twenty years of rewriting logic (cites work)
cites work: Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework

Twenty years of rewriting logic (cites work)
cites work: Q4421726

Twenty years of rewriting logic (cites work)
cites work: Q4324960

Twenty years of rewriting logic (cites work)
cites work: A Formal Pattern Architecture for Safe Medical Systems

Twenty years of rewriting logic (cites work)
cites work: Actor theories in rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Q925313

Twenty years of rewriting logic (cites work)
cites work: Transactions on Computational Systems Biology VI

Twenty years of rewriting logic (cites work)
cites work: Complete symbolic reachability analysis using back-and-forth narrowing

Twenty years of rewriting logic (cites work)
cites work: An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0

Twenty years of rewriting logic (cites work)
cites work: Q4708927

Twenty years of rewriting logic (cites work)
cites work: Analyzing Pathways Using SAT-Based Approaches

Twenty years of rewriting logic (cites work)
cites work: Modular and incremental automated termination proofs

Twenty years of rewriting logic (cites work)
cites work: Language prototyping: An algebraic specification approach

Twenty years of rewriting logic (cites work)
cites work: Q4422086

Twenty years of rewriting logic (cites work)
cites work: Two case studies of semantics execution in Maude: CCS and LOTOS

Twenty years of rewriting logic (cites work)
cites work: Executable structural operational semantics in Maude

Twenty years of rewriting logic (cites work)
cites work: Specification and verification of the tree identify protocol of IEEE 1394 in rewriting logic

Twenty years of rewriting logic (cites work)
cites work: Q4223003

Twenty years of rewriting logic (cites work)
cites work: Equational rules for rewriting logic

Twenty years of rewriting logic (cites work)
cites work: A timed semantics of Orc

Twenty years of rewriting logic (cites work)
cites work: FM '99. Formal methods. World congress on Formal methods in the development of computing systems. Toulouse, France, September 20--24, 1999. Proceedings. In 2 vols

Twenty years of rewriting logic (cites work)
cites work: A rewriting logic framework for soft constraints

Twenty years of rewriting logic (cites work)
cites work: A formal approach to object-oriented software engineering

Twenty years of rewriting logic (cites work)
cites work: Statistical probabilistic model checking with a focus on time-bounded properties

Twenty years of rewriting logic (DOI)
DOI: 10.1016/J.JLAP.2012.06.003

Twenty years of rewriting logic (Recommended article)
Recommended article: Twenty Years of Rewriting Logic
Similarity Score: 1.0
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: The dynamic turn in twentieth century logic
Similarity Score: 0.871522
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: New foundations for rewriting logic
Similarity Score: 0.86936027
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: Q4820591
Similarity Score: 0.8650143
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: Revising Logics
Similarity Score: 0.86179066
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: Q4263840
Similarity Score: 0.86143696
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: Q4222859
Similarity Score: 0.8609936
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: On refinement in rewriting logic
Similarity Score: 0.8586022
Recommender Run: Recommender Run 2

Twenty years of rewriting logic (Recommended article)
Recommended article: Q4463928
Similarity Score: 0.8557476
Recommender Run: Recommender Run 2