Detecting conflicts between structure accesses
James R. Larus, Paul N. Hilfinger · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1988
Two references to a record structure conflict if they access the same field and at least one modifies the location. Because structures can be connected by pointers, deciding if two statements conflict requires knowledge of the possible aliases for the locations that they access.
Cited by 156 works. doi:10.1145/53990.53993 Open-access PDF
Authors
References
- The program dependence graph and its use in optimization
- Dependence graphs and compiler optimizations
- An efficient way to find the side effects of procedure calls and the aliases of variables
- A precise inter-procedural data flow algorithm
- Flow analysis and optimization of LISP-like structures
- A flexible approach to interprocedural data flow analysis and programs with recursive data structures
- Monotone data flow analysis frameworks
- A Unified Approach to Path Problems
- Lifetime analysis of dynamically allocated objects
- On the adequacy of program dependence graphs for representing programs