Article

Towards Alias-Free Pointers

Author:

Naftaly H. MinskyAuthors Info & Claims

ECCOP '96: Proceedings of the 10th European Conference on Object-Oriented Programming

Pages 189 - 209

Published: 08 July 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Kedia PCosta MParkinson MVaswani KVytiniotis DBlankstein A(2017)Simple, fast, and safe manual memory managementACM SIGPLAN Notices10.1145/3140587.306237652:6(233-247)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062376
Kedia PCosta MParkinson MVaswani KVytiniotis DBlankstein ACohen AVechev M(2017)Simple, fast, and safe manual memory managementProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062376(233-247)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062376
Haller PLoiko A(2016)LaCasa: lightweight affinity and object capabilities in ScalaACM SIGPLAN Notices10.1145/3022671.298404251:10(272-291)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/3022671.2984042
Show More Cited By

Recommendations

Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Interprocedural may-alias analysis for pointers: beyond k-limiting

Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting, and store-based (or equivalently location or region-based) approximations, which blur distinction between elements of ...
Interprocedural may-alias analysis for pointers: beyond k-limiting
PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation

Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting, and store-based (or equivalently location or region-based) approximations, which blur distinction between elements of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ECCOP '96: Proceedings of the 10th European Conference on Object-Oriented Programming

July 1996

499 pages

ISBN:3540614397

Editor:
Pierre Cointe

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 July 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kedia PCosta MParkinson MVaswani KVytiniotis DBlankstein A(2017)Simple, fast, and safe manual memory managementACM SIGPLAN Notices10.1145/3140587.306237652:6(233-247)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062376
Kedia PCosta MParkinson MVaswani KVytiniotis DBlankstein ACohen AVechev M(2017)Simple, fast, and safe manual memory managementProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062376(233-247)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062376
Haller PLoiko A(2016)LaCasa: lightweight affinity and object capabilities in ScalaACM SIGPLAN Notices10.1145/3022671.298404251:10(272-291)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/3022671.2984042
Benitez SMurray TStefan D(2016)Short PaperProceedings of the 2016 ACM Workshop on Programming Languages and Analysis for Security10.1145/2993600.2993604(69-75)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2993600.2993604
Haller PLoiko AVisser ESmaragdakis Y(2016)LaCasa: lightweight affinity and object capabilities in ScalaProceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2983990.2984042(272-291)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2983990.2984042
Brandauer SClarke DWrigstad T(2015)Disjointness domains for fine-grained aliasingACM SIGPLAN Notices10.1145/2858965.281428050:10(898-916)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2858965.2814280
Brandauer SClarke DWrigstad TAldrich JEugster P(2015)Disjointness domains for fine-grained aliasingProceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2814270.2814280(898-916)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2814270.2814280
Mycroft AVoigt J(2013)Notions of aliasing and ownershipAliasing in Object-Oriented Programming10.5555/2554511.2554517(59-83)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2554511.2554517
Matsakis N(2012)Parallel closuresProceedings of the 4th USENIX conference on Hot Topics in Parallelism10.5555/2342788.2342793(5-5)Online publication date: 7-Jun-2012
https://dl.acm.org/doi/10.5555/2342788.2342793
Naden KBocchino RAldrich JBierhoff KField JHicks M(2012)A type system for borrowing permissionsProceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2103656.2103722(557-570)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103656.2103722
Show More Cited By

Abstract

Cited By

Recommendations

Interprocedural pointer alias analysis

Interprocedural may-alias analysis for pointers: beyond k-limiting

Interprocedural may-alias analysis for pointers: beyond k-limiting

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations