ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...