Static analysis of recursive data structures

D. K. Arvind, T. A. Lewis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The static analysis of imperative programs is made difficult by the unrestricted pointer structures which makes their analysis imprecise. A static analysis approach is proposed for a class of graph-like data structures, for which the programmer infuses extra structural information in their description using a Markov algorithm. The method is illustrated with an example.
Original languageEnglish
Title of host publicationLanguages and Compilers for Parallel Computing
Subtitle of host publication10th International Workshop, LCPC'97 Minneapolis, Minnesota, USA, August 7–9, 1997 Proceedings
EditorsZhiyuan Li, Pen-Chung Yew, Siddharta Chatterjee, Chua-Huang Huang, P. Sadayappan, David Sehr
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Pages423-426
Number of pages4
ISBN (Print)978-3-540-69788-6
DOIs
Publication statusPublished - 1998

Fingerprint

Dive into the research topics of 'Static analysis of recursive data structures'. Together they form a unique fingerprint.

Cite this