| M. Dwyer. Data Flow Analysis Frameworks for Concurrent Programs. Technical Report UM-CS-1995-062, University of Massachusetts at Amherst, US, 1995. |
.... in these cases, using the Galois connection, a classical abstract interpretation technique [8] The algorithm used for solving the constraint propagation problem in the case of the lattice of constants is the classical iterative algorithm from [17] with an interprocesses variant such as [9]. In the case of the integer intervals lattice, due to the fact that it has infinite height, we use for each process a widening technique as in [3] The results of the constraint propagation problem are used in simplifying the specification by means of slicing. However, they also allow, for the ....
M. Dwyer. Data Flow Analysis Frameworks for Concurrent Programs. Technical Report UM-CS-1995-062, University of Massachusetts at Amherst, US, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC