241 search results - page 20 / 49 » Bounded Nondeterminism of Logic Programs |
119
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
123
click to vote
CAV
2009
Springer
16 years 2 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
121
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
107
click to vote
ICALP
1995
Springer
15 years 5 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
123
click to vote
IWMM
2009
Springer
15 years 8 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...