R. Giacobazzi. Abductive Analysis of Modular Logic Programs. In M. Bruynooghe, editor, Proc. of the Eleventh International Logic Programming Symposium, ILPS '94, pages 377-- 391. The MIT Press, Cambridge, Mass., 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....automatically. For example, a backward analysis of absence of run time errors or exceptions (such as the backward analysis using greatest xpoints introduced in [12] or any other ancestry analysis (e.g. to compute necessary termination conditions [12] or success conditions for logic programs [42]) can be used to automatically determine conditions on the interface which have to be assumed to ensure that the program part P i is correctly used in the whole program P [P 1 , P n ] A forward reachability analysis will provide information on what can be guaranteed on the interface of ....

R. Giacobazzi. Abductive analysis of modular logic programs. In M. Bruynooghe (ed), Proc. Int. Symp. ILPS '1994, Ithaca, 377391. MIT Press, 1994.

....we introduce a practical method for abductive analysis of modular logic programs. Termination of abductive analysis is discussed in Section 5, while applications are discussed in Section 6. Section 7 concludes. The Appendix contains proofs of related results. This paper is the extended version of [19]. 2 Preliminaries In the following we assume familiarity with the standard definitions and notation for logic programs [2] constraint logic programs [26, 21] abstract interpretation [11, 12] and lattice theory [4] 2.1 Mathematical notation Let A and B be sets. The powerset of A is denoted ....

R. Giacobazzi. Abductive Analysis of Modular Logic Programs. In M. Bruynooghe, editor, Proc. of the Eleventh International Logic Programming Symposium, ILPS '94, pages 377-- 391. The MIT Press, Cambridge, Mass., 1994.

....we introduce a practical method for abductive analysis of modular logic programs. Termination of abductive analysis is discussed in Section 5, while applications are discussed in Section 6. Section 7 concludes. The Appendix contains proofs of related results. This paper is the extended version of [18]. 2 2 Preliminaries In the following we assume familiarity with the standard definitions and notation for logic programs [2] constraint logic programs [25, 19, 20] abstract interpretation [11, 12] and lattice theory [4] 2.1 Mathematical notation Let A and B be sets. The powerset of A is ....

R. Giacobazzi. Abductive Analysis of Modular Logic Programs. In M. Bruynooghe, editor, Proc. of the Eleventh International Logic Programming Symposium, ILPS '94, pages 377--391. The MIT Press, Cambridge, Mass., 1994. URL http://www.di.unipi.it/giaco/papers.html.

....we introduce a practical method for abductive analysis of modular logic programs. Termination of abductive analysis is discussed in Section 5, while applications are discussed in Section 6. Section 7 concludes. The Appendix contains proofs of related results. This paper is the extended version of [19]. 2 Preliminaries In the following we assume familiarity with the standard definitions and notation for logic programs [2] constraint logic programs [26, 21] abstract interpretation [11, 12] and lattice theory [4] 2.1 Mathematical notation Let A and B be sets. The powerset of A is denoted by ....

R. Giacobazzi. Abductive Analysis of Modular Logic Programs. In M. Bruynooghe, editor, Proc. of the Eleventh International Logic Programming Symposium, ILPS '94, pages 377-- 391. The MIT Press, Cambridge, Mass., 1994.

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