loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96)
Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations
Chicago, IL
August 19-August 23
ISBN: 0-8186-7542-X
ASCII Text
x 
 
F. de Dinechin, S. Robert, "Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 381, 1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/ASAP.1996.544733,
author = {F. de Dinechin and S. Robert},
title = {Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations},
journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on},
volume = {0},
year = {1996},
issn = {1063-6862},
pages = {381},
doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.1996.544733},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
TI - Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations
SN - 1063-6862
SP
EP
A1 - F. de Dinechin,
A1 - S. Robert,
PY - 1996
KW - program verification; specification languages; programming environments; hierarchical static analysis; structured systems; affine recurrence equations; ALPHA language; polyhedral domains; complex algorithms; parameterized structures; ALPHA programs; type-checking process; single assignment rule; Gaussian elimination
VL - 0
JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
ER -
 
F. de Dinechin, IRISA, Rennes, France
S. Robert, IRISA, Rennes, France
The ALPHA language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures of such systems. This paper discusses the static analysis of ALPHA programs, an extended type-checking process based on the single assignment rule. We present techniques ensuring, on one hand, that a system is valid (with respect to this rule) within a certain range of its parameters, and on the other, that no system is used with invalid values of its parameters. These techniques have been implemented in a versatile tool for ALPHA which is demonstrated on the example of the Gaussian elimination.
Index Terms:
program verification; specification languages; programming environments; hierarchical static analysis; structured systems; affine recurrence equations; ALPHA language; polyhedral domains; complex algorithms; parameterized structures; ALPHA programs; type-checking process; single assignment rule; Gaussian elimination
Citation:
F. de Dinechin, S. Robert, "Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations," asap, pp.381, 1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.