180 search results - page 17 / 36 » Pruning the Search Space in Path-Based Test Generation |
124
click to vote
SIGMOD
2012
ACM
13 years 4 days ago
2012
ACM
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
83
Voted
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
80
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
84
Voted
SIGSOFT
2009
ACM
15 years 4 months ago
2009
ACM
An objective of unit testing is to achieve high structural coverage of the code under test. Achieving high structural coverage of object-oriented code requires desirable method-ca...
110
click to vote
DATE
1999
IEEE
15 years 2 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...