Set-sharing is redundant for pair-sharing-Reference-Cited by-同舟云学术

Set-sharing is redundant for pair-sharing

Published:2002-04 Issue:1-2 Volume:277 Page:3-46
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bagnara Roberto,Hill Patricia M.,Zaffanella Enea

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference61 articles.

1. Two classes of Boolean functions for dependency analysis;Armstrong;Sci. Comput. Programming,1998

2. R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, Corso Italia 40, I-56125 Pisa, Italy, March 1997. Printed as Report TD-1/97.

3. Set-sharing is redundant for pair-sharing;Bagnara,1997

4. Abstracting S-semantics using a model-theoretic approach;Boulanger,1994

5. M. Bruynooghe, M. Codish, Freeness, sharing, linearity and correctness — All at once, in: P. Cousot, M. Falaschi, G. Filé, A. Rauzy (Eds.), Static Analysis, Proc. 3rd Internat. Workshop, Padova, Italy, Lecture Notes in Computer Science, Vol. 724, Springer, Berlin, 1993, pp. 153–164. An extended version is available as Technical Report CW 179, Department of Computer Science, K.U. Leuven, September 1993.

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

1. The role of linearity in sharing analysis;Mathematical Structures in Computer Science;2022-01

2. Exploiting Linearity in Sharing Analysis of Object-oriented Programs;Electronic Notes in Theoretical Computer Science;2016-04

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

4. On the interaction between sharing and linearity;Theory and Practice of Logic Programming;2009-09-24

5. Optimality in goal-dependent analysis of Sharing;Theory and Practice of Logic Programming;2009-07-31