Sciweavers

1359 search results - page 8 / 272
» Black-Box Program Specialization
Sort
View
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
FOCS
2005
IEEE
14 years 1 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
DAGSTUHL
2007
13 years 9 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
ISSTA
2006
ACM
14 years 1 months ago
Coverage metrics for requirements-based testing
In black-box testing, one is interested in creating a suite of tests from requirements that adequately exercise the behavior of a software system without regard to the internal st...
Michael W. Whalen, Ajitha Rajan, Mats Per Erik Hei...
ESOP
2005
Springer
14 years 1 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi