16 search results - page 1 / 4 » Ordinal Arithmetic with List Structures |
LFCS
1992
Springer
13 years 9 months ago
1992
Springer
WOLLIC
2007
Springer
13 years 11 months ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
Recommendation systems generally produce the results of their output to their users in the form of an ordinal list. In the interest of simplicity, these lists are often obscure, ,...
ATVA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...