Two Decades of Maude
From MaRDI portal
Publication:2945709
Recommendations
Cites work
- scientific article; zbMATH DE number 1696471 (Why is no real title available?)
- scientific article; zbMATH DE number 1696903 (Why is no real title available?)
- scientific article; zbMATH DE number 1696904 (Why is no real title available?)
- scientific article; zbMATH DE number 2089377 (Why is no real title available?)
- scientific article; zbMATH DE number 3945331 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1231537 (Why is no real title available?)
- scientific article; zbMATH DE number 1231540 (Why is no real title available?)
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- scientific article; zbMATH DE number 1231654 (Why is no real title available?)
- scientific article; zbMATH DE number 1231664 (Why is no real title available?)
- scientific article; zbMATH DE number 1231667 (Why is no real title available?)
- scientific article; zbMATH DE number 1231672 (Why is no real title available?)
- scientific article; zbMATH DE number 1301603 (Why is no real title available?)
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- scientific article; zbMATH DE number 1394315 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A needed narrowing strategy
- A rewriting framework for activities subject to regulations
- Abstract logical model checking of infinite-state systems using narrowing
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- An algebraic semantics for MOF
- Conditional rewriting logic as a unified model of concurrency
- Context-sensitive rewriting strategies
- Equality, types, modules, and (why not?) generics for logic programming
- Folding variant narrowing and optimal variant termination
- From OBJ to Maude and Beyond
- Functional logic programming in Maude
- IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
- MTT: The Maude Termination Tool (System Description)
- Maude's module algebra
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Maude: specification and programming in rewriting logic
- May I borrow your logic? (Transporting logical structures along maps)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- 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
- Rewriting logic as a semantic framework for concurrency: a progress report
- Rewriting logic bibliography by topic: 1990--2011
- Rewriting modulo SMT and open system analysis
- Semantics and pragmatics of real-time maude
- Specification and proof in membership equational logic
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Term Rewriting and Applications
- The 3rd international workshop on rewriting logic and its applications, RWLW. Kanazawa City Cultural Hall, Kanzawa, Japan, September 18--20, 2000
- The Temporal Logic of Rewriting: A Gentle Introduction
- Towards Maude 2. 0
- Twenty years of rewriting logic
- Variants, unification, narrowing, and symbolic reachability in Maude 2.6
Cited in
(3)
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)
