Two Decades of Maude
DOI10.1007/978-3-319-23165-5_11zbMATH Open1321.68007OpenAlexW2294286260WikidataQ123905823 ScholiaQ123905823MaRDI QIDQ2945709FDOQ2945709
Authors: Francisco Durán, Steven Eker, Santiago Escobar, Narciso Martí-Oliet, M. Clavel, P. Lincoln, Carolyn Talcott 
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
Recommendations
History of computer science (68-03) Grammars and rewriting systems (68Q42) Logic in computer science (03B70) Development of contemporary mathematics (01A65)
Cites Work
- Maude: specification and programming in rewriting logic
- Towards Maude 2. 0
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Title not available (Why is that?)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- A needed narrowing strategy
- Conditional rewriting logic as a unified model of concurrency
- IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
- Twenty years of rewriting logic
- Rewriting modulo SMT and open system analysis
- Abstract logical model checking of infinite-state systems using narrowing
- MTT: The Maude Termination Tool (System Description)
- Title not available (Why is that?)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Title not available (Why is that?)
- Rewriting logic as a semantic framework for concurrency: a progress report
- Semantics and pragmatics of real-time maude
- An algebraic semantics for MOF
- Specification and proof in membership equational logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Title not available (Why is that?)
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Context-sensitive rewriting strategies
- Title not available (Why is that?)
- Term Rewriting and Applications
- Title not available (Why is that?)
- Equality, types, modules, and (why not?) generics for logic programming
- The Temporal Logic of Rewriting: A Gentle Introduction
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Folding variant narrowing and optimal variant termination
- Rewriting logic bibliography by topic: 1990--2011
- May I borrow your logic? (Transporting logical structures along maps)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maude's module algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3--6, 1996
- The 3rd international workshop on rewriting logic and its applications, RWLW. Kanazawa City Cultural Hall, Kanzawa, Japan, September 18--20, 2000
- Title not available (Why is that?)
- Variants, unification, narrowing, and symbolic reachability in Maude 2.6
- A rewriting framework for activities subject to regulations
- Functional logic programming in Maude
- From OBJ to Maude and Beyond
Cited In (3)
Uses Software
This page was built for publication: Two Decades of Maude
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945709)
