Data Structure Shape Inference and Verification for OO Programs
An approach to static analysis and verification of linked data structures found in OO programs is to firstly in fer the shape of the object/data structures that may be produced by the program, and secondly to verify that these shapes are consistent with a programmerspecified correct data structure. A feature of the ap proach is that the shapes of the data structures may be graphed at any time, and are easy to understand. The underlying formalism is presented in abstract interpre tation form, and a prototype tool has been developed.
Rhys Owen Hugh Anderson
Center for Creative Technologies Wellington Institute of Technology
国际会议
天津
英文
307-308
2009-07-29（万方平台首次上网日期，不代表论文的发表时间）