Fixpoint Analysis of Type and Alias in AKL Programs
Thomas Sjöland, Dan Sahlin · 1995
We defined and implemented a method for analysis of the CCP language AKL in the spirit of abstract interpretation that uses a static set of semantic equations which abstracts the concurrent execution of an AKL program. The method strictly separates the setting up of the equation system from the solving of the system with a fixpoint procedure. The computation strategies used, results for a number of test programs and the conclusions we draw from this experimental effort are reported. This report, together with the software implementing the system described herein, is deliverable number D.WP.1.6.1.M2 in the ESPRIT project ParForce 6707. Some of the work concerns WP.2.1.3. 2 1. Introduction Analysis of logic programs using abstract interpretation has been treated by many authors, e.g. [BAGILE 93, BRUYMUWIN 93, COUSOT&COUSOT 92, HANUS 92, MUTHUKUMAR & HERMENEGILDO 92, NILSSON 92]. When we started to design an analysis system for use in the concurrent langauge AKL (Agents Kernel Language...