93 search results - page 8 / 19 » Alternation for Termination |
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
RTA
2005
Springer
14 years 28 days 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...
TPHOL
2003
IEEE
14 years 22 days ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
EUROPAR
1998
Springer
13 years 11 months ago
1998
Springer
Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transacti...
CHI
1997
ACM
13 years 11 months ago
1997
ACM
Palplates are a collection of touch-screen terminals placed around the office enabling human-computer interactions at the point of need. Supporting a community of mobile authentic...