Data flow analysis of applicative programs

Micha Sharir*

*Corresponding author for this work

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

Abstract

A precise and efficient data-flow analysis algorithm, for analysis of programs involving procedures with call-by-value parameter passing, is presented and analyzed. It is adapted to handle analysis of applicative programs written in a subset of LISP, but is equally suited to analyze programs written in many other languages, such as ADA, APL and SETL.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 8th Colloquium
EditorsShimon Even, Oded Kariv
PublisherSpringer Verlag
Pages98-113
Number of pages16
ISBN (Print)9783540108436
DOIs
StatePublished - 1981
Event8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel
Duration: 13 Jul 198117 Jul 1981

Publication series

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

Conference

Conference8th International Colloquium on Automata, Languages and Programming, ICALP 1981
Country/TerritoryIsrael
CityAcre
Period13/07/8117/07/81

Fingerprint

Dive into the research topics of 'Data flow analysis of applicative programs'. Together they form a unique fingerprint.

Cite this