Model checking linear logic specifications

Theory and Practice of Logic Programming

Volumn 4, Issue 5-6, 2004, Pages 573-619

  Bozzano, Marco ^a,b   Delzanno, Giorgio ^b   Martelli, Maurizio ^b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

Bottom up evaluation; Fixpoint semantics; Linear logic

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; ERROR ANALYSIS; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY;

BOTTOM-UP EVALUATION; FIXPOINT SEMANTICS; LINEAR LOGIC; MULTISETS;

LOGIC PROGRAMMING;

EID: 4344619068     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002066     Document Type: Conference Paper

References (56)

1. ABDULLA, P. A., CERĀNS, K., JONSSON, B. AND TSAY, Y.-K. 1996. General Decidability Theorems for Infinite-State Systems. In Proceedings 11th Annual International Symposium on Logic in Computer Science (LICS'96). IEEE Computer Society Press, New Brunswick, NJ, pp. 313-321.
2. ABDULLA, P. A. AND JONSSON, B. 2001. Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. Theoretical Computer Science 256, 1-2, 145-167.
3. ANDREOLI, J.-M. 1992. Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation 2, 3, 297-347.
4. ANDREOLI, J.-M. AND PARESCHI, R. 1990. Linear Objects: Logical Processes with Built-In Inheritance. In Proceedings 7th International Conference on Logic Programming, D. Warren and P. Szeredi, Eds. MIT Press, Cambridge, MA, pp. 495-510.
5. ANDREOLI, J.-M. AND PARESCHI, R. 1991. Linear Objects: Logical Processes with Built-In Inheritance. New Generation Computing 9, 3-4, 445-473.
6. ANDREOLI, J.-M., PARESCHI, R. AND CASTAGNETTI, T. 1997. Static Analysis of Linear Logic Programming. New Generation Computing 15, 4, 449-481.
7. BOSSI, A., GABBRIELLI, M., LEVI, G. AND MARTELLI, M. 1994. The s-Semantics Approach: Theory and Applications. Journal of Logic Programming 19-20, 149-197.
8. BOZZANO, M. 2002. A Logic-Based Approach to Model Checking of Parameterized and Infinite-State Systems. PhD thesis, Università di Genova.
9. BOZZANO, M. AND DELZANNO, G. 2002. Automated Protocol Verification in Linear Logic. In Proceedings 4th International Conference on Principles and Practice of Declarative Programming (PPDP'02). ACM Press, Pittsburgh, Pennsylvania, pp. 38-49.
10. BOZZANO, M., DELZANNO, G. AND MARTELLI, M. 2001. An Effective Bottom-Up Semantics for First Order Linear Logic Programs. In Proceedings 5th International Symposium on Functional and Logic Programming (FLOPS'01), H. Kuchen and K. Ueda, Eds. LNCS, vol. 2024. Springer-Verlag, Tokyo, Japan, pp. 138-152.
11. BOZZANO, M., DELZANNO, G. AND MARTELLI, M. 2002. An Effective Fixpoint Semantics for Linear Logic Programs. Theory and Practice of Logic Programming 2, 1, 85-122.
12. BOZZANO, M., DELZANNO, G. AND MARTELLI, M. 2003. Model Checking Linear Logic Specifications. Extended version of the present paper with all the proofs. Available in the Computing Research Repository (CoRR), http://xxx.lanl.gov/ archive/cs/intro.html, paper cs.PL/0309003.
13. CERVESATO, I. 1994. Petri Nets as Multiset Rewriting Systems in a Linear Framework. Unpublished manuscript. Draft available from URL http://theory. stanford.edu/~iliano/forthcoming.html.
14. CERVESATO, I. 1995. Petri Nets and Linear Logic: a Case Study for Logic Programming. In Proceedings 1995 Joint Conference on Declarative Programming (GULP-PRODE'95), M. Alpuente and M. I. Sessa, Ed. Palladio Press, Marina di Vietri, Italy, pp. 313-318.
15. CERVESATO, I., DURGIN, N., KANOVICH, M. AND SCEDROV, A. 2000. Interpreting Strands in Linear Logic. In Proceedings 2000 Workshop on Formal Methods and Computer Security (FMCS'00), H. Veith, N. Heintze, and E. Clarke, Eds. Chicago, IL.
16. CERVESATO, I., DURGIN, N., LINCOLN, P., MITCHELL, J. AND SCEDROV, A. 1999. A Meta-notation for Protocol Analysis. In 12th Computer Security Foundations Workshop (CSFW'99), R. Gorrieri, Ed. IEEE Press, Mordano, Italy, pp. 55-69.
17. CERVESATO, I. AND PFENNING, F. 2002. A Linear Logical Framework. Information and Computation 179, 1, 19-75.
18. DELZANNO, G. AND MARTELLI, M. 2001. Proofs as Computations in Linear Logic. Theoretical Computer Science 258, 1-2, 269-297.
19. DICKSON, L. E. 1913. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors. American Journal of Mathematics 35, 413-422.
20. DURGIN, N., LINCOLN, P., MITCHELL, J. AND SCEDROV, A. 1999. Undecidability of bounded security protocols. In Workshop on Formal Methods and Security Protocols (FMSP'99), R. Gorrieri, Ed. Trento, Italy.
21. EDER, E. 1985. Properties of Substitutions and Unifications. Journal of Symbolic Computation 1, 31-46.
22. ELLIOTT, C. AND PFENNING, F. 1991. A Semi-Functional Implementation of a Higher-Order Logic Programming Language. In Topics in Advanced Language Implementation, P. Lee, Ed. MIT Press, pp. 289-325.
23. ENGBERG, U. AND WINSKEL, G. 1990. Petri nets as models of linear logic. In Proceedings Colloquium on Trees in Algebra and Programming, A. Arnold, Ed. LNCS, vol. 389. Springer-Verlag, Copenhagen, Denmark, pp. 147-161.
24. ESPARZA, J., FINKEL, A. AND MAYR, R. 1999. On the Verification of Broadcast Protocols. In Proceedings 14th International Symposium on Logic in Computer Science (LICS'99). IEEE Computer Society Press, Trento, Italy, pp. 352-359.
25. ESPARZA, J. AND MELZER, S. 2000. Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design 16, 159-189.
26. FALASCHI, M., LEVI, G., MARTELLI, M. AND PALAMIDESSI, C. 1993. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation 103, 1, 86-113.
27. FARWER, B. 1999, A Linear Logic View of Object Petri Nets. Fundamenta Informaticae 37, 3, 225-246.
28. FARWER, B. 2000. Linear Logic Based Calculi for Object Petri Nets. Logos Verlag. PhD thesis.
29. FINKEL, A. 1993. The minimal coverability graph for petri nets. In Advances in Petri Nets 1993, G. Rozenberg, Ed. LNCS, vol. 674. Springer Verlag, pp. 210-243.
30. FINKEL, A. AND SCHNOEBELEN, P. 2001. Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256, 1-2, 63-92.
31. GABBRIELLI, M., DORE, M. G. AND LEVI, G. 1995. Observable semantics for Constraint Logic Programs. Journal of Logic and Computation 5, 2, 133-171.
32. GIRARD, J.-Y. 1987. Linear logic. Theoretical Computer Science 50:1, 1-102.
33. HARLAND, J. AND WINIKOFF, M. 1998. Making Logic Programs Reactive. In Proceedings Workshop on Transactions and Change in Logic Databases (Dynamics'98). Manchester, UK, pp. 43-58.
34. HIGMAN, G. 1952. Ordering by divisibility in abstract algebras. Proceedings London Mathematical Society 2, 326-336.
35. HODAS, J. AND MILLER, D. 1990. Representing Objects in a Logic Programming Language with Scoping Constructs. In Proceedins 7th International Conference on Logic Programming, D. H. Warren and P. Szeredi, Eds. The MIT Press, Cambridge, MA, pp. 511-526.
36. JENSEN, K. 1997. Coloured Petri-Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1, 2 and 3. Monographs in Theoretical Computer Science. Springer-Verlag.
37. KARP, R. M. AND MILLER, R. E. 1969. Parallel Program Schemata. Journal of Computer and System Sciences 3, 2, 147-195.
38. KOBAYASHI, N. AND YONEZAWA, A. 1994. Type-Theoretic Foundations for Concurrent Object-Oriented Programming. In Proceedings 9th Conference on Object Oriented Programming Systems, Languages and Applications (OOPSLA'94). SIGPLAN Notices, vol. 29. Portland, Oregon, pp. 31-45.
39. KOBAYASHI, N. AND YONEZAWA, A. 1995. Asynchronous Communication Model based on Linear Logic. Formal Aspects of Computing 7, 2, 113-149.
40. KOPYLOV, A. P. 1995. Decidability of Linear Affine Logic. In Proceedings 10th Annual International Symposium on Logic in Computer Science (LICS'95), D. Kozen, Ed. IEEE Press, San Diego, California, pp. 496-504.
41. LASSEZ, J.-L., MAHER, J. AND MARRIOTT, K. 1988. Unification Revisited. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, pp. 587-625.
42. LINCOLN, P. 1995. Deciding provability of linear logic formulas. In Advances in Linear Logic. London Mathematical Society Lecture Notes Series, vol. 222. Cambridge University Press.
43. LINCOLN, P., MITCHELL, J., SCEDROV, A. AND SHANKAR, N. 1992. Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56, 239-311. (Also in the Proceedings of the 31th Annual Symposium on Foundations of Computer Science, St Louis, Missouri, October 1990, IEEE Computer Society Press. Also available as Technical Report SRI-CSL-90-08 from SRI International, Computer Science Laboratory.)
44. LINCOLN, P., MITCHELL, J., SCEDROV, A. AND SHANKAR, N. 1992. Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56, 239-311. (Also in the Proceedings of the 31th Annual Symposium on Foundations of Computer Science, St Louis, Missouri, October 1990, IEEE Computer Society Press. Also available as Technical Report SRI-CSL-90-08 from SRI International, Computer Science Laboratory.)
45. LINCOLN, P., MITCHELL, J., SCEDROV, A. AND SHANKAR, N. 1992. Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56, 239-311. (Also in the Proceedings of the 31th Annual Symposium on Foundations of Computer Science, St Louis, Missouri, October 1990, IEEE Computer Society Press. Also available as Technical Report SRI-CSL-90-08 from SRI International, Computer Science Laboratory.)
46. LINCOLN, P. AND SCEDROV, A. 1994. First Order Linear Logic Without Modalities is NEXPTIME-Hard. Theoretical Computer Science 135, 139-154.
47. MARTÍ-OLIET, N. AND MESEGUER, J. 1991. From Petri Nets to Linear Logic through Categories: A Survey. International Journal of Foundations of Computer Science 2, 4, 297-399.
48. MAYR, E. W. 1984. An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13, 441-460.
49. MCDOWELL, R., MILLER, D. AND PALAMIDESSI, C. 1996. Encoding Transition Systems in Sequent Calculus. In Proceedings Linear Logic 96 Tokyo Meeting, J.-Y. Girard, M. Okada, and A. Scedrov, Eds. ENTCS, vol. 3. Elsevier, Keio University, Tokyo, Japan.
50. MESEGUER, J. 1992. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96, 1, 73-155.
51. MILLER, D. 1993. The π-Calculus as a Theory in Linear Logic: Preliminary Results. In Proceedings Workshop on Extensions of Logic Programming, E. Lamma and P. Mello, Eds. LNCS, vol. 660. Springer-Verlag, Bologna, Italy, pp. 242-265.
52. MILLER, D. 1996. Forum: A Multiple-Conclusion Specification Logic. Theoretical Computer Science 165, 1, 201-232.
53. MILLER, D., NADATHUR, G., PFENNING, F. AND SCEDROV, A. 1991. Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic 51, 125-157.
54. MILNER, E. C. 1985. Basic wqo- and bqo-theory. In Graphs and Orders, I. Rival, Ed. D. Reidel Publishing Company, pp. 487-502.
55. PALAMIDESSI, C. 1990. Algebraic properties of idempotent substitutions. In Proceedings 17th International Colloquium on Automata, Languages and Programming (ICALP'90), M. S. Paterson, Ed. LNCS, vol. 443, Springer Verlag, Warwick University, UK, pp. 386-399.
56. SILVA, M., TERUEL, E. AND COLOM, J. 1998. Linear Algebraic and Linear Programming Techniques for the Analysis of Place/Transition Net Systems. In Lectures in Petri Nets. I: Basic Models, G. Rozenberg and W. Reisig, Eds. LNCS, vol. 1491. Springer-Verlag, pp. 309-373.