Sciweavers

502 search results - page 75 / 101
» Verifying Balanced Trees
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ISQED
2007
IEEE
127views Hardware» more  ISQED 2007»
14 years 4 months ago
Sensitivity Based Link Insertion for Variation Tolerant Clock Network Synthesis
Clock distribution is one of the key limiting factors in any high speed, sub-100nm VLSI design. Unwanted clock skews, caused by variation effects like manufacturing variations, po...
Joon-Sung Yang, Anand Rajaram, Ninghy Shi, Jian Ch...
PEPM
2007
ACM
14 years 4 months ago
Behavioral similarity matching using concrete source code templates in logic queries
Program query languages and pattern-detection techniques are an essential part of program analysis and manipulation systems. Queries and patterns permit the identification of the...
Coen De Roover, Theo D'Hondt, Johan Brichau, Carlo...
CAV
2010
Springer
225views Hardware» more  CAV 2010»
14 years 1 months ago
Merit: An Interpolating Model-Checker
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...
Nicolas Caniart
POPL
2011
ACM
13 years 21 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu