76 search results - page 12 / 16 » Termination of just fair computations in term rewriting |
107
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
103
Voted
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
112
Voted
ICNP
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper presents the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed accord...
RTA
2005
Springer
15 years 5 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
104
click to vote
JLP
2010
14 years 6 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...