Sciweavers

101 search results - page 14 / 21
» Data Flow Analysis for Verifying Properties of Concurrent Pr...
Sort
View
AGP
1995
IEEE
13 years 11 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
POPL
2004
ACM
14 years 7 months ago
Atomizer: a dynamic atomicity checker for multithreaded programs
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
Cormac Flanagan, Stephen N. Freund
BPM
2006
Springer
128views Business» more  BPM 2006»
13 years 9 months ago
Towards Formal Verification of Web Service Composition
Abstract. Web services composition is an emerging paradigm for enabling application integration within and across organizational boundaries. Current Web services composition propos...
Mohsen Rouached, Olivier Perrin, Claude Godart
JDA
2006
85views more  JDA 2006»
13 years 7 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger