Abstract
We devise a differential fixpoint computation method and develop a new worklist algorithm based on it. Differential methods avoid redundant computation by calculating only the increment of repeated computations. Compared with other differential methods, our method deals with non-distributive functions which often occur in practical program analyses. Also, our worklist algorithm can adopt any worklist scheduling policy satisfying restrictions imposed by differential evaluation. As a practical application, we present an abstract interpretation framework and implement constant and alias analysis and memory lifetime analysis based on it. Our experiment shows that our method can save computation and worklist scheduling is important also in differential evaluations.
This research was supported by IRC (Internet Information Retrieval Research Center) in Hankuk Aviation University. IRC is a Kyounggi-Province Regional Research Center designed by Korea Science and Engineering Foundation and Ministry of Science & Technology.
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
Fong, C.A., Ullman, J.D.: Induction variables in very high-level languages. In: 6th ACM Symp. on Principles of Programming Languages, pp. 104–112 (1976)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of program by construction of approximation of fixpoints. In: 4th ACM Symp. on Principles of Programming Languages, pp. 238–252 (1977)
Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: 6th ACM Symp. on Principles of Programming Languages, pp. 269– 282 (1979)
Paige, R., Koenig, S.: Finite differencing of computable expressions. ACM Trans. on Programming Languages and Systems 4(3), 402–454 (1982)
Jones, N., Mycroft, A.: Data flow analysis of applicative programs using minimal function graphs. In: 13th ACM Symp. on Principles of Programming Languages, pp. 296–306 (1986)
Ryder, B.G., Paull, M.C.: Elimination algorithms for data flow analysis. ACM Computing Surveys 18(3), 277–316 (1986)
Bancilhon, F., Ramakrishnan, R.: An amateur’s introduction to recursive query processing strategies. In: ACM SIGMOD Conference on Management of Data, pp. 16–52 (1986)
Abramsky, S., Hankin, C. (eds.): Abstract Interpretation of Declarative Languages. Computers and Their Applications, Ellis Horwood (1987)
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, principles, techniques, and tools. Addison Wesley, Reading (1988)
Ludwell Harrison III, W., Ammarguellat, Z.: A program’s eye view of MIPRAC. In: Gelernter, D., Nicolau, A., Padua, D. (eds.) Languages and Compilers for Parallel Computing, MIT Press, Cambridge (1992)
Yi, K.: Automatic Generation and Management of Program Analyses, Ph.D. Thesis, CSRD, University of Illinois at Urbana-Champaign (1993)
Chen, L.-l., Harrison, L., Yi, K.: Efficient computation of fixpoints that arise in complex program analysis. Journal of Programming Languages 3(1), 31–68 (1995)
Fecht, C., Seidl, H.: Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 90–104. Springer, Heidelberg (1998)
Fecht, C., Seidl, H.: A faster solver for general systems of equations. Science of Computer Programming 35(2), 137–161 (1999)
Liu, Y.A.: Efficiency by incrementalization: an introduction. Higher-Order and Symbolic Computation 13(4), 289–313 (2000)
Yi, K.: Yet another ensemble of abstract interpreter, higher-order dataflow equations, and model checking, Technical Memorandum ROPAS-2001-10, Research On Program Analysis System, KAIST (2001)
Ahn, J.: A Differential Evaluation of Fixpoint Iterations. In: Proc. of The Second Asian Workshop on Programming Language and Systems, Taejon, pp. 171–182 (2001)
Murawski, A., Yi, K.: Static Monotonicity Analysis for Lambdadefinable Functions over Lattices. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 139–153. Springer, Heidelberg (2002)
Eo, H., Yi, K.: An Improved Differential Fixpoint Iteration Method for Program Analysis. In: Proc. of The Third Asian Workshop on Programming Language and Systems, Shanghai, China (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, J., Kwon, Y.J. (2003). A Differential Fixpoint Evaluation Framework for Non-distributive Systems. In: Ohori, A. (eds) Programming Languages and Systems. APLAS 2003. Lecture Notes in Computer Science, vol 2895. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40018-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-40018-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20536-4
Online ISBN: 978-3-540-40018-9
eBook Packages: Springer Book Archive