Applying answer set programming to points-to analysis of object-oriented language

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Points-to information is essential in software engineering, including compiler optimization, instruction-level parallelism, program verification, and so on. The propagating of points-to information along paths of a program can be viewed as the "frame problem" in a dynamic world. As a primary knowledge representing and reasoning tool in Artificial Intelligence, Answer Set Programming (ASP) provides a natural and concise way to express the frame problem. We present a collection of ASP rules to model the propagating of points-to information along paths of an object-oriented program. With these rules and basic facts of a program, points-to information at each program point can be computed easily. This makes it possible to acquire useful information for program analysis through existing ASP solvers. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Yang, B., Zhang, M., & Zhang, Y. (2011). Applying answer set programming to points-to analysis of object-oriented language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 676–685). https://doi.org/10.1007/978-3-642-24728-6_91

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free