Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Confluence of conditional rewrite systems
1st international workshop on Conditional Term Rewriting Systems
Proofs and types
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
AC-unification race: the system solving approach, implementation and benchmarks
Journal of Symbolic Computation
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Term rewriting and all that
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
Communication and Concurrency
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
ICALP '95 Proceedings of the 22nd International 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
Hierarchical Contextual Rewriting with Several Levels
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Theorem Proving modulo Associativity
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
On Termination and Confluence of Conditional Rewrite Systems
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Rewriting modulo a rewrite system
Rewriting modulo a rewrite system
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Simplification and termination of strategies in rule-based languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Journal of Automated Reasoning
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
Formal Methods in System Design
The rewriting logic semantics project
Theoretical Computer Science
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Rewriting Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Stuttering Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Theoretical Computer Science
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Theoretical Computer Science
A rewriting logic approach to operational semantics
Information and Computation
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
The Rewriting Logic Semantics Project
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Theorem proving modulo based on Boolean equational procedures
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
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 linear temporal logic of rewriting Maude model checker
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
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
A formal library of set relations and its application to synchronous languages
Theoretical Computer Science
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Proving safety properties of rewrite theories
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A sufficient completeness checker for linear order-sorted specifications modulo axioms
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Localized fairness: a rewriting semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Simulation and verification of synchronous set relations in rewriting logic
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Formalization and correctness of the PALS architectural pattern for distributed real-time systems
Theoretical Computer Science
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude
Science of Computer Programming
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
The rewriting logic semantics project: A progress report
Information and Computation
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
| Hi-index | 0.01 |
In addition to equations and rules, we introduce equational rules that are oriented while having an equational interpretation. Correspondence between operational behavior and intended semantics is guaranteed by a property of coherence, which can be checked by examination of critical pairs and linearity conditions. We present applications of this theory to three examples where the rewrite relation is interpreted, respectively, as equality, transition and deduction.