3. Deciding Constants by Effective Weakest Preconditions

  • Markus Müller-Olm
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3800)


One goal of classifying the complexity of weakened versions of program-analysis problems is to uncover potential for more precise analysis algorithms. As witnessed by the white space in Table 2.2, three questions remained open in the complexity classification of the previous chapter: there is no result for Presburger must-constants and there are no upper bounds for polynomial must-constants and Presburger may-constants. In this chapter we provide answers for two of these questions that uncover algorithmic potential. We show that Presburger must-constants can be detected in polynomial time and that polynomial must-constants are decidable by developing corresponding algorithms.


Polynomial Ring Complete Lattice Abstract Interpretation Start Node Program Point 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Markus Müller-Olm

    There are no affiliations available

    Personalised recommendations