437 search results - page 48 / 88 » Proving Termination by Divergence |
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
lue Abstraction for Verifying Linearizability Viktor Vafeiadis Microsoft Research, Cambridge, UK This paper presents a novel abstraction for heap-allocated data structures that kee...
IRI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over const...
ERSHOV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...