Abstract
Many situations can be modeled as solutions of systems of simultaneous equations. If the functions of these equations monotonically increase in all bound variables, then the existence of extremal fixed point solutions for the equations is guaranteed. Among all solutions, these fixed points uniformly take least or greatest values for all bound variables. Hence, we call them homogeneous fixed points. However, there are systems of equations whose functions monotonically increase in some variables and decrease in others. The existence of solutions of such equations cannot be guaranteed using classical fixed point theory. In this paper, we define general conditions to guarantee the existence and computability of fixed point solutions of such equations. In contrast to homogeneous fixed points, these fixed points take least values for some variables and greatest values for others. Hence, we call them heterogeneous fixed points. We illustrate heterogeneous fixed point theory through points-to analysis.
This is a preview of subscription content, log in via an institution to check access.
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
Choi, J.-D., Burke, M., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: POPL 1993: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 232–245. ACM Press, New York (1993)
Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theoretical Computer Science 277(1–2), 47–103 (2002)
Emami, M.: A practical interprocedural alias analysis for an optimizing/parallelizing C compiler. Master’s thesis, School of Computer Science, McGill University, Montreal (1993)
Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: PLDI 1994: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pp. 242–256. ACM Press, New York (1994)
Feferman, S.: Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis. In: Kino, A., Myhill, J., Vesley, R.E. (eds.) Intuitionism and Proof Theory: Proceedings of the Summer Conference at Buffalo, N.Y. Studies in Logic and the Foundations of Mathematics, pp. 303–326. North-Holland, Amsterdam (1968)
Giacobazzi, R., Mastroeni, I.: Compositionality in the puzzle of semantics. In: Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2002), pp. 87–97. ACM Press, New York (2002)
Hind, M., Burke, M., Carini, P., Choi, J.-D.: Interprocedural pointer alias analysis. ACM Trans. Program. Lang. Syst. 21(4), 848–894 (1999)
Hitchcock, P., Park, D.: Induction rules and termination proofs. In: Nivat, M. (ed.) Proceedings 1st Symp. on Automata, Languages, and Programming, ICALP 1972, Amsterdam, July 3–7, pp. 225–251 (1973)
Kanade, A., Khedker, U., Sanyal, A.: Equivalence of may-must and definite-possibly points-to analyses. Dept. Computer Science and Engg., Indian Institute of Technology, Bombay (April 2005), http://www.cse.iitb.ac.in/~aditya/reports/equivalence-points-to.ps
Kanade, A., Sanyal, A., Khedker, U.: Heterogeneous fixed points. Technical Report TR-CSE-001-05, Dept. Computer Science and Engg., Indian Institute of Technology, Bombay (January 2005), http://www.cse.iitb.ac.in/~aditya/reports/TR-CSE-001-05.ps
Khedker, U.: Data Flow Analysis. In: The Compiler Design Handbook: Optimizations and Machine Code Generation. CRC Press, Boca Raton (2002)
Kildall, G.A.: A unified approach to global program optimization. In: Conference Record of the ACM Symposium on Principles of Programming Languages, October 1973, pp. 194–206. Boston, Massachusetts (1973)
Kleene, S.C.: Introduction to Mathematics. D. Van Nostrand (1952)
Knaster, B.: Une théorème sur les fonctions d’ensembles. Annales Soc. Polonaise Math. 6, 133–134 (1928)
Larus, J.R., Hilfinger, P.N.: Detecting conflicts between structure accesses. In: PLDI 1988: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, pp. 24–31. ACM Press, New York (1988)
Scott, D., de Bakker, J.W.: A theory of programs. Unpublished notes, IBM seminar, Vienna (1969)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanade, A., Khedker, U., Sanyal, A. (2005). Heterogeneous Fixed Points with Application to Points-To Analysis. In: Yi, K. (eds) Programming Languages and Systems. APLAS 2005. Lecture Notes in Computer Science, vol 3780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575467_20
Download citation
DOI: https://doi.org/10.1007/11575467_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29735-2
Online ISBN: 978-3-540-32247-4
eBook Packages: Computer ScienceComputer Science (R0)