Static analysis of linear logic programming

New Generation Computing

Volumn 15, Issue 4, 1997, Pages 449-481

  Andreoli, Jean Marc ^a   Pareschi, Remo ^a   Castagnetti, Tiziana ^b  

^a XEROX RESEARCH CENTRE EUROPE   (France)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract Interpretation; Linear Logic; Partial Evaluation; Proof Search; Sequent Systems; Static Analysis

Indexed keywords

COMPUTATION THEORY; FORMAL LOGIC; LINEAR PROGRAMMING; THEOREM PROVING;

ABSTRACT INTERPRETATION; LINEAR LOGIC PROGRAMMING; PARTIAL EVALUATION; PROOF SEARCH; SEQUENT SYSTEMS; STATIC ANALYSIS;

LOGIC PROGRAMMING;

EID: 0030693545     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037301     Document Type: Article

References (50)

1. Abramsky, S., "Computational Interpretations of Linear Logic," Theoretical Computer Science, 111, 1-2, pp. 3-57, 1993.
2. Andreoli, J-M., "Logic Programming with Focusing Proofs in Linear Logic," Journal of Logic and Computation, 2, 3, 1992.
3. Andreoli, J-M., "Coordination in LO," in Coordination Programming: Mechanisms, Models and Semantics (J-M. Andreoli, C. Hankin, and D. Le Metayer, eds.), Imperial College Press, pp. 42-64, 1996.
4. Andreoli, J-M., Borghoff, U., and Pareschi, R., "Constraint Based Knowledge Brokers," in Proc. of PASCO'94, Linz, Austria, 1994.
5. Andreoli, J-M., Ciancarini, P., and Pareschi, R., "Interaction Abstract Machines," in Research Directions in Concurrent Object Orlented Programming (G. Agha, A. Yonezawa, and P. Wegner, eds.), MIT Press, Cambridge, Ma, U.S.A., pp. 257-280, 1993.
6. Andreoli, J-M, and Pareschi, R., "Logic Programming with Sequent Systems: A Linear Logic Approach," in Proc. of the Workshop on Extensions of Logic Programming, Lecture Notes in Artificial Intelligence 475, Tübingen, Germany, Springer-Verlag, 1990.
7. Andreoli, J-M, and Pareschi, R., "Communication in Fair Distribution of Knowledge," in Proc. of OOPSLA'91, Phoenix, Az, U.S.A., 1991.
8. Banätre, J-P., Coutant, A. and Le Metayer, D., "A Parallel Machine for Multiset Transformation and Its Programming Style," Future Generation Computer Systems, 4, 2, pp. 133-145, 1988.
9. Barbuti, R., Giacobazzi, R., and Levi, G., "A General Framework for Semantics Based Bottom-up Abstract Interpretation of Logic Programs," IEEE Transactions on Programming Languages and Systems, 15, 1, pp. 133-181, 1993.
10. Berry, G. and Boudol, G., "The Chemical Abstract Machine," in Proc. of the 17th ACM Symposium on Principles of Programming Languages, San Francisco, Ca, U.S. A., 1990.
11. Brownston, L., Farrell, R., Kant, E., and Martin, N., Programming Expert Systems in OPS-5, Addison-Wesley, Reading, Ma, U.S.A., 1985.
12. Bruynooghe, M., "A Practical Framework for Abstract Interpretation of Logic Programs," Journal of Logic Programming, 10, 2, pp. 91-124, 1991.
13. Carriero, N. and Gelernter, D., How to Write Parallel Programs, MIT Press, Cambridge, Ma, U.S.A., 1990.
14. Cerrito, S., "A Linear Semantics for Allowed Logic Programs," in Proc. of the 5th IEEE Symposium on Logic in Computer Science, Philadelphia, Pa, U.S.A., 1990.
15. Codish, M., Dams, D., and Yardeni, E., "Bottom-up Abstract Interpretation of Logic Programs," Theoretical Computer Science, 124, 1994.
16. Codognet, P. and Filé, G., "Computations, Abstractions and Constraints in Logic Programs," in Proc. of the 4th International Conference on Programming Languages (ICCL), Oakland, Ca, U.S.A., 1992.
17. Corsíní, M. and Filé, G., "A Complete Framework for the Abstract Interpretation of Logic Programs; Theory and Application," Technical Report, Università di Padova, Padova, Italy, 1989.
18. Cousot, P. and Cousot, R., "Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoint," in Proc. of the 4th ACM Symposium on Principles of Programming Languages, 1977.
19. Cousot, P. and Cousot, R., "Systematic Design of Program Analysis Frameworks," in Proc. of the 6th ACM Symposium on Principles of Programming Languages, 1979.
20. Cunningham, H. C. and Roman, G.-C., "A UNITY-Style Programming Logic for Shared Dataspace Programs," IEEE Transaction on Parallel and Distributed Systems, 1, 3, 1990.
21. Dalrymple, M., Hinrichs, A., Lamping, J., and Saraswat, V., "The Resource Logic of Complex Predicate Interpretation," in Proc. of the 1993 Republic of China Computational Linguistics Conference (ROCLING), Hsitou National Park, Taiwan, 1993.
22. Dalrymple, M., Lamping, J., Pereira, F.C.N., and Saraswat, V., "Linear Logic for Meaning Assembly," in Proc. of CLNLP'95, Edinburgh, U.K., 1995.
23. Debray, S., "Efficient Dataflow Analysis of Logic Programs," in Proc. of POPL'88, San Diego, Ca, U.S.A., 1988.
24. Debray, S. and Warren, D. S., "Automatic Mode Inference for Logic Programs," Journal of Logic Programming, 5, pp. 207-230, 1988.
25. Fouquere, C. and Vauzeilles, J., "Inheritance with Exception," in Advances in Linear Logic (J-Y. Girard, Y. Lafont, and L. Regnier, eds.), Cambridge University Press, Cambridge, U.K., 1995.
26. Galmiche, D. and Perrier, G., "On Proof Normalization in Linear Logic," Theoretical Computer Science, 135, pp. 67-110, 1994.
27. Gelernter, D., "Generative Communication in Linda," ACM Transactions on Programming Languages and Systems, 7, 1, pp. 80-112, 1985.
28. Gíacobaszzi, R., Debray, S., and Levi, G., "Generalized Semantics and Abstract Interpretation for Constraint Logic Programming," Technical Report, Università di Pise, Písa, Italy, 1992.
29. Gìrard, J-Y., "Linear Logic," Theoretical Computer Science, 50, pp. 1-102, 1987.
30. Harel, D., "Statecharts: A Visual Formalism for Complex Systems," Science of Computer Programming, 8, 3, 1987.
31. Harland, J. and Pym, D., "The Uniform Proof-Theoretic Foundation of Linear Logic Programming," in Proc. of the International Logic Programming Symposium, SanDiego, Ca, U.S.A., 1991.
32. Janssens, G. and Bruynooghe, M., "Towards a Framework for Abstract Interpretation of Constraint Logic Programming," in Proc. of META'92, Uppsala, Sweden, 1992.
33. Jones, N. D. and Søndergaard, H., "A Semantics-Based Framework for the Abstract Interpretation of Prolog," in Abstract interpretation of Declarative Languages (S. Abramsky and C. Hankin, eds.), Ellis Horwood, Chichester, U.K., pp. 123-142, 1987.
34. Kobayashi, N., Nakade, M., and Yonezawa, A., "Static Analysis of Communication for Asynchronous Concurrent Programming Languages," in Proc, of SAS'95, 1995.
35. Kobayashi, N. and Yonezawa, A., "Acl - A Concurrent Linear Logic Programming Paradigm," in Proc. of ILPS'93, Vancouver, B.C., Canada, 1993.
36. Kobayashi, N. and Yonezawa, A., "Asynchronous Communication Models Based on Linear Logic," Formal Aspects of Computing, 7, 2, pp. 113-149, 1995.
37. Lamport, L., "The Temporal Logic of Actions," ACM Transactions on Programming Languages and Systems. 16, 3, pp. 872-923, 1994.
38. Lincoln, P., Mitchell, J., Scedrov, A., and Shankar, N., "Decision Problems for Prepositional Linear Logic," Annals of Pure and Applied Logic, 56, pp. 239-311, 1992.
39. Manna, Z., and Pnueli, A., The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag, 1992.
40. Marriot, K. and Søndergaard, H., "Bottom-up Abstract Interpretation of Logic Programs," in Proc. of ICLP'88, Seattle, Wa, U.S.A., 1988.
41. Marriot, K. and Søndergaard, H., "Semantic Based Dataflow Analysis of Logic Programs," in Proc. of the IFIP 11th World Computer Congress, San Francisco, Ca, U. S.A, 1989.
42. Masseron, M., Tollu, C., and Vauzeille, J., "Generating Plans in Linear Logic," Theoretical Computer Science, 113, pp. 349-370, 1993.
43. Mellish, C., "Abstract Interpretation of Prolog Programs," in Abstract Interpretation of Declarative Languages (S. Abramsky and C. Hankin, eds.), Ellis Horwood, Chichester, U.K., pp. 181-198, 1987.
44. Meseguer, J., "A Logical Theory of Concurrent Objects and Its Realization in the MAUDE Language," in Research Directions in Concurrent Object Oriented Programming (G. Agha, A. Yonezawa, and P. Wegner, eds.), MIT Press, Cambridge, Ma, U.S. A., 1992.
45. Mints, G., "Resolution Calculus for First-Order Linear Logic," unpublished manuscript, 1991.
46. Oxhøj, N., Palsberg, J., and Schwartzbach, M., "Making Type Inference Practical," in Proc. of ECOOP'92, Utrecht, Netherlands, 1992.
47. Penny Nii, H., "Blackboard Systems," in The Handbook of Artificial Intelligence, vol. 4 (A. Barr, Cohen P., and Feigenbaum, E., eds.), Addison-Wesley, Reading, Ma, U.S. A., pp. 1-82, 1989.
48. Peterson, J.-L., Petri-Net Theory and the Modeling of Systems, Prentice Hall, Englewood Cliffs. NJ, U.S.A., 1981.
49. Reddy, U., "A Typed Foundation for Directional Logic Programming," in Proc. of the Workshop on the Extensions of Logic Programming, Bologna, Italy, 1992.
50. Saraswat, V. A., "Concurrent Constraint Programming Languages," Ph.D. thesis, Carnegie-Mellon University, Pittsburg, Pa, U.S.A., 1989.