1485 search results - page 70 / 297 » Whole Program Paths |
ICSE
2010
IEEE-ACM
14 years 2 months ago
2010
IEEE-ACM
We present an approach for describing tests using nondeterministic test generation programs. To write such programs, we introduce UDITA, a Java-based language with non-determinist...
DAGSTUHL
2001
13 years 11 months ago
2001
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
SAC
2008
ACM
13 years 9 months ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
CAV
2007
Springer
14 years 3 months ago
2007
Springer
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...