Standard techniques for analysing sequential programs are severely constrained when applied to a concurrent program because they cannot take full advantage of the concurrent structure of the program. In this work, we overcome this limitation using a novel approach which ``lifts'' a sequential dataflow analysis to a concurrent analysis. First, we introduce concurrency primitives which abstract away from the details of how concurrency features are implemented in real programming languages. Using these primitives, we describe how sequential analyses can be made applicable to concurrent programs. Under some circumstances, there is no penalty for concurrency: our method produces results which are as precise as the sequential analysis. Our lifting is straightforward, and we illustrate it on some standard analyses -- available expressions, live variables and generalized constant propagation. Finally, we describe how concurrency features of real languages can be expressed using our abstract concurrency primitives, and present analyses for finding our concurrency primitives in real programs.
| Identifer | oai:union.ndltd.org:vtechworks.lib.vt.edu/oai:vtechworks.lib.vt.edu:10919/71569 |
| Date | 08 1900 |
| Creators | Lam, Patrick |
| Contributors | Computer Science |
| Publisher | McGill University |
| Source Sets | VTechWorks NDLTD ETDs |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | application/postscript, application/postscript |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0029 seconds