Non pair-sharing and freeness analysis through linear refinement-Reference-Cited by-同舟云学术

Non pair-sharing and freeness analysis through linear refinement

Published:1999-11 Issue:11 Volume:34 Page:52-61
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Levi Giorgio¹,Spoto Fausto¹

Affiliation:

1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italy

Abstract

Linear refinement is a technique for systematically constructing abstract domains for program analysis directly from a basic domain representing just the property of interest. This paper uses linear refinement to construct a domain for non pair-sharing and freeness analysis. The resulting domain is strictly more precise than the domain for sharing and freeness analysis defined by Jacobs and Langen. Moreover, it can be used for abstract compilation, while Jacobs and Langen's domain can only be used for abstract interpretation. We provide a representation of the domain, together with algorithms for the abstract operations.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/328691.328699

Reference21 articles.

1. R. Bagnara P. M. Hill and E. Zaffaneila . Set-Sharing is Redundant for Pair-Sharing. In P. Van Hentenryck editor Static Analysis: Proceedings of the ~th International Symposium volume 1302 of Lecture Notes in Computer Science pages 53 - 67 Paris France 1997 . Springer-Verlag Berlin.]] R. Bagnara P. M. Hill and E. Zaffaneila. Set-Sharing is Redundant for Pair-Sharing. In P. Van Hentenryck editor Static Analysis: Proceedings of the ~th International Symposium volume 1302 of Lecture Notes in Computer Science pages 53-67 Paris France 1997. Springer-Verlag Berlin.]]

2. Roberto Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis Dipartimento di informatica Universith di Pisa 1997.]] Roberto Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis Dipartimento di informatica Universith di Pisa 1997.]]

3. M. Bruynooghe and M. Codish . Freeness Sharing Linearity and Correctness- All at Once. In P. Cousot M. Falaschi G. Fil~ and A. Rauzy editors Proceedings of the third International Workshop on Static Analysis volume 724 of Lectures Notes in Computer Science pages 153 - 164 . Springer-Verlag 1993 .]] M. Bruynooghe and M. Codish. Freeness Sharing Linearity and Correctness- All at Once. In P. Cousot M. Falaschi G. Fil~ and A. Rauzy editors Proceedings of the third International Workshop on Static Analysis volume 724 of Lectures Notes in Computer Science pages 153-164. Springer-Verlag 1993.]]

4. Lecture Notes in Computer Science;Bruynooghe M.,1996

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

1. Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming;Lecture Notes in Computer Science;2010

2. Non-strict independence-based program parallelization using sharing and freeness information;Theoretical Computer Science;2009-11

3. Set-Sharing Is Not Always Redundant for Pair-Sharing;Functional and Logic Programming;2004

4. Pair-independence and freeness analysis through linear refinement;Information and Computation;2003-04