1722 search results - page 83 / 345 » Generating Tests from Counterexamples |
132
click to vote
MANSCI
2011
14 years 10 months ago
2011
This article develops a method for drawing samples from which it is impossible to infer any quantile or moment of the underlying distribution. The method provides researchers with...
127
click to vote
CADE
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
113
click to vote
ASM
2005
ASM
15 years 8 months ago
2005
ASM
Abstract. This paper presents a new approach to model and test hierarchical Graphical User Interfaces (GUIs). We exploit the structure of Hierarchical Finite State Machines (HFSMs)...
136
click to vote
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
165
click to vote
JCB
2002
15 years 2 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...