Refined Fortran: an update

Authors:
D. Klappholz;X. Kong;A. D. Kalis
Affiliations:
Department of Electrical Engineerlng and Computer Science, Stevens Institute of Technology, Castle Point Station, Hohoken, NJ;Department of Electrical Engineerlng and Computer Science, Stevens Institute of Technology, Castle Point Station, Hohoken, NJ;Department of Electrical Engineerlng and Computer Science, Stevens Institute of Technology, Castle Point Station, Hohoken, NJ
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 6
Cited 2

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Dependence analysis for pointer variables

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Refined C: an update

Selected papers of the second workshop on Languages and compilers for parallel computing
Optimizing Supercompilers for Supercomputers

Optimizing Supercompilers for Supercomputers
Dependence Analysis for Supercomputing

Dependence Analysis for Supercomputing
Dependence analysis for subscripted variables and its application to program transformations

Dependence analysis for subscripted variables and its application to program transformations

Decomposition Abstraction in Parallel Rule Languages

IEEE Transactions on Parallel and Distributed Systems
The design, implementation, and evaluation of Jade

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Refined Languages (Refined Fortran, Refined C, etc.) are extensions of their parent languages in which it is possible to express parallelism, but impossible to create races or deadlocks. Where strictly deterministic behavior is desired, multiple executions of a Refined Fortran program with the same input data can be guaranteed to either compute the same results or terminate with the same run-time errors regardless of differences in scheduling. Where asynchronous behavior is desired, freedom from races can be guaranteed. The Refined Languages approach achieves its goal by extending sequential imperative programming languages with data- (rather than control-) oriented constructs, and by viewing the expression of parallelism in data- (rather than control-) oriented terms. Earlier versions of Refined Fortran are discussed in [1]-[2]; the present work supersedes and extends work reported in these earlier publications.