437 search results - page 4 / 88 » Proving Termination by Divergence |
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
LISP
2008
13 years 7 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
ENTCS
2007
13 years 7 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
PEPM
2004
ACM
14 years 1 months ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...