Sciweavers

291 search results - page 37 / 59
» Software-Test
Sort
View
AE
2009
Springer
13 years 11 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
ENTCS
2007
131views more  ENTCS 2007»
13 years 9 months ago
Architecting Fault-tolerant Component-based Systems: from requirements to testing
Fault tolerance is one of the most important means to avoid service failure in the presence of faults, so to guarantee they will not interrupt the service delivery. Software testi...
Antonio Bucchiarone, Henry Muccini, Patrizio Pelli...
TAP
2008
Springer
144views Hardware» more  TAP 2008»
13 years 9 months ago
Integrating Verification and Testing of Object-Oriented Software
Formal methods can only gain widespread use in industrial software development if they are integrated into software development techniques, tools, and languages used in practice. A...
Christian Engel, Christoph Gladisch, Vladimir Kleb...
PTS
2010
147views Hardware» more  PTS 2010»
13 years 8 months ago
FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution
Recently there has been an upsurge of interest in both, Search– Based Software Testing (SBST), and Dynamic Symbolic Execution (DSE). Each of these two approaches has complementar...
Kiran Lakhotia, Nikolai Tillmann, Mark Harman, Jon...
ALGORITHMICA
2011
13 years 4 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro