223 search results - page 9 / 45 » Proving Termination by Bounded Increase |
APLAS
2010
ACM
13 years 11 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
CALCO
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
ENTCS
2006
13 years 10 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
CADE
2007
Springer
14 years 11 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...