Abstract
Using logics to express program properties, and deduction systems for proving properties of programs, gives a very elegant way of defining program analysis techniques. This paper addresses a shortcoming of previous work in the area by establishing a more general framework for such logics, as is commonly done for progam analysis using abstract interpretation. Moreover, there are natural extensions of this work which deal with polymorphic languages.
This research was partially funded by ESPRIT BRA 3124 (Semantique) and SERC grant GR/H 17381 (“Using the Evaluation Transformer Model to make Lazy Functional Languages more Efficient”).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Strictness analysis and polymorphic invariance. In H. Ganzinger and N.D. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, number 217 in LNCS, pages 1–23. Springer-Verlag, 17–19 October 1985.
S. Abramsky and T.P. Jensen. A relational approach to strictness analysis for higher-order functions. In Proceedings of the Symposium on Principles of Programming Languages, pages 49–54, Orlando, Florida, 21–23 January 1991.
P.N. Benton. Strictness logic and polymorphic invariance. In A. Nerode and M. Taitslin, editors, Proceedings of the International Symposium on Logical Foundations of Computer Science, pages 3344, Tver, Russia, 20–24 July 1992. Springer-Verlag LNCS620.
G.L. Burn, C.L. Hankin, and S. Abramsky. Strictness analysis of higher-order functions. Science of Computer Programming, 7: 249–278, November 1986.
G.L. Burn. Properties of progam analysis techniques. Technical Report DOC92/19, Imperial College of Science, Technology and Medicine, Department of Computing, June 1992. Submitted to ACM TOPLAS.
L.S. Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. PhD thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London, 1991.
T.P. Jensen. Strictness analysis in logical form. In J. Hughes, editor, Proceedings of the Conference on Functional Programming and Computer Architecture, pages 352–366, Cambridge, Massachussets, USA, 26–28 August 1991. Springer-Verlag LNCS523.
T.P.Jensen. Disjunctive strictness analysis. In Proceedings of the 7th Symposium on Logic In Computer Science,pages 174–185, Santa Cruz, California, 22–25 June 1992. Computer Society Press of the IEEE.
S. Kamin. Head-strictness is not a monotonic abstract property. Information Processing Letters, 1991. To appear.
Tsung-Min Kuo and P. Mishra. Strictness analysis: a new perspective based on type inference. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 260–272, London, 11–13 September 1989. ACM.
P.L. Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In S. Abramsky and C.L. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 12, pages 266–275. Ellis Horwood Ltd., Chichester, West Sussex, England, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Burn, G. (1993). A Logical Framework for Program Analysis. In: Launchbury, J., Sansom, P. (eds) Functional Programming, Glasgow 1992. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3215-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3215-8_3
Publisher Name: Springer, London
Print ISBN: 978-3-540-19820-8
Online ISBN: 978-1-4471-3215-8
eBook Packages: Springer Book Archive