Sciweavers

3090 search results - page 71 / 618
» On Testing Answer-Set Programs
Sort
View
PTS
2010
175views Hardware» more  PTS 2010»
13 years 7 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
DATE
2006
IEEE
80views Hardware» more  DATE 2006»
14 years 4 months ago
Software-based self-test of processors under power constraints
Software-based self-test (SBST) of processors offers many benefits, such as dispense with expensive test equipments, test execution during maintenance and in the field or initiali...
Jun Zhou, Hans-Joachim Wunderlich
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 7 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
ACMSE
2004
ACM
14 years 3 months ago
Specification-driven automated testing of GUI-based Java programs
This paper presents a specification-driven approach to test automation for GUI-based JAVA programs as an alternative to the use of capture/replay. The NetBeans Jemmy library provi...
Yanhong Sun, Edward L. Jones
COMPSAC
2009
IEEE
14 years 2 months ago
Towards a Theory for Testing Non-terminating Programs
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
Arnaud Gotlieb, Matthieu Petit