A Calculational Approach to Control-Flow Analysis by Abstract Interpretation-Reference-Cited by-同舟云学术

A Calculational Approach to Control-Flow Analysis by Abstract Interpretation

Published: Issue: Volume: Page:347-362
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Midtgaard Jan,Jensen Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-69166-2_23.pdf

Reference32 articles.

1. Appel, A.W.: Compiling with Continuations. Cambridge University Press, New York (1992)

2. Ayers, A.E.: Abstract Analysis and Optimization of Scheme. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (September 1993)

3. Biswas, S.K.: A demand-driven set-based analysis. In: Jones (ed.) [17], pp. 372–385.

4. Bondorf, A.: Automatic autoprojection of higher-order recursive equations. Science of Computer Programming 17(1-3), 3–34 (1991)

5. Cousot, P.: Semantic foundations of program analysis. In: Muchnick, Jones (eds.) [24], ch. 10, pp. 303–342.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Detection of Uncaught Exceptions in Functional Programs by Abstract Interpretation;Lecture Notes in Computer Science;2024

2. Automatically deriving control-flow graph generators from operational semantics;Proceedings of the ACM on Programming Languages;2022-08-29

3. Zero Knowledge Static Program Analysis;Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security;2021-11-12

4. Trace-based control-flow analysis;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18

5. Stable relations and abstract interpretation of higher-order programs;Proceedings of the ACM on Programming Languages;2020-08-02