Title: Abstract equation systems: description and insights
Authors: Janssens, Gerda
Bruynooghe, Maurice
Mulkers, Anne
Issue Date: Nov-1995
Publisher: Department of Computer Science, K.U.Leuven, Leuven, Belgium
Series Title: CW Reports vol:CW217 pages:31
Abstract: Abstract equation systems have been proposed as a powerful formalism to represent run time properties of values of program variables which are valuable for compiler optimisations. They are descriptions of concrete equation systems as used by the Martelli-Montanari unification algorithm. They contain definite structure information and term equality together with annotations about modes, linearity and sharing. The contribution of this paper is twofold. First, the set of abstract solved forms, ASF, is developed as an abstract domain based on the abstract equation systems formalism. The paper contains a concise description of the abstract domain which is shown to be a Galois connection. For abstracting unification, a deterministic algorithm is presented. A non-deterministic extension, allowing for more precision, is discussed. Next, the paper summarises the experimental evaluation of ASF. A parametric analysis tool has been implemented with the annotations and the maximal depth of the abstract equations as parameters. The experiments provide evidence that ASF generalises several prior analyses. Factors playing a role in the efficiency and the precision of the system are discussed for various parameter settings.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Informatics Section

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.