Sciweavers

5216 search results - page 803 / 1044
» Planning as Model Checking
Sort
View
POPL
2012
ACM
14 years 2 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
PLDI
2012
ACM
13 years 9 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
EMSOFT
2001
Springer
15 years 11 months ago
Interface Theories for Component-Based Design
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
Luca de Alfaro, Thomas A. Henzinger
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
16 years 6 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
BTW
2005
Springer
113views Database» more  BTW 2005»
16 years 1 days ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...