Cost analysis statically approximates the cost of programs in terms of their input data size.
This paper presents, to the best of our knowledge, the first approach to the automatic cost …

Abstract Disjunctive Logic Programming (DLP) under the answer set semantics, often
referred to as Answer Set Programming (ASP), is a powerful formalism for knowledge …

One of the difficulties of proving program termination is managing the subtle interplay
between the finding of a termination argument and the finding of the argument's supporting …

In this article, we study the complexity of the problems: given a loop, described by linear
constraints over a finite set of variables, is there a linear or lexicographical-linear ranking …

In this paper we study the complexity of the Linear Ranking problem: given a loop, described
by linear constraints over a finite set of integer variables, is there a linear ranking function for …

LNCS 5123 - Proving Conditional Termination Page 1 Proving Conditional Termination Byron
Cook1, Sumit Gulwani1, Tal Lev-Ami2,⋆, Andrey Rybalchenko3,⋆⋆, and Mooly Sagiv2 1 …

The use of logic in databases started in the late 1960s. In the early 1970s Codd formalized
databases in terms of the relational calculus and the relational algebra. A major influence on …

In this article we study the decidability of termination of several variants of simple integer
loops, without branching in the loop body and with affine constraints as the loop guard (and …

Termination analysis has received considerable attention, traditionally in the context of
declarative programming, and recently also for imperative languages. In existing …

The following known observation is useful in establishing program termination: if a transitive
relation R is covered by finitely many well-founded relations U 1,…, Un then R is well …