Sciweavers

2864 search results - page 497 / 573
» Constraint Programming in OPL
Sort
View
CP
2005
Springer
14 years 2 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
EDCC
2005
Springer
14 years 2 months ago
PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
Nicky Williams, Bruno Marre, Patricia Mouy, Muriel...
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 2 months ago
Stress testing real-time systems with genetic algorithms
Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. The goal of this article is to automate, based ...
Lionel C. Briand, Yvan Labiche, Marwa Shousha
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
14 years 2 months ago
An approach for QoS-aware service composition based on genetic algorithms
Web services are rapidly changing the landscape of software engineering. One of the most interesting challenges introduced by web services is represented by Quality Of Service (Qo...
Gerardo Canfora, Massimiliano Di Penta, Raffaele E...
HIPEAC
2005
Springer
14 years 2 months ago
Induction Variable Analysis with Delayed Abstractions
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper pre...
Sebastian Pop, Albert Cohen, Georges-André ...