Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations

Abstract We draw concrete and abstract operational semantics towards the analysis of logic programs with delay declarations. This is the basis to generalize the abstract interpreter GAIA to deal with logic programs employing dynamic scheduling. The concrete and abstract semantics are introduced explicitly and express both deadlock information and qualified answers. Sure deadlock and sure no deadlock information might be eventually inferred by the resulting analysis.

[1]  Pascal Van Hentenryck,et al.  Evaluation of the Domain Prop , 1995, J. Log. Program..

[2]  Maurizio Gabbrielli,et al.  Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators , 1997, Inf. Comput..

[3]  Mats Carlsson,et al.  SICStus Prolog User''s Manual , 1993 .

[4]  Kim Marriott,et al.  Analyzing logic programs with dynamic scheduling , 1994, POPL '94.

[5]  Agostino Cortesi,et al.  Optimal Groundness Analysis Using Propositional Logic , 1996, J. Log. Program..

[6]  Pascal Van Hentenryck,et al.  Combinations of abstract domains for logic programming: open product and generic pattern construction , 2000, Sci. Comput. Program..

[7]  Pascal Van Hentenryck,et al.  Combinations of abstract domains for logic programming , 1994, POPL '94.

[8]  Peter J. Stuckey,et al.  Efficient Analysis of Logic Programs with Dynamic Scheduling , 1995, ILPS.

[9]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[10]  Elena Marchiori,et al.  Proving Termination of Logic Programs with Delay Declarations , 1996, ILPS.

[11]  Pascal Van Hentenryck,et al.  Experimental evaluation of a generic abstract interpretation algorithm for PROLOG , 1994, TOPL.

[12]  Lee Naish,et al.  Negation and Control in Prolog , 1986, Lecture Notes in Computer Science.

[13]  Pascal Van Hentenryck,et al.  Reexecution in abstract interpretation of Prolog , 1995 .

[14]  Elena Marchiori,et al.  Termination of Logic Programs with Delay Declarations , 1999, J. Log. Program..

[15]  Krzysztof R. Apt,et al.  Verification of Logic Programs with Delay Declarations , 1995, AMAST.

[16]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[17]  Krzysztof R. Apt,et al.  From logic programming to Prolog , 1996, Prentice Hall International series in computer science.

[18]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[19]  Katherine A. Yelick,et al.  Moded type systems for logic programming , 1989, POPL '89.