Rewriting logic is both a flexible semantic framework within which widely different concurrent
systems can be naturally specified and a logical framework in which widely different logics …

Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson–Oppen or Shostak, current tools typically can only support a finite number of …

A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing
the standard notion in [19] is motivated and defined. Also, new requirements for symbolic …

To deal with large amounts of data while offering high availability, throughput, and low
latency, cloud computing systems rely on distributed, partitioned, and replicated data stores …

This paper presents the HybridSynchAADL modeling language and formal analysis tool for
virtually synchronous cyber-physical systems with complex control programs, continuous …

Equational unification and matching are fundamental mechanisms in many automated
deduction applications. Supporting them efficiently for as wide as possible a class of …

We introduce a sound and complete coinductive proof system for reachability properties in
transition systems generated by logically constrained term rewriting rules over an order …

So far, results about variants, the finite variant property (FVP), variant unification, and variant
satisfiability have been developed for equational theories E∪ B where B is a set of axioms …

Distributed read atomic transactions are important building blocks of modern cloud
databases that magnificently bridge the gap between data availability and strong data …

Maude is a specification language based on rewriting logic whose programs can be
executed, model checked, and analyzed with other techniques, but not easily theorem …