A relational framework for abstract interpretation-Reference-Cited by-同舟云学术

A relational framework for abstract interpretation

Published:1986 Issue: Volume: Page:156-171
ISSN:0302-9743
Container-title:Programs as Data Objects
language:
Short-container-title:

Author:

Mycroft Alan,Jones Neil D.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-16446-4_9

Reference19 articles.

1. Abramsky, S. Strictness analysis based on logical relations. Unpublished manuscript, 1985.

2. Burn, G., Hankin, C. and Abramsky, S. The theory and practice of strictness analysis for higher order functions. Imperial college report DoC 85/6, 1985. To appear in Science of Computer Programming.

3. Cousot, P. and Cousot, R. Abstract interpretation: a unified lattice model for static analysis of programs by construction and approximation of fixpoints. Proc. ACM symp. on Principles of Programming Languages, 1977.

4. Damas, L. and Milner, R. Principal type schemes for functional programs. Proc. ACM symp. on Principles of Programming Languages, 1980.

5. Donzeau-Gouge, V. Utilisation de la sémantique dénotationelle pour l'étude d'interprétations non-standard. INRIA rapport 273, 1978.

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

1. Verification of high-level transformations with inductive refinement types;ACM SIGPLAN Notices;2020-04-07

2. Verification of high-level transformations with inductive refinement types;Proceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences;2018-11-05

3. A new abstraction framework for affine transformers;Formal Methods in System Design;2018-10-18

4. Sound Bit-Precise Numerical Domains;Lecture Notes in Computer Science;2017

5. Automating Abstract Interpretation;Lecture Notes in Computer Science;2015-12-25