Two Decades of Maude
From MaRDI portal
Publication:2945709
DOI10.1007/978-3-319-23165-5_11zbMath1321.68007OpenAlexW2294286260WikidataQ123905823 ScholiaQ123905823MaRDI QIDQ2945709
Francisco Durán, Santiago Escobar, Steven Eker, Narciso Martí-Oliet, Patrick D. Lincoln, Carolyn L. Talcott, Manuel Clavel
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23165-5_11
Development of contemporary mathematics (01A65) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) History of computer science (68-03)
Related Items
Uses Software
Cites Work
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Semantics and pragmatics of real-time maude
- Maude's module algebra
- An algebraic semantics for MOF
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3--6, 1996
- IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
- May I borrow your logic? (Transporting logical structures along maps)
- Maude: specification and programming in rewriting logic
- Context-sensitive rewriting strategies
- Twenty years of rewriting logic
- Rewriting logic bibliography by topic: 1990--2011
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Folding variant narrowing and optimal variant termination
- Specification and proof in membership equational logic
- Rewriting Modulo SMT and Open System Analysis
- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- A needed narrowing strategy
- The Temporal Logic of Rewriting: A Gentle Introduction
- MTT: The Maude Termination Tool (System Description)
- Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
- Functional Logic Programming in Maude
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Term Rewriting and Applications
- From OBJ to Maude and Beyond
- Equality, types, modules, and (why not?) generics for logic programming
- The 3rd international workshop on rewriting logic and its applications, RWLW. Kanazawa City Cultural Hall, Kanzawa, Japan, September 18--20, 2000
- Rewriting logic as a semantic framework for concurrency: a progress report
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
