Sciweavers

2302 search results - page 102 / 461
» Testing as Abstraction
Sort
View
LATA
2010
Springer
16 years 3 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
ICSE
2008
IEEE-ACM
16 years 7 months ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
BMCBI
2007
136views more  BMCBI 2007»
15 years 6 months ago
Automating document classification for the Immune Epitope Database
Background: The Immune Epitope Database contains information on immune epitopes curated manually from the scientific literature. Like similar projects in other knowledge domains, ...
Peng Wang, Alexander A. Morgan, Qing Zhang, Alessa...
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
15 years 11 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira