J-M. Andreoli, T. Castagnetti and R. Pareschi. Static Analysis of Linear Logic Programming. Submitted to New Generation Computing (follow-on to a paper presented at the ILPS'93 conference, Vancouver, Canada).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....propositional proof. This is possible as an abstract interpretation of logic programs can be viewed as an abstract proof search in a sequent calculus [4] 5] Of course, it is impossible to find all unprovable sequents because the provability is undecidable in linear logic. Andreoli et al. [3] proposed a static analysis method for the classical linear logic programming language LO, but their method did not cover multiplicative connections which are important for a resource sensitive feature of linear logic. This follows from the fact that their system does not implement the lazy ....

J.-M. Andreoli, R. Pareschi, and T. Castagnetti. Static analysis of linear logic programming. In New Generation Computing,15, pages 449--481, 1997.

....evaluation of linear logic programs. The left introduction plus weakening and cut rules are used to compute the logical consequences of a given formula. Though the framework is given for a more general fragment than LO, it does not provide for an e ective procedure to evaluate programs. In [6], Andreoli, Pareschi and Castagnetti de ne an improved top down strategy for propositional LO based on the Karp Miller s covering graph of Petri Nets, i.e. a forward exploration with accelerations. The relation between Rewriting, Petri Nets and Linear Logic has been investigated in previous ....

Andreoli, J.-M., Pareschi, R., & Castagnetti, T. (1997). Static Analysis of Linear Logic Programming. New Generation Computing, 15(4), 449-481.

....abstract propositional proof. This is possible as an abstract interpretation of logic programs can be viewed as an abstract proof search in a sequent calculus [4] 5] Of course, it is impossible to find all unprovable sequents because the provability is undecidable in linear logic. Andreoli et al. [3] proposed a static analysis method for the classical linear logic programming language LO, but their method did not cover multiplicative connections which are important for a resource sensitive feature of linear logic. This follows from the fact that their system does not implement the lazy ....

J.-M. Andreoli, R. Pareschi, and T. Castagnetti. Static analysis of linear logic programming. In New Generation Computing,15, pages 449--481, 1997.

....abstract proof. This is possible as the abstract interpretation of logic programs can be viewed as an abstract proof search in a sequent calculus [9] 10] Of course, it is impossible to find all unprovable sequents because the provability of linear logic is undecidable in general. Andreoli et al. [5] proposed a static analysis method for their classical linear logic programming language LO, but their method did not cover the multiplicative conjunction, which is the most important connective to express a resource sensitive feature of linear logic. In this thesis, we propose a new static ....

....program using the analysis result takes 520 msec compared with the unoptimized program which takes 1190 msec. 47 Chapter 8 Conclusion In this thesis, we proposed a new static analysis method which is applicable for a fragment of a classical linear logic programming language. Andreoli et al. [5] proposed a static analysis method for their classical linear logic programming language LO, but their method did not cover the multiplicative conjunction. The multiplicative conjunction is analyzed on I O model, which was originally introduced by Hodas and Miller [17] 18] to reduce the ....

J.-M. Andreoli, R. Pareschi, and T. Castagnetti. Static analysis of linear logic programming. In New Generation Computing,15, pages 449--481, 1997.

....is a ground instance of a method of the program P. In the sequel, the word proof will always refer to a proof in the sequent system above (except stated otherwise) 2 Things are slightly more complex when the exponentials are involved; see [3] for details. 3 3.1. 2 Abstract Interpretation In [4], we present a static analysis scheme based on abstract interpretation and partial evaluation. An abstract interpretation function is a mapping from ground atoms into some abstract domain. An abstract interpretation function can then be extended in a natural way to all the other (ground) ....

.... itself (the detection of regularity patterns in the total evaluation tree) from the knowledge of the data it manipulates (the abstract domain) The detection of patterns of regularity in the total evaluation tree and the mechanism of approximation used to finitely encode them (detailed in [4]) rely in a crucial manner on the following property of sorts. Theorem 4 For any infinite sequence ( n ) of sorts, there exist indices p; q such that p q and p q 4 This property (which is an instance of Dickson s theorem for well ordered sets) holds only under the assumption that the ....

[Article contains additional citation context not shown here]

J-M. Andreoli, T. Castagnetti, and R. Pareschi. Static analysis of linear logic programming. New Generation Computing, 15(4):449--481, 1997.

....connection allows us to apply techniques developed in model checking for in nite state systems (e.g. 1, 9, 12, 19, 14] and abstract interpretation [11] to compute approximations of the xpoint of S 1 P . In this paper we limit ourselves to the study of the propositional case that, as shown in [6], can be viewed as the target of a possible abstract interpretation of a rst order program. To our knowledge, this is the rst attempt of de ning an e ective xpoint semantics for LO with the 1 constant. We hope that this work will help in nding new research directions (e.g. connections with ....

....steps within their bottom up evaluation scheme. The framework is given for a more general fragment than LO. However, they do not provide an e ective xpoint operator as we did in the case of LO and LO1 , and they do not discuss computability issues for the resulting derivability relation. In [6], Andreoli, Pareschi and Castagnetti present a partial evaluation scheme for propositional LO (i.e without 1) Given an initial goal G, they use a construction similar to Karp and Miller s coverability graph [22] for Petri Nets to build a nite representation of a proof tree for G. During the ....

[Article contains additional citation context not shown here]

J. M. Andreoli, R. Pareschi and T. Castagnetti. Static Analysis of Linear Logic Programming. New Generation Computing, 15(4), 1997.

.... the method of proof of our main complexity result shows that, aside from complexity bounds, decision problems that involve temporal constraints may be dealt with by running a finite proof search, with some guidance, in the available concurrent logic programming environments based on linear logic [9, 10, 24, 25, 41, 30, 31, 32, 13] or in the environments supporting multiset rewriting [17, 22] or concurrent rewriting [40, 44] either of which would in this case act as sort of model checkers. Indeed, our current work may be seen as a first step toward a larger issue of proof based state exploration in contrast to ....

....Gate(up) is provable in linear logic from the axioms U , while the formula (Tr(safe) Omega Sig(low) Omega Gate(down) Gammaffi (Tr(safe) Omega Sig(low) Omega Gate(up) is not provable in linear logic from the axioms U . That is, in the available linear logic programming environments such as [9, 10, 24, 25, 41, 30, 31, 32, 13], given U and an initial condition Tr(safe) Omega Sig(low) Omega Gate(down) the query on the goal Tr(safe) Omega Sig(raise) Omega Gate(up) will be answered positively, while the query on the goal Tr(safe) Omega Sig(low) Omega Gate(up) will be answered negatively. 2.2 Specifying Timed ....

[Article contains additional citation context not shown here]

J.-M. Andreoli, T. Castagnetti, and R. Pareschi. Static analysis of linear logic programming. New Generation Computing, 15(4), 1997.

No context found.

J-M. Andreoli, T. Castagnetti and R. Pareschi. Static Analysis of Linear Logic Programming. Submitted to New Generation Computing (follow-on to a paper presented at the ILPS'93 conference, Vancouver, Canada).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC