Sciweavers

584 search results - page 3 / 117
» On Applying Set Covering Models to Test Set Compaction
Sort
View
FLOPS
2010
Springer
14 years 2 months ago
Applying Constraint Logic Programming to SQL Test Case Generation
We present a general framework for generating SQL query test cases using Constraint Logic Programming. Given a database schema and a SQL view defined in terms of other views and s...
Rafael Caballero, Yolanda García-Ruiz, Fern...
ENTCS
2007
115views more  ENTCS 2007»
13 years 7 months ago
A Global Algorithm for Model-Based Test Suite Generation
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
Anders Hessel, Paul Pettersson
VTS
1997
IEEE
96views Hardware» more  VTS 1997»
13 years 11 months ago
Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors
Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a sm...
Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. P...
BSL
2005
106views more  BSL 2005»
13 years 7 months ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 7 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani