Set-Sharing Is Not Always Redundant for Pair-Sharing-Reference-Cited by-同舟云学术

Set-Sharing Is Not Always Redundant for Pair-Sharing

Published:2004 Issue: Volume: Page:117-131
ISSN:0302-9743
Container-title:Functional and Logic Programming
language:
Short-container-title:

Author:

Bueno Francisco,Garcia de la Banda Maria

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24754-8_10

Reference27 articles.

1. Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. In: Static Analysis Symposium, pp. 53–67. Springer, Heidelberg (1997)

2. Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. Theoretical Computer Science 277(1-2), 3–46 (2002)

3. Bruynooghe, M., Codish, M.: Freeness, sharing, linearity and correctness — all at once. In: International Workshop on Static Analysis (1993)

4. Bueno, F., Garcia de la Banda, M., Hermenegildo, M.: The PLAI Abstract Interpretation System. Technical Report CLIP2/94.0, Computer Science Dept., Technical U. of Madrid (UPM) (February 1994)

5. Bueno, F., Garcia de la Banda, M., Hermenegildo, M.: Effectiveness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming. ACM Transactions on Programming Languages and Systems 21(2), 189–238 (1999)

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

1. Parallel Logic Programming: A Sequel;Theory and Practice of Logic Programming;2022-03-28

2. Collapsing Closures;Logic Programming;2006

3. Lazy Set-Sharing Analysis;Functional and Logic Programming;2006

4. Pair-Sharing Analysis of Object-Oriented Programs;Static Analysis;2005