Sciweavers

11784 search results - page 2072 / 2357
» Interpolation for data structures
Sort
View
DAC
2010
ACM
15 years 8 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
ESOP
2007
Springer
15 years 8 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
145
Voted
EUROPAR
2007
Springer
15 years 8 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
SIGIR
2010
ACM
15 years 8 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
FSEN
2007
Springer
15 years 8 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
« Prev « First page 2072 / 2357 Last » Next »