Paper Info
Title
Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data
Abstract
Determination of storage properties (e.g., aliasing, def-use chains, liveness, etc.) is one of the primary concerns in the implementation of any pro- gramming language. We present a new semantic framework and analysis based on operational traces that subsumes and improves upon most existing work in this area and handles concurrency, higher-order functions, first-class continuations, assignment, and recursive structured data. The analysis de termines a storage re- lation: : means that in any evaluation segment starting from program point , the single unit of data allocated at point is referenced by subcomponent of variable after evaluation proceeds through control path , where is either a control path representing the point of an allocation that o ccurred after point , or a symbolic term representing an allocation before point and referenced by component of variable at . This relation can relate recursive control structure (including process spawns) and recursive data st ructure, and is suitable for analysis of arbitrary code or evaluation-trace fragmen ts.
Year
DOI
Venue
1995
10.1007/3-540-60360-3_33
SAS
Keywords
Field
DocType
concurrent programs,structured data,storage properties,control structure,higher order functions
Computer science,Concurrency,Abstract interpretation,Real-time computing,Theoretical computer science,Aliasing,Regular language,Data model,Recursive data type,Recursion,Liveness
Conference
ISBN
Citations 
PageRank 
3-540-60360-3
4
0.56
References 
Authors
15
1
Name
Order
Citations
PageRank
Christopher Colby123718.39