Year: 1992
Type: conference-paper
Abstract: During execution, when two or more names exist for the same location at some program point, we call them aliases. In a language which allows arbitrary pointers, the problem of determining aliases at a program point is ρ-space-hard [Lan92]. We present an algorithm for the Conditional May Alias problem, which can be used to safely approximate Interprocedural May Alias in the presence of pointers. This algorithm is as precise as possible in the worst case and has been implemented in a prototype analysis tool for C programs. Preliminary speed and precision results are presented.
Authors: William Landi, Barbara G. Ryder
Institution: Rutgers, The State University of New Jersey
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: pointer analysis, approximate analysis, C programs
Open Access status: bronze
Funder: National Science Foundation
OpenAlex ID: W2050320220
