article

Free access

Static analysis of low-level synchronization

Authors:

David Callahan,

Jaspal SublokAuthors Info & Claims

ACM SIGPLAN Notices, Volume 24, Issue 1

Pages 100 - 111

https://doi.org/10.1145/69215.69225

Published: 01 November 1988 Publication History

PDF eReader

References

[1]

Parallel FORTRAN Language and Library Reference. IBM, first edition, February 12th 1988. Document Number SC23-0431-0.

Google Scholar

[2]

A. Aho, R. Sethi, and :I. Ullman. Compilers: Principles, Techniques and Tools. Addison- Wesley, 1986.

Digital Library

Google Scholar

[3]

A. V. Aho, J. E. tIopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.

Digital Library

Google Scholar

[4]

J. R. Allen, D. B~umgartner, K. Kennedy, and A. Porterfield. PTOOL: a semi-automatic parallel programming assistant. In Proceedings of the 1986 International Conference on Parallel Processing, IEEE Computer Society Press, August 1986.

Google Scholar

[5]

J. R. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In Conference Record of the Fourteenth A CM Symposium on the Principles of Programming Languages, Munich, West Germany, January 1987.

Digital Library

Google Scholar

[6]

J. R. Allen and K. Kennedy. PFC: a program to convert Fortran to parallel form. Technical Report MASC-TR 82-6, Dept. of Mathematical Sciences, Rice University, March 1982.

Google Scholar

[7]

R. Allen and K. Kennedy. Automatic translation of FORTRAN programs to vector form. A CM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987.

Digital Library

Google Scholar

[8]

W. F. Applebe and C. E. McDowell. Anomaly reporting ~ a tool fo~ debugging and developing numerical algorithms. In First International Conference on Supercomputers, Florida, December 1985.

Google Scholar

[9]

V. Balasundaram, D. BKumgartner, D. Callahan, K. Kennedy, and J. Subhlok. PTOOL: a system for static analysis of parallel programs. (in preparation).

Google Scholar

[10]

D. Callahan, K. Cooper, R. Hood, K. Kennedy, L Torczon, and S. Warren. Parallel programming support in Parascope. In Proceedings of lhe 1987 DFVLR Conference on Parallel Processing in Science and Engineering, Koln, We~t Germany, June 1987. Available as Rice University, Dept. of Computer Science Technical Report TR87-59.

Digital Library

Google Scholar

[11]

J. Ferrante, K. J. Ottenstein, and :I. D. Warren. The program dependence graph and its use in optimization. A CM Transactions on Programming Languages and Systems, 9(3):319- 349, July 1987.

Digital Library

Google Scholar

[12]

P. O. Frederickson, P~. E. Jones, and B. T. Smith. Synchronization and control of parallel algorithms. In Lecture Notes on Computing, pages 255-264, North-Holland, 1985.

Crossref

Google Scholar

[13]

L. Henderson. The Usefulness of Dependecyanalysis Tools in Parallel Programming: Experiences Using PTOOL. Technical Report Preprint LA-UR-87-3135, Los Alamos National Laboratory, September 1987.

Google Scholar

[14]

S. Horowitz, J. Prins, and T. Reps. On the adequacy of program dependence graphs for representing programs. In Conference Record of the Fifteenth A CM Symposium on the Principles of Programming Languages, pages 146-157, San Diego, CA, January 1988.

Digital Library

Google Scholar

[15]

It. :I. Jordan. Structuring parallel algorithms in an MIMD, shared memory environment. Parallel Computing, 3:93-110, 1986.

Digital Library

Google Scholar

[16]

J. Kam and J. Ullman. Montone data flow analysis frameworks. Acta informatica, 7, 1977.

Google Scholar

[17]

A. It. Karp. Programming for parallelism. Computer, 20(5):43-57, May 1987.

Digital Library

Google Scholar

[18]

D. J. Kuck. The S~ruc~ure of Computers and Computation. Volume 1, John Wiley & Sons, New York, 1978.

Digital Library

Google Scholar

[19]

D. J. Kuck, R. II. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations, in Conference Record of the Eigth A CM Symposium on the Principles of Programming Languages, pages 207-218, January 1981.

Digital Library

Google Scholar

[20]

L. L. Pollock and M. L. Sofia. Incremental compilation of locally optimized code. In Conference Record of the Twelfth A CM Symposium on the Principles of Programming Languages, pages 152-164, January 1985.

Digital Library

Google Scholar

[21]

R. N. Taylor. A general purpose algorithm for analyzing concurrent programs. Communications of the ACM, 26(5):362-376, May 1983.

Digital Library

Google Scholar

Cited By

View all

Masud ALisper BCiccozzi F(2018)Automatic Inference of Task Parallelism in Task-Graph-Based Actor ModelsIEEE Access10.1109/ACCESS.2018.28857056(78965-78991)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2885705
Di PSui Y(2016)Accelerating Dynamic Data Race Detection Using Static Thread Interference AnalysisProceedings of the 7th International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/2883404.2883405(30-39)Online publication date: 12-Mar-2016
https://dl.acm.org/doi/10.1145/2883404.2883405
Shih WYou YHuang CLee J(2014)Compiler Optimization for Reducing Leakage Power in Multithread BSP ProgramsACM Transactions on Design Automation of Electronic Systems10.1145/266811920:1(1-34)Online publication date: 18-Nov-2014
https://dl.acm.org/doi/10.1145/2668119
Show More Cited By

Index Terms

Static analysis of low-level synchronization
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Multiprocessing / multiprogramming / multitasking
        Process synchronization
    2. Extra-functional properties
      1. Software performance

Recommendations

Practical and Accurate Low-Level Pointer Analysis
CGO '05: Proceedings of the international symposium on Code generation and optimization

Pointer analysis is traditionally performed once, early in the compilation process, upon an intermediate representation (IR) with source-code semantics. However, performing pointer analysis only once at this level imposes a phase-ordering constraint, ...
Machine-learning-guided selectively unsound static analysis
ICSE '17: Proceedings of the 39th International Conference on Software Engineering

We present a machine-learning-based technique for selectively applying unsoundness in static analysis. Existing bug-finding static analyzers are unsound in order to be precise and scalable in practice. However, they are uniformly unsound and hence at ...
SVF: interprocedural static value-flow analysis in LLVM
CC '16: Proceedings of the 25th International Conference on Compiler Construction

This paper presents SVF, a tool that enables scalable and precise interprocedural Static Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF, which is fully implemented in LLVM, allows value-flow construction and ...

Comments

Information & Contributors

Information

Published In

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1988

Published in SIGPLAN Volume 24, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

94
Total Citations
View Citations
577
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)11

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Masud ALisper BCiccozzi F(2018)Automatic Inference of Task Parallelism in Task-Graph-Based Actor ModelsIEEE Access10.1109/ACCESS.2018.28857056(78965-78991)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2885705
Di PSui Y(2016)Accelerating Dynamic Data Race Detection Using Static Thread Interference AnalysisProceedings of the 7th International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/2883404.2883405(30-39)Online publication date: 12-Mar-2016
https://dl.acm.org/doi/10.1145/2883404.2883405
Shih WYou YHuang CLee J(2014)Compiler Optimization for Reducing Leakage Power in Multithread BSP ProgramsACM Transactions on Design Automation of Electronic Systems10.1145/266811920:1(1-34)Online publication date: 18-Nov-2014
https://dl.acm.org/doi/10.1145/2668119
Barik R(2005)Efficient computation of may-happen-in-parallel information for concurrent java programsProceedings of the 18th international conference on Languages and Compilers for Parallel Computing10.1007/978-3-540-69330-7_11(152-169)Online publication date: 20-Oct-2005
https://dl.acm.org/doi/10.1007/978-3-540-69330-7_11
Gupta RSpezialetti M(2005)Towards a non-intrusive approach for monitoring distributed computations through perturbation analysisLanguages and Compilers for Parallel Computing10.1007/3-540-57659-2_33(586-601)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57659-2_33
Iyer SRamesh S(2001)ApportioningIEEE Transactions on Software Engineering10.1109/32.96534327:11(1037-1056)Online publication date: 1-Nov-2001
https://dl.acm.org/doi/10.1109/32.965343
Naumovich GAvrunin GClarke L(1999)An Efficient Algorithm for Computing MHP Information for Concurrent Java ProgramsSoftware Engineering — ESEC/FSE ’9910.1007/3-540-48166-4_21(338-354)Online publication date: 27-Aug-1999
https://doi.org/10.1007/3-540-48166-4_21
Xiong Jianxin Wang Dingxing (1996)Analyzing nondeterminacy of message passing programsProceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96)10.1109/ISPAN.1996.509039(547-549)Online publication date: 1996
https://doi.org/10.1109/ISPAN.1996.509039
Gupta Soffa (1994)A framework for partial data flow analysisProceedings International Conference on Software Maintenance ICSM-9410.1109/ICSM.1994.336794(4-13)Online publication date: 1994
https://doi.org/10.1109/ICSM.1994.336794
Jyh-Herng Chow Harrison W(1994)State space reduction in abstract interpretation of parallel programsProceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)10.1109/ICCL.1994.288373(277-288)Online publication date: 1994
https://doi.org/10.1109/ICCL.1994.288373
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Practical and Accurate Low-Level Pointer Analysis

Machine-learning-guided selectively unsound static analysis

SVF: interprocedural static value-flow analysis in LLVM

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations