A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Efficient and precise points-to analysis: modeling the heap by merging equivalent automata
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017
Mainstream points-to analysis techniques for object-oriented languages rely predominantly on the allocation-site abstraction to model heap objects. We present MAHJONG, a novel heap abstraction that is specifically developed to address the needs of an important class of type-dependent clients, such as call graph construction, devirtualization and mayfail casting. By merging equivalent automata representing type-consistent objects that are created by the allocationsite abstraction, MAHJONGdoi:10.1145/3062341.3062360 dblp:conf/pldi/TanLX17 fatcat:6h4wpvlzw5dqliioxurkiqxp2q