Abstract Reasoning about the termination of equational programs in sophisticated
equational languages such as Elan, Maude, OBJ, CafeOBJ, Haskell, and so on, requires …

This paper provides a framework to address termination problems in term rewriting by using
orderings induced by algebras over the reals. The generation of such orderings is …

Polynomial constraint solving plays a prominent role in several areas of hardware and
software analysis and verification, eg, termination proving, program invariant generation and …

This paper describes the main features of several tools concerned with the analysis of either
Maude specifications, or of extensions of such specifications: the ITP, MTT, CRC, ChC, and …

Despite the remarkable development of the theory of termination of rewriting, its application
to high-level programming languages is far from being optimal. This is due to the need for …

Partial-inversion compilers generate programs which compute some unknown inputs of
given programs from a given output and the rest of inputs whose values are already given. In …

Advanced typing, matching, and evaluation strategy features, as well as very general
conditional rules, are routinely used in equational programming languages such as, for …

Abstract mu-term is a tool which can be used to verify a number of termination properties of
(variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of …

Maude is a declarative and reflective language based on rewriting logic in which
computation corresponds to efficient deduction by rewriting. Because of its reflective …

Polynomial constraint-solving plays a prominent role in several areas of engineering and
software verification. In particular, polynomial constraint solving has a long and successful …