DocumentCode
2893053
Title
A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations
Author
Deutsch, Alain
Author_Institution
LIX, Ecole Polytech., Palaiseau, France
fYear
1992
fDate
20-23 Apr 1992
Firstpage
2
Lastpage
13
Abstract
The problem of interference and aliasing in programming languages with structured, dynamically allocated data is studied. The author starts from a novel semantic model of data aliasing, then elaborates new results in formal language theory in order to represent its invariants, and finally uses these results to derive an efficient and online algorithm for statically determining dynamic aliasing properties of structured data
Keywords
formal languages; programming languages; programming theory; data aliasing; dynamic aliasing properties; dynamically allocated data; finite representations; formal language theory; interference; novel semantic model; online algorithm; programming languages; right-regular equivalence relations; storeless model; structured data; Aggregates; Algorithm design and analysis; Artificial intelligence; Computer languages; Formal languages; Interference; Lattices; Memory management; Performance analysis; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Languages, 1992., Proceedings of the 1992 International Conference on
Conference_Location
Oakland, CA
Print_ISBN
0-8186-2585-6
Type
conf
DOI
10.1109/ICCL.1992.185463
Filename
185463
Link To Document