Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205)
DOI: 10.1109/icpp.1998.708532
|View full text |Cite
|
Sign up to set email alerts
|

Automatic generation of provably correct parallelizing compilers

Abstract: We show how parallelizing compilers can be automatically derived from denotational de nitions of programming languages. In our approach, the denotational de nition is expressed using de nite clause grammars (syntax speci cation) and Horn Logic or Constraint Logic (semantic speci cation). The conditions for executing two or more statements in parallel (e.g., GCD test, Banerjee test, or exact test) are included as part of the (parallel) denotational semantics of the language. Solutions of diophantine equations, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…These include generating code for parallelizing compilers [9] and for controllers specified in Ada (for verification purposes) in a provably correct manner, and rapidly implementing a domain specific language for bioinformatics [24] and most recently generating code in a provably correct manner for the Software Cost Reduction (SCR) framework, discussed next.…”
Section: Applicationsmentioning
confidence: 99%
“…These include generating code for parallelizing compilers [9] and for controllers specified in Ada (for verification purposes) in a provably correct manner, and rapidly implementing a domain specific language for bioinformatics [24] and most recently generating code in a provably correct manner for the Software Cost Reduction (SCR) framework, discussed next.…”
Section: Applicationsmentioning
confidence: 99%