Constraint-based inter-procedural analysis of parallel programs

Helmut Seidl, Bernhard Steffen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also non-bitvector problems like simple constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. MetaFrame or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000, Proceedings
EditorsGert Smolka
PublisherSpringer Verlag
Pages351-365
Number of pages15
ISBN (Print)3540672621, 9783540672623
DOIs
StatePublished - 2000
Externally publishedYes
Event9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 - Berlin, Germany
Duration: 25 Mar 20002 Apr 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1782
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000
Country/TerritoryGermany
CityBerlin
Period25/03/002/04/00

Keywords

  • Bit- vector problems
  • Coincidence theorems
  • Explicit parallelism
  • Inter-procedural program analysis
  • Simple constant propagation

Fingerprint

Dive into the research topics of 'Constraint-based inter-procedural analysis of parallel programs'. Together they form a unique fingerprint.

Cite this