A confluent semantic basis for the analysis of concurrent constraint logic programs

Journal of Logic Programming

Volumn 30, Issue 1, 1997, Pages 53-81

  Codish, Michael ^a   Falaschi, Moreno ^b   Marriott, Kim ^c   Winsborough, William ^d  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF UDINE   (Italy)

^c MONASH UNIVERSITY   (Australia)

^d The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER AIDED ANALYSIS; COMPUTER SOFTWARE; CONSTRAINT THEORY; SCHEDULING;

ABSTRACT INTERPRETATIONS; CONCURRENT CONSTRAINT LOGIC PROGRAMS; CONFLUENT SEMANTICS; PARALLELISM; PROGRAM ANALYSIS;

LOGIC PROGRAMMING;

EID: 0042234968     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00013-1     Document Type: Article

References (32)

1. Brookes, S. D. and Roscoe, A. W., Deadlock Analysis in Networks of Communicating Processes, Distributed Computing 4:209-230 (1991).
2. Chandy, K. M. and Misra, J., Deadlock Absence Proofs for Networks of Communicating Processes, Information Processing Lett. 9(4):185 (1979).
3. Codish, M., Falaschi, M., and Marriott, K., Suspension Analysis for Concurrent Logic Programs, in: K. Furukawa (ed.), Proc. 8th Int. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 331-345.
4. Codish, M., Falaschi, M., and Marriott, K., Suspension Analyses for Concurrent Logic Programs, ACM Trans. Programming Languages and Syst. 16(3):649-686 (1994).
5. Codish, M., Falaschi, M., Marriott, K., and Winsborough, W., Efficient Analysis of Concurrent Constraint Logic Programs, in: A. Lingas, R. Karlsson, and S. Carlsson (eds.), Proc. 20th Int. Colloquium on Automata, Languages, and Programming, vol. 700 of LNCS, Springer-Verlag, Berlin, 1993, pp. 633-644.
6. Codognet, C., Codognet, P., and Corsini, M., Abstract Interpretation for Concurrent Logic Languages, in: S. Debray and M. Hermenegildo (eds.), Proc. North American Conf. on Logic Programming'90, MIT Press, Cambridge, MA, 1990, pp. 215-232.
7. Codognet, C. and Codognet, P., Guarded Constructive Disjunction: Angel or Demon?, in: [20], pp. 345-361.
8. Cousot, P. and Cousot, R., Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, in: Proc. 4th ACM Symp. Principles of Programming Languages, ACM, 1977, pp. 238-252.
9. Falaschi, M., Gabbrielli, M., Marriott, K., and Palamidessi, C., Compositional Analysis for Concurrent Constraint Programming, in: Proc. 8th IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 210-221.
10. Falaschi, M., Gabbrielli, M., Marriott, K., and Palamidessi, C., Confluence and Concurrent Constraint Programming, in: V. S. Alagar and M. Nivat (eds.), Proc, 4th Int. Conf. on Algebraic Methodology and Software Technology (AMAST'95), vol. 936 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 531-545.
11. Hoare, C. A. R., Communicating Sequential Processes, Prentice-Hall, NJ, 1985.
12. Horiuchi, K., Less Abstract Semantics for Abstract Interpretation of FGHC Programs, in: Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo, Japan, 1992, pp. 897-906.
13. Janssens, G. and Bruynooghe, M., Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation, J. Logic Programming 13:205-258 (1992).
14. Lassez, J.-L. and Maher, M. J., Closures and Fairness in the Semantics of Programming Logic, Theoretical Comput. Sci. 29:167-184 (1984).
15. Lloyd, J. W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, Berlin, 1987.
16. Marriott, K., Garcia de la Banda, M., and Hermenegildo, M., Analyzing Logic Programs with Dynamic Scheduling, in: Proc. 21st ACM Symp. on Principles of Programming Languages, 1994.
17. Marriott, K. and Oderski, M., A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice, in: [20], pp. 310-327.
18. Milner, R., Communication and Concurrency, Prentice-Hall Int., UK, 1989.
19. Mishra, P., Towards a Theory of Types in Prolog, in: Int. Symp. on Logic Programming, IEEE Computer Society Press, 1984, pp. 289-298.
20. Montanari, U. and Rossi, F. (eds.), Proc. 1st Int. Conf. on Principles and Practice of Constraint Programming (CP'95), vol. 976 of Lecture Notes in Computer Science, Springer-Verlag, 1995.
21. Naish, L., Heterogeneous SLD Resolution, J. Logic Programming 1(4) (1984).
22. Peng, W. and Purushothaman, S., Data Flow Analysis of Communicating Finite State Machines, ACM Trans. Programming Languages and Syst. 13(2):399-442 (1991).
23. Saraswat, V., Rinard, M., and Panangaden, P., Semantic Foundation of Concurrent Constraint Programming, in: Proc. 18th Annu. ACM Symp. on Principles of Programming Languages, ACM, 1991.
24. Saraswat, V. A., Concurrent Constraint Programming Languages, Ph.D. Thesis, Carnegie Mellon University, Jan. 1989. Also in ACM Distinguished Dissertation Series, MIT Press, 1993.
25. Saraswat, V. A., Concurrent Constraint Programming Languages, Ph.D. Thesis, Carnegie Mellon University, Jan. 1989. Also in ACM Distinguished Dissertation Series, MIT Press, 1993.
26. Sato, T. and Tamaki, H., Enumeration of Success Patterns in Logic Programs, Theoretical Computer Science 34:227-240 (1984).
27. Shapiro, E. Y., The Family of Concurrent Logic Programming Languages, ACM Computing Surveys 21(3):412-510 (1989).
28. Van Hentenryck, P., Cortesi, A., and Le Charlier, B., Type Analysis of Prolog Using Type Graphs, in: Proc. ACM SIGPLAN'94 Conf. on Programming Language Design and Implementation, ACM, June 1994, pp. 337-348.
29. Yang, R. and Aiso, H., P-Prolog: A Parallel Language Based on Exclusive Relation, in: E. Y. Shapiro (ed.), Proc. 3rd Int. Conf on Logic Programming, vol. 225 of LNCS, Springer-Verlag, Berlin, 1986, pp. 255-269.
30. Yelick, K. and Zachary, J., Moded Type Systems for Logic Programming, in: Proc. 16th Annu. ACM Symp. on Principles of Programming Languages, ACM, 1989, pp. 116-124.
31. Zaffanella, E., Levi, G., and Giacobazzi, R., Abstracting Synchronization in Concurrent Constraint Programming, in: Proc. 5th Int. Symp. on Programming Language Implementation and Logic Programming, vol. 844 of LNCS, Springer-Verlag, Berlin, 1994, pp. 57-72.
32. Zaffanella, E., Domain Independent Ask Approximation in ccp, in: [20], pp. 362-379.