Sciweavers

27692 search results - page 169 / 5539
» Where is ...
Sort
View
POPL
2006
ACM
16 years 2 months ago
Hybrid type checking
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
Cormac Flanagan
POPL
2005
ACM
16 years 2 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
CADE
2005
Springer
16 years 2 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
STOC
2007
ACM
123views Algorithms» more  STOC 2007»
16 years 2 months ago
A 3-query PCP over integers
A classic result due to H?astad established that for every constant > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends o...
Venkatesan Guruswami, Prasad Raghavendra
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
16 years 2 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...