86 search results - page 12 / 18 » Proving Termination of Integer Term Rewriting |
RTA
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
CONCUR
2003
Springer
14 years 18 days ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...