Sciweavers

669 search results - page 94 / 134
» Haskell program coverage
Sort
View
LOPSTR
2009
Springer
14 years 1 months ago
Towards a Framework for Constraint-Based Test Case Generation
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
François Degrave, Tom Schrijvers, Wim Vanho...
CAV
2010
Springer
201views Hardware» more  CAV 2010»
14 years 26 days ago
Contessa: Concurrency Testing Augmented with Symbolic Analysis
Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named CONTESSA that augments conventional testing (concrete...
Sudipta Kundu, Malay K. Ganai, Chao Wang
SIGCSE
1991
ACM
98views Education» more  SIGCSE 1991»
14 years 15 days ago
Pictures as invariants
The development, specification, and use of a loop invariant are useful and underutilized tools in writing code to solve a problem or implement an algorithm. Invariants are especi...
Owen L. Astrachan
COLING
1990
13 years 10 months ago
A Mechanism for ellipsis resolution in dialogued systems
: An ellipsis resolution mechanism is presented. The mechanism is a part of a Natural Language Understanding System developed in the last years in order to be included as a main co...
Arantza Díaz de Ilarraza Sánchez, H....
PEPM
2010
ACM
14 years 5 months ago
PET: a partial evaluation-based test case generation tool for Java bytecode
PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Par...
Elvira Albert, Miguel Gómez-Zamalloa, Germ&...