Work supported by ARPA Contract Nr. F19628-92-C-0113.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Thomas Cheatham, Haiming Gao, and Dan Stefanescu The Harvard Abstract Interpreter Technical Report, Harvard University, April 1993.
Thomas Cheatham, Jr., Amr Fahmy and Dan Stefanescu BSP-L — A Programming Language for the Bulk Synchronous Processing Model, Center for Research in Computing Technology, Harvard University, December 1993
Patrick Cousot and Radhia Couspt Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximate fixpoints, Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238–252, 1977.
Neil Jones and Alan Mycroft Data Flow Analysis of Applicative Programs Using Minimal Functions Graphs: Abridged Version, Conference Record of the Thirteenth ACM Symposium on Principles of Programming Languages, pages 296–306, 1986.
Mike Karr and Steve Rosen Dynamic Crossreference Analysis, lecture notes, 1992.
Jens Palsberg and Michael I. Schwartzbach Safety Analysis versus Type Inference, Information and Computation, to appear.
Olin Shivers Control Flow Analysis in Scheme ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta GA, June 22–24, 1988.
Olin Shivers Control-Flow Analysis of Higher Order Languages or Taming Lambda, Technical Report CMU-CS-91-145, Carnegie Mellon University, May 1991.
Peter Sestoft Replacing Function Parameters by Global Variables, FPCA'89, pages 39–53, 1989.
Dan Stefanescu and Yuli Zhou An Equational Framework for the Abstract Analysis of Functional Programs, Proceedings of ACM Conference on Lisp and Functional Programming, Orlando, 1994.
Mitchell Wand and Paul Steckler Selective and Lightweight Closure Conversion, ACM Symposium on Principles of Programming Languages, Portland, 1994.
Atty Kanamori and Daniel Weise An Empirical Study of an Abstract Interpretation of Scheme Programs Technical Report CSL-TR-92-521, Computer Systems Laboratory, Stanford University, April 1992.
Mary Hall and Ken Kennedy, Efficient Call Graph Analysis, ACM Letters on Programming Languages and Systems, Vol. 1, No. 3, Sept. 1992, pp 227–242.
L. G. Valiant A Bridging Model for Parallel Computation Communications of the ACM, 33(8):103–111, 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheatham, T., Gao, H., Stefanescu, D. (1994). A suite of analysis tools based on a general purpose abstract interpreter. In: Fritzson, P.A. (eds) Compiler Construction. CC 1994. Lecture Notes in Computer Science, vol 786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57877-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-57877-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57877-2
Online ISBN: 978-3-540-48371-7
eBook Packages: Springer Book Archive