Automatic parallelization of C language programs is a difficult task due, for example, to side effects within expressions and access to memory via pointers. We describe a method based on semantic analysis of the language, in order to detect parallelism in complex programs using pointer arithmetic. We define semantic domains which respect the type system of the language, and use them to synthesize effect of the program through functional objects called transformations.
CITATION STYLE
David, P. (1992). Semantic analysis for parallelizing C. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 647–652). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_465
Mendeley helps you to discover research relevant for your work.