1972 search results - page 144 / 395 » connection 2008 |
166
click to vote
ESOP
2008
Springer
15 years 7 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
163
click to vote
FC
2008
Springer
15 years 7 months ago
2008
Springer
Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to services. Many of these online services handle personal ...
138
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
135
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
135
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...