328 search results - page 2 / 66 » Proving Termination of Communicating Programs |
LISP
2008
13 years 5 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...
PEPM
2004
ACM
13 years 11 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...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
BIRTHDAY
2007
Springer
13 years 12 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
LOPSTR
2009
Springer
14 years 9 days ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...