Abstract
In this chapter we present the technique of Constraint Based Analysis using a simple functional language, FUN. We begin by presenting an abstract specification of a Control Flow Analysis and then study its theoretical properties: it is correct with respect to a Structural Operational Semantics and it can be used to analyse all programs. This specification of the analysis does not immediately lend itself to an efficient algorithm for computing a solution so we proceed by developing first a syntax directed specification and then a constraint based formulation and finally we show how the constraints can be solved. We conclude by illustrating how the precision of the analysis can be improved by combining it with Data Flow Analysis and by incorporating context information thereby linking up with the development of the previous chapter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nielson, F., Nielson, H.R., Hankin, C. (1999). Constraint Based Analysis. In: Principles of Program Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03811-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-03811-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08474-4
Online ISBN: 978-3-662-03811-6
eBook Packages: Springer Book Archive