Article

Free access

Array abstractions using semantic analysis of trapezoid congruences

Author:

François MasdupuyAuthors Info & Claims

ICS '92: Proceedings of the 6th international conference on Supercomputing

Pages 226 - 235

https://doi.org/10.1145/143369.143414

Published: 01 August 1992 Publication History

Abstract

With the growing use of vector supercomputers, efficient and accurate data structure analyses are needed. What we propose in this paper is to use the quite general framework of Cousot's abstract interpretation for the particular analysis of multi-dimensional array indexes. While such indexes are integer tuples, a relational integer analysis is first required. This analysis results of a combination of existing ones that are interval and congruence based. Two orthogonal problems are directly concerned with the results of such an analysis, that are the parallelization/vectorization with the dependence analysis and the data locality problem used for array storage management. After introducing the analysis algorithm, this paper describes on a complete example how to use it in order to optimize array storage.

References

[1]

U. Banerjee. Dependence Analysis for Supercom. puting. Kluwer Academic Publishers, 1988.

Digital Library

[2]

V. Balasundaram and K. Kennedy. A technique for summerizing data access and its use in parallelism enhancing transformations. In Conference on Programming Language Design and Implementation, SIGPLAN Notices, pages 41-53, Jun. 1989.

Digital Library

[3]

P. Cousot and R. Cousot. Abstract interpretation ~ a unified lattice model for static analysis of programs by construction of approximation of fixpoints. In 4th Annual A CM Symposium on Principles o.f Programming Languages, pages 238-252, Los Angeles, January 1977.

Digital Library

[4]

P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In 6th Annual ACM Symposium on Principles of Programming Languages, pages 269-282, 1979.

Digital Library

[5]

P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Filth Annual A CM Symposium on Principles of Programming Languages, pages 84-97, Tucson, Ariz., Jan. 1978.

Digital Library

[6]

P. Cousot. Mgthodes itgratives de construction et d'approximation de points fixes d'opdrateurs monotones sur un treillis, analyse sdmantique de programmes. Th~se d'$tat, Mar. 1978. Universit$ scientifique et m~dicale de Grenoble.

[7]

A. Deutsch. A storeless model of aliasing and its abstraction using finite representation of rightregular equivalence relations. In International Conference on Computing Languages, 1992.

[8]

D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformation. In International Conference on Supercomputing, pages 229-254, 1987.

Digital Library

[9]

P. Granger. Analyses sdmantiques de congruence. PhD thesis, Ecole Polytechnique, Palaiseau, July 1991.

[10]

P. Granger. Static analysis of linear congruence equalities among variables of a program. In International Joint Conference on Theory and Practice of Software Development, volume 493 of Lecture Notes on Computer Science, pages 169-192. Springer Verlag, 1991.

Digital Library

[11]

T. Gross and P. Steenkiste. Structured dataflow analysis for arrays and its use in optirnizing compiler. Software -- Practice and Experience, 20(2):133-155, February 1990.

Digital Library

[12]

P. Havlak and K. Kennedy. Experience with interprocedural analysis of array side effects. In Su. percomputing'90, SIGPLAN Notices, New York, Nov. 1990.

Digital Library

[13]

F. Irigoin, P. Jouvelot, and R. Triolet. Ow;rview of the pips project. In International Workshop on Compiler for Parallel Computers, pages 199-212, 1990.

[14]

M. Karr. Afllne relationships among variables of a program. Acta Informatica, 6:133-151, 1976.

Digital Library

[15]

F. M~sdupuy. Using abstract interpretati.on to analyse multi-dimensional array subscripts. Research Report LIX/RR/91/07, Ecole Polytechnique, 91128 PaJ~iseau, France, 1991.

[16]

F. Ma~dupuy. Using abstract interpretation to detect array data dependencies. In International Symposium on Supercomputing, Fukuoka, pages 19-27. Kyushu University press, 1991.

[17]

F. Mazdupuy. Semantic analysis of rational interval congruences. Research Report LIX/- RR/92/05, Ecole Polytechnique, 91128 Palaiseau, 1992.

[18]

Ore O. Galois connections. Transactions Amer. Math. Soc., 55:493-515, 1944.

[19]

D.R. Wallace. Dependence of multi-dimensional array references. In International Conference on Supercomputing, pages 418-428, 1988.

Digital Library

Cited By

Pitchanathan ACohen AZinenko OGrosser T(2024)Strided Difference Bound MatricesComputer Aided Verification10.1007/978-3-031-65627-9_14(279-302)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65627-9_14
Boillot JFeret J(2023)Symbolic Transformation of Expressions in Modular ArithmeticStatic Analysis10.1007/978-3-031-44245-2_6(84-113)Online publication date: 22-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-44245-2_6
Ghorbal KIvančić FBalakrishnan GMaeda NGupta A(2012)Donut domainsProceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation10.1007/978-3-642-27940-9_16(235-250)Online publication date: 22-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27940-9_16
Show More Cited By

Index Terms

Recommendations

Array-data flow analysis and its use in array privatization
POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Data-flow analysis of scalar variables and data dependence analysis on array elements are two important program analyses used in optimizing and parallelizing compilers. Traditional data-flow analysis models accesses of array elements simply as accesses ...
Demand-Driven Interprocedural Array Property Analysis
LCPC '99: Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing

Many optimization techniques rely on the analysis of array subscripts. Current compilers often give up optimizations when arrays are subscripted by index arrays and treat the index arrays as unknown functions at compile-time. However, recent empirical ...
Interprocedural array data-flow analysis

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '92: Proceedings of the 6th international conference on Supercomputing

August 1992

495 pages

ISBN:0897914856

DOI:10.1145/143369

Chairmen:
Ken Kennedy
Rice University, Houston, TX
,
Constantine D. Polychronopoulos
Kubota Pacific Computers and CSRD

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS92

Sponsor:

SIGARCH

ICS92: ACM SIGARCH International Conference on Supercomputing

July 19 - 24, 1992

D. C., Washington, USA

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
403
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)7

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pitchanathan ACohen AZinenko OGrosser T(2024)Strided Difference Bound MatricesComputer Aided Verification10.1007/978-3-031-65627-9_14(279-302)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65627-9_14
Boillot JFeret J(2023)Symbolic Transformation of Expressions in Modular ArithmeticStatic Analysis10.1007/978-3-031-44245-2_6(84-113)Online publication date: 22-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-44245-2_6
Ghorbal KIvančić FBalakrishnan GMaeda NGupta A(2012)Donut domainsProceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation10.1007/978-3-642-27940-9_16(235-250)Online publication date: 22-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27940-9_16
Oancea CMycroft AHarris TMeyer auf der Heide FBender M(2009)A lightweight in-place implementation for software thread-level speculationProceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures10.1145/1583991.1584050(223-232)Online publication date: 11-Aug-2009
https://dl.acm.org/doi/10.1145/1583991.1584050
Halbwachs NPéron M(2008)Discovering properties about arrays in simple programsACM SIGPLAN Notices10.1145/1379022.137562343:6(339-348)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1379022.1375623
Halbwachs NPéron MGupta RAmarasinghe S(2008)Discovering properties about arrays in simple programsProceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1375581.1375623(339-348)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375581.1375623
Oancea CMycroft A(2008)Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS)Languages and Compilers for Parallel Computing10.1007/978-3-540-89740-8_11(156-171)Online publication date: 28-Nov-2008
https://dl.acm.org/doi/10.1007/978-3-540-89740-8_11
Huuck R(2005)Semantics and Analysis of Instruction List ProgramsElectronic Notes in Theoretical Computer Science (ENTCS)10.5555/2773580.2773786115:C(3-18)Online publication date: 18-Jan-2005
https://dl.acm.org/doi/10.5555/2773580.2773786
Cridlig RGoubault E(2005)Semantics and analysis of linda-based languagesStatic Analysis10.1007/3-540-57264-3_30(72-86)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57264-3_30
Handjieva MTzolovski S(2002)Refining Static Analyses by Trace-Based Partitioning Using Control FlowStatic Analysis10.1007/3-540-49727-7_12(200-214)Online publication date: 24-Sep-2002
https://doi.org/10.1007/3-540-49727-7_12
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents