142 search results - page 4 / 29 » Proving Termination by Invariance Relations |
EJC
2007
13 years 7 months ago
2007
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
LPAR
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
IANDC
2008
13 years 7 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...
SAS
2001
Springer
13 years 12 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...