Abstract
We have implemented a method for analysing programs in AKL which strictly separates the setting up of abstract semantic equations and finding a least fixpoint to these equations. We show a prototype analyser which is entirely coded in AKL.
References
R. Barbuti, R. Giacobazzi and G. Levi, A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs, Univ. of Pisa, ACM Trans. on Prog. Lang. and Sys. 15(1):133–181, 1993
M. Codish, M. Falaschi, K. Marriott and W. Winsborough, Efficient Analysis of Concurrent Constraint Logic Programs, In Proc. of ICALP'93, LNCS 700, 1993
M. Hanus, An Abstract Interpretation Algorithm for Residuating Logic Programs, In Proc. of WSA '92, Bordeaux, 1992
S. Janson and S. Haridi, Programming Paradigms of the Andorra Kernel Language, In Logic Programming: Proc. of the 1991 Int. Symp., MIT Press, 1991
D. Sahlin and T. Sjöland, Towards an Analysis Tool for AKL, deliverable no. D.WP.1.6.1.M1.1 in ESPRIT project ParForce (6707), July 1993
R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM J. Comput., Vol 1., No. 2, June 1972
V. Englebert, B. Le Charlier, D. Roland and P. Van Hentenryck, Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation, In Software Practice and Experience, Vol. 23(4), 419–459, April 1993
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sahlin, D., Sjöland, T. (1993). Demonstration: static analysis of AKL. In: Cousot, P., Falaschi, M., Filé, G., Rauzy, A. (eds) Static Analysis. WSA 1993. Lecture Notes in Computer Science, vol 724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57264-3_48
Download citation
DOI: https://doi.org/10.1007/3-540-57264-3_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57264-0
Online ISBN: 978-3-540-48027-3
eBook Packages: Springer Book Archive