Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. A. Asperti and C. Laneve. Paths, computations and labels in the λ-calculus. In RTA'93, volume 690 of LNCS, pages 152–167. Springer-Verlag, 1993.
2. A. Ayers. Efficient closure analysis with reachability. In Proc. Workshop on Static Analysis (WSA), Bordeaux, France, pages 126–134, Sept. 1992.
3. N. Heintze. Control-flow analysis and type systems. In A. Mycroft, editor, Symposium on Static Analysis (SAS), volume 983 of LNCS, pages 189–206, Glasgow, 1995.
4. N. Heintze and D. McAllester. Control-flow analysis for ML in linear time. In International Conference on Functional Programming (ICFP), 1997. To appear.
5. F. Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming (SCP), 22(3):197–230, 1994.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Abstract interpretation from Büchi automata;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
2. Flow Analysis: Games and Nets;Lecture Notes in Computer Science;2002
3. Higher-order value flow graphs;Lecture Notes in Computer Science;1997