Abstract
Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limitations. In particular, integer multi-variate polynomials arise in many situations while analyzing programs, and analysis systems are unable to handle such expressions. Although some dedicated methods have already been proposed, they only handle some subsets of such expressions. This paper presents an original and general approach to Bernstein expansion which is symbolic. Bernstein expansion allows bounding the range of a multivariate polynomial over a box and is generally more accurate than classic interval methods.
Chapter PDF
References
The polyhedral library polylib, http://icps.u-strasbg.fr/PolyLib
Berchtold, J., Bowyer, A.: Robust arithmetic for multivariate bernsteinform polynomials. Computer-aided Design 32, 681–689 (2000)
Bernstein, S.: Collected Works, vol. 1. USSR Academy of Sciences (1952)
Bernstein, S.: Collected Works, vol. 2. USSR Academy of Sciences (1954)
Blume, W., Eigenmann, R.: Symbolic range propagation. In: 9th Int. Parallel Processing Symposium (April 1995)
Blume, W., Eigenmann, R.: Non-linear and symbolic data dependence testing. IEEE Transactions on Parallel and Distributed Systems 9(12), 1180–1194 (1998)
Clauss, P., Meister, B.: Automatic memory layout transformation to optimize spatial locality in parameterized loop nests. ACM SIGARCH Computer Architecture News 28(1) (March 2000)
Delgado, J., Peña, J.M.: A linear complexity algorithm for the bernstein basis. In: IEEE Int. Conf. on Geometric Modeling and Graphics (GMAG 2003), July 2003, pp. 162–167 (2003)
Van Engelen, R., Gallivan, K., Walsh, B.: Tight timing estimation with the newton-gregory formulae. In: 10th Workshop on Compilers for Parallel Computers, CPC 2003 (January 2003)
Farin, G.: Curves and Surfaces in Computer Aided Geometric Design. Academic Press, San Diego (1993)
Farouki, R.T., Rajan, V.T.: On the numerical condition of polynomials in bernstein form. Computer Aided Geometric Design 4, 191–216 (1987)
Garloff, J.: Application of bernstein expansion to the solution of control problems. In: Vehi, J., Sainz, M.A. (eds.) Proceedings of MISC 1999 - Workshop on Applications of Interval Analysis to Systems and Control, University of Girona, Girona (Spain), pp. 421–430 (1999)
Garloff, J., Graf, B.: Solving Strict Polynomial Inequalities by Bernstein Expansion. In: The Use of Symbolic Methods in Control System Analysis and Design, Institution of Electrical Engineers (IEE), London, pp. 339–352 (1999)
Martin, R., Shou, H., Voiculescu, I., Bowyer, A., Wang, G.: Comparison of interval methods for plotting algebraic curves. Computer Aided Geometric Design 19, 553–587 (2002)
Maslov, V., Pugh, W.: Simplifying polynomial constraints over integers to make dependence analysis more precise. In: Buchberger, B., Volkert, J. (eds.) CONPAR 1994 and VAPP 1994. LNCS, vol. 854. Springer, Heidelberg (1994)
Pop, S.: Analysis of induction variables using chains of recurrences: extensions. Master’s thesis, Université Louis Pasteur, Strasbourg (July 2003)
Stahl, V.: Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations. PhD thesis, Johannes Kepler University Linz, Austria (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clauss, P., Tchoupaeva, I. (2004). A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization. In: Duesterwald, E. (eds) Compiler Construction. CC 2004. Lecture Notes in Computer Science, vol 2985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24723-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24723-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21297-3
Online ISBN: 978-3-540-24723-4
eBook Packages: Springer Book Archive