1485 search results - page 46 / 297 » Whole Program Paths |
PPDP
1999
Springer
14 years 2 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
IFM
2005
Springer
14 years 3 months ago
2005
Springer
We provide an automatic method for calculating the path condition for programs with real time constraints. This method can be used for the semiautomatic verification of a unit of ...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at run time.Our scheme gives not only the length (ex...
INFOCOM
1991
IEEE
14 years 1 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
LCN
1997
IEEE
14 years 2 months ago
1997
IEEE
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...