STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation
Maria Handjieva · 1996
Interpretation Maria Handjieva LIX, Ecole Polytechnique 91128 Palaiseau Cedex, France email: [email protected] Abstract. Stan is an implementation of a static analysis for CLP(R) based on abstract interpretation. The semantics of the program is achieved using unfolding operator. The abstract domain is a space of convex polyhedra. Three types of program analysis are implemented - backward, forward and combined.The results of the analysis can be used in program optimization. The implementation is complemented by a graphic user interface. 1 Theoretical basis The basis of the implementation is drawn from the following principal ideas. The CLP Scheme is a family of rule-based constraint programming languages firstly defined in [7]. The instance of this scheme we are interested in, is the CLP(R) language [8]. Stan is a CLP(R) static analyzer based on abstract interpretation [2, 3]. The core of the concrete semantics is the unfolding operator [6]. The main advantage of using thi...