SIGN IN
SIGN UP
The undecidability of aliasing
Full Text:
PDF
Buy this Article
Author:
G. Ramalingam
IBM T. J. Watson Research Center, Yorktown Heights, NY
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 16 Issue 5, Sept. 1994
Pages 1467-1471
ACM
New York, NY
, USA
table of contents
doi>
10.1145/186025.186041
1994 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 38
· Downloads (cumulative): 747
· Citation Count: 56
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
alias analysis
compilers
computability theory
decision problems
languages
optimization
pointer analysis
procedures, functions, and subroutines
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder