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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mayer, W., Stumptner, M.: Model-based Debugging-state of the Art and Future Challenges. J. Elec. Notes in Theo. Comp. Sci. 174, 61–82 (2007)
Dawson, S., Ramakrishnan, C.R., Warren, D.S.: Practical Program Analysis Using General Purpose Logic Programming System: A Case Study. In: 9th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 117–126. ACM Press, New York (1996)
Whaley, J., Avots, D., Carbin, M., Lam, M.: Using Datalog with Binary Decision Diagrams for Program Analysis. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 97–118. Springer, Heidelberg (2005)
Song, W.: Using Horn Clauses and Binary Decision Diagrams for Program Analysis. Ph.D. dissertation. State University of New York, Stony Brook (2010)
Woo, J., Gaudiot, J.L., Wendelborn, A.L.: Alias Analysis in Java with Reference-Set Representation for High-Performance Computing. J. Para. Prog. 32, 39–76 (2004)
Meyer, B.: Towards A Theory and Calculus of Aliasing. J. Object Tech. 9, 37–74 (2010)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: 5th International Logic Programming Conference and Symposium, pp. 1070–1080. MIT Press, Cambridge (1988)
Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog Decision Support System for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)
Paschke, A., Bichler, M.: Knowledge Representation Concepts for Automated SLA Management. J. Deci. Supp. Syst. 46, 187–205 (2008)
Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-state Planning: Semantics and Complexity. ACM Trans. on Comp. Logic. 5, 206–263 (2004)
Tiihonen, J., Soininen, T., Niemela, I., Sulonen, R.: A Practical Tool for Mass-customising Configurable Products. In: 14th International Conference on Engineering Design, pp. 1290–1299 (2003)
Lifschitz, V.: Foundation of Logic Programming. In: Principles of Knowledge Representation, pp. 69–128. CSLI Publications (1996)
Carini, P.R., Hind, M., Srinivasan, H.: Flow-Sensitive Type Analysis for C++. IBM Rescarch Report, RC 20267 (1995)
Pande, H.D., Ryder, B.G.: Static Type Determination and Aliasing for C++. Technical Report, LCSR0TR-250-A. Rutgers University (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, B., Zhang, M., Zhang, Y. (2011). Applying Answer Set Programming to Points-to Analysis of Object-Oriented Language. In: Huang, DS., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing. ICIC 2011. Lecture Notes in Computer Science, vol 6838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24728-6_91
Download citation
DOI: https://doi.org/10.1007/978-3-642-24728-6_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24727-9
Online ISBN: 978-3-642-24728-6
eBook Packages: Computer ScienceComputer Science (R0)