Semantic analysis for parallelizing C

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free