1163 search results - page 41 / 233 » Concurrent Subspaces Analysis |
107
click to vote
ESOP
1999
Springer
15 years 2 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
KBSE
1997
IEEE
15 years 2 months ago
1997
IEEE
Modern software systems are designed and implemented in a modular fashion by composing individual components. Early validation of individual module designs and implementations off...
JLP
2000
14 years 9 months ago
2000
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
ICSE
1999
IEEE-ACM
15 years 2 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...