Sciweavers

591 search results - page 79 / 119
» Implementing Joins Using Extensible Pattern Matching
Sort
View
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
15 years 3 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
ECOOP
1998
Springer
15 years 1 months ago
Predicate Dispatching: A Unified Theory of Dispatch
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between pr...
Michael D. Ernst, Craig S. Kaplan, Craig Chambers
WCRE
2003
IEEE
15 years 2 months ago
Improving Fact Extraction of Framework-Based Software Systems
Modern software frameworks provide a set of common and prefabricated software artifacts that support engineers in developing large-scale software systems. Framework-related inform...
Jens Knodel, Martin Pinzger
90
Voted
FLOPS
2008
Springer
14 years 11 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
EUROSYS
2011
ACM
14 years 1 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...