• Maude

  • Referenced in 656 articles [sw06233]
  • system supporting both equational and rewriting logic specification and programming for a wide range ... specification and programming, Maude also supports rewriting logic computation...
  • TOY

  • Referenced in 61 articles [sw09812]
  • whose basis is a constructor based rewriting logic with lazy non-deterministic functions...
  • ELAN

  • Referenced in 113 articles [sw02179]
  • support the design of theorem provers, logic programming languages, constraints solvers and decision procedures ... function evaluation principle based on rewriting. But rewriting is inherently non-deterministic since several rules ... well-known paradigm of rewriting provides both the logical framework in which deduction systems...
  • JavaFAN

  • Referenced in 29 articles [sw01934]
  • semantics of Java and JVM in rewriting logic and then using the capabilities of Maude ... execution, search and LTL model checking of rewriting theories...
  • OTTER

  • Referenced in 204 articles [sw02904]
  • prove theorems stated in first-order logic with equality. Otter’s inference rules are based ... paramodulation, and it includes facilities for term rewriting, term orderings, Knuth-Bendix completion, weighting ... research in abstract algebra and formal logic. Otter and its predecessors have been used...
  • DDebugger

  • Referenced in 12 articles [sw09904]
  • Declarative debugging of rewriting logic specifications. Declarative debugging is a semi-automatic technique that starts ... characterizing the elements of a sort. Rewriting logic is a logic of change that extends ... sorts with the equational subset of rewriting logic, and rewrites and sets of reachable terms ... high-performance system based on rewriting logic. We illustrate its use with an example...
  • PAGODA

  • Referenced in 12 articles [sw08569]
  • rewriting logic framework for soft constraints. Soft constraints extend classical constraints to deal with ... Bistarelli, Montanari and Rossi in rewriting logic. As a case study we present an application ... implement the solution in our prototypical rewriting logic framework for soft constraints, and embed...
  • MMT

  • Referenced in 15 articles [sw07905]
  • semantics-preserving mapping between MSOS and rewriting logic (RWL). The modular SOS definition formalism (MSDF...
  • APS

  • Referenced in 30 articles [sw08969]
  • computations: procedural, functional, algebraic (rewriting rules) and logical. All of them may be used ... discussed. These include data structures, algebraic modules, rewriting and computing, canonical forms, tools for building...
  • JPAX

  • Referenced in 8 articles [sw09906]
  • user in the Maude rewriting logic, where Maude is a high-speed rewriting system ... here extended with executable temporal logic. The Maude rewriting engine is then activated...
  • MOMENT2

  • Referenced in 10 articles [sw10025]
  • Modeling Framework using graph transformation and rewriting logic techniques. We illustrate our approach...
  • CBabel

  • Referenced in 5 articles [sw07520]
  • level contracts in CBabel ADL. A rewriting logic semantics for the software architecture description language ... that implements the given CBabel’s rewriting logic semantics and allows the execution and verification ... Maude system, an implementation of rewriting logic. In this way, software architectures describing complex applications...
  • Web-TLR

  • Referenced in 7 articles [sw09905]
  • applications which is based on rewriting logic. Web applications are expressed as rewrite theories which...
  • Dist-Orc

  • Referenced in 5 articles [sw10063]
  • been proposed for Orc, including a rewriting logic semantics developed by the authors. Orc also ... describe an implementation technique based on rewriting logic and Maude that narrows this gap considerably...
  • VAMPIRE

  • Referenced in 151 articles [sw02918]
  • automatic theorem prover for first-order classical logic. It consists of a shell ... tautology deletion (optionally modulo commutativity), subsumption resolution, rewriting by ordered unit equalities, and a lightweight ... problem in the full first-order logic syntax, clausifies it and performs a number...
  • LMNtal

  • Referenced in 8 articles [sw07312]
  • LMNtal as a hierarchical logic programming language. LMNtal (pronounced “elemental”) is a simple language ... model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes ... Rules, the two notable extensions to concurrent logic programming. LMNtal is intended ... especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal...
  • Anima

  • Referenced in 3 articles [sw10101]
  • Inspecting rewriting logic computations (in a parametric and stepwise way). Trace inspection is concerned with ... technique for the trace inspection of Rewriting Logic theories that allows the non-deterministic execution...
  • iJulienne

  • Referenced in 3 articles [sw09903]
  • Slicing-based trace analysis of rewriting logic specifications with iJulienne. We present iJulienne, a trace ... analyzer for conditional rewriting logic theories that can be used to compute abstract views...
  • HI-maude

  • Referenced in 3 articles [sw09753]
  • continuous behaviors. HI-Maude is a rewriting-logic-based tool that supports an object-oriented...
  • CiME

  • Referenced in 24 articles [sw09970]
  • CiME is a rewriting toolbox. Distributed since 1996 as open source, at URL http://cime.lri.fr ... logic programs; the MU-TERM tool (http://www.dsic.upv.es/ slucas/csr/termination/muterm/ ) for termination of context-sensitive rewriting...