1414 search results - page 123 / 283 » Automated Metamorphic Testing |
CADE
2002
Springer
14 years 9 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
ICST
2009
IEEE
14 years 3 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
XPU
2010
Springer
13 years 7 months ago
2010
Springer
Software product lines - families of similar but not identical software products - need to address the issue of feature variability. That is, a single feature might require various...
OOPSLA
2007
Springer
14 years 3 months ago
2007
Springer
One recent change in software development is developers starting to take responsibility for the quality of their work by writing and executing automated tests. As with any new act...
DATE
1998
IEEE
14 years 1 months ago
1998
IEEE
One of the main tasks within the high-level synthesis (HLS) process is the verification problem to prove automatically the correctness of the synthesis results. Currently, the res...