Set-Sharing Is Not Always Redundant for Pair-Sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2998, Issue , 2004, Pages 117-131

  Bueno, Francisco ^a   Garcia De La Banda, Maria ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; ENCODING (SYMBOLS); FUNCTIONAL PROGRAMMING; RECONFIGURABLE HARDWARE;

LOGIC PROGRAMS; PROGRAM VARIABLES;

LOGIC PROGRAMMING;

EID: 33646045269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24754-8_10     Document Type: Article

References (27)

1. R. Bagnara, P. M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. In Static Analysis Symposium, pages 53-67. Springer-Verlag, 1997.
2. R. Bagnara, P. M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. Theoretical Computer Science, 277(1-2) :3-46, 2002.
3. M. Bruynooghe and M. Codish. Freeness, sharing, linearity and correctness -all at once. In International Workshop on Static Analysis, 1993.
4. F. Bueno, M. Garcia Banda, and M. Hermenegildo. The PLAI Abstract Interpretation System. Technical Report CLIP2/94.0, Computer Science Dept., Technical U. of Madrid (UPM), February 1994.
5. F. Bueno, M. Garcia Banda, and M. Hermenegildo. 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.
6. D. Cabeza and M. Hermenegildo. Extracting Non-strict Independent Andparallelism Using Sharing and Freeness Information. In 1994 International Static Analysis Symposium, number 864 in LNCS, pages 297-313, Namur, Belgium, September 1994. Springer-Verlag.
7. M. Codish, A. Mulkers, M. Bruynooghe, M. Garcia Banda, and M. Hermenegildo. Improving Abstract Interpretations by Combining Domains. ACM Transactions on Programming Languages and Systems, 17(1):28-44, January 1995.
8. Michael Codish, Harald Søndergaard, and Peter J. Stuckey. Sharing and groundness dependencies in logic programs. ACM Transactions on Programming Lan-guages and Systems, 21(5):948-976, 1999.
9. J. S. Conery. The And/Or Process Model for Parallel Interpretation of Logic Programs. PhD thesis, The University of California At Irvine, 1983. Technical Report 204.
10. A. Cortesi, G. Filé, and W. Winsborough. The quotient of an abstract interpretation for comparing static analyses. In GULP-PRODE'94 Joint Conference, on Declarative Programming, pages 372-397, 1994.
11. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Sixth ACM Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, 1979.
12. D. DeGroot. A Technique for Compiling Execution Graph Expressions for Restricted AND-parallelism in Logic Programs. In Int'l Supercomputing Conference, pages 80-89. Springer Verlag, 1987.
13. M. Garcia Banda, F. Bueno, and M. Hermenegildo. Towards Independent And-Parallelism in CLP. In Programming Languages: Implementation, Logics, and Programs, number 1140 in LNCS, pages 77-91. Springer-Verlag, September 1996.
14. M. Garcia Banda, M. Hermenegildo, and K. Marriott. Independence in CLP Languages. ACM Transactions on Programming Languages and Systems, 22(2):296-339, 2000.
15. M. Garcia Banda, K. Marriott, and P. Stuckey. Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling. In 1995 International Logic Programming Symposium. MIT Press, December 1995.
16. M. Hermenegildo and F. Rossi. Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 22(1):1-45, 1995.
17. D. Jacobs and A. Langen. Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. In 1989 North American Conference on Logic Programming. MIT Press, October 1989.
18. D. Jacobs and A. Langen. Static Analysis of Logic Programs for Independent And-Parallelism. Journal of Logic Programming, 13(2 and 3):291-314, July 1992.
19. A. King and P. Soper. Depth-k Sharing and Freeness. In International Conference on Logic Programming. MIT Press, June 1995.
20. Andy King, Jan-Georg Smaus, and Patricia M. Hill. Quotienting share for dependency analysis. In European Symposium on Programming, pages 59-73, 1999.
21. V. Lagoon and P. J. Stuckey. Precise pair-sharing analysis of logic programs. In ACM SIGPLAN international conference on Principles and practice of declarative programming, pages 99-108, 2002.
22. Giorgio Levi and Fausto Spoto. Non pair-sharing and freeness analysis through linear refinement. In Partial Evaluation and Semantic-Based Program Manipulation, pages 52-61, 2000.
23. A. Mulkers, W. Winsborough, and M. Bruynooghe. Analysis of Shared Data Structures for Compile-Time Garbage Collection in Logic Programs. In Seventh International Conference on Logic Programming, pages 747-762. MIT Press, June 1990.
24. K. Muthukumar, F. Bueno, M. Garcia Banda, and M. Hermenegildo. Automatic Compile-time Parallelization of Logic Programs for Restricted, Goallevel, Independent And-parallelism. Journal of Logic Programming, 38(2):165-218, February 1999.
25. K. Muthukumar and M. Hermenegildo. Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In 1991 International Conference, on Logic Programming, pages 49-63. MIT Press, June 1991.
26. D. A. Plaisted. The occur-check problem in prolog. In International Symposium on Logic Programming, pages 272-281. IEEE, 1984.
27. H. Søndergaard. An application of abstract interpretation of logic programs: occur check reduction. In European Symposium on Programming, LNCS 213, pages 327-338. Springer-Verlag, 1986.