A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Is there a use for linear logic?Published by Association for Computing Machinery (ACM) ,1991
- Static analysis of linear congruence equalities among variables of a programPublished by Springer Nature ,1991
- Minimal and complete word unificationJournal of the ACM, 1990
- Parallelizing programs with recursive data structuresIEEE Transactions on Parallel and Distributed Systems, 1990
- Dependence analysis for pointer variablesPublished by Association for Computing Machinery (ACM) ,1989
- Analysis of functional programs to detect run-time garbage cellsACM Transactions on Programming Languages and Systems, 1988
- Lifetime analysis of dynamically allocated objectsPublished by Association for Computing Machinery (ACM) ,1988
- A semantic model of reference counting and its abstraction (detailed summary)Published by Association for Computing Machinery (ACM) ,1986
- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overviewPublished by Springer Nature ,1984
- Galois connexionsTransactions of the American Mathematical Society, 1944