729 search results - page 1 / 146 » A Transitive Closure Based Algorithm for Test Generation |
DAC
1991
ACM
13 years 8 months ago
1991
ACM
JDA
2006
13 years 5 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
ICST
2009
IEEE
13 years 12 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
TACAS
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...