1 / 10

Frameworks:

Frameworks:. Naomi Lindenstrauss, Yehoshua Sagiv: Automatic Termination Analysis of Logic Programs. ICLP 1997: 63-77

irish
Télécharger la présentation

Frameworks:

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Frameworks: • Naomi Lindenstrauss, Yehoshua Sagiv: Automatic Termination Analysis of Logic Programs. ICLP 1997: 63-77 • Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 117-156 (2001) • Alexander Serebrenik, Danny De Schreye: Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. LOPSTR (LNCS 2042: Selected Papers) 2000: 69-85 • Danny De Schreye, Alexander Serebrenik: Acceptability with General Orderings. Computational Logic: Logic Programming and Beyond 2002: 187-210 • Stefaan Decorte, Danny De Schreye: Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. ICLP 1997: 78-92 • Stefaan Decorte, Danny De Schreye, Henk Vandecasteele: Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. 21(6): 1137-1195 (1999) • Michael Codish, Samir Genaim: Proving Termination One Loop at a Time. WLPE 2003: 48-59 • Michael Codish, Cohavit Taboch: A Semantic Basis for the Termination Analysis of Logic Programs. J. Log. Program. 41(1): 103-123 (1999) • Michael Codish, Cohavit Taboch: A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. ALP/HOA 1997: 31-45

  2. Other LP-languages: • Sofie Verbaeten: Termination Analysis for Abductive General Logic Programs. ICLP 1999: 365-379 • Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos F. Sagonas: Termination Analysis for Tabled Logic Programming. LOPSTR 1997: 111-127 • Sofie Verbaeten, Konstantinos F. Sagonas, Danny De Schreye: Modular Termination Proofs for Prolog with Tabling. PPDP 1999: 342-359 • Sofie Verbaeten, Danny De Schreye: Termination Analysis of Tabled Logic Programs Using Mode and Type Information. Fuji International Symposium on Functional and Logic Programming 1999: 163-178 • Sofie Verbaeten, Danny De Schreye: Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. Appl. Algebra Eng. Commun. Comput. 12(1/2): 157-196 (2001) • Sofie Verbaeten, Danny De Schreye, Konstantinos F. Sagonas: Termination proofs for logic programs with tabling. ACM Trans. Comput. Log. 2(1): 57-92 (2001) • Salvatore Ruggieri: Termination of Constraint Logic Programs. ICALP 1997: 838-848 • Frédéric Mesnard, Salvatore Ruggieri: On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4(2): 1-26 (2003) • Frédéric Mesnard, Salvatore Ruggieri: On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4(2): 207-259 (2003)

  3. Types and Norms: • Jonathan C. Martin, Andy King, Paul Soper: Typed Norms for Typed Logic Programs. LOPSTR 1996: 224-238 1994 • Annalisa Bossi, Nicoletta Cocco, Massimo Fabris: Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theor. Comput. Sci. 124(2): 297-328 (1994) • Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon: Combining Norms to Prove Termination. VMCAI 2002: 126-138 • Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof: Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492 • Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey: Termination Analysis with Types Is More Accurate. ICLP 2003: 254-268 • Wim Vanhoof, Maurice Bruynooghe: When Size Does Matter. LOPSTR 2001: 129-147 • Stefaan Decorte, Danny De Schreye, Massimo Fabris: Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. ILPS 1993: 420-436 • Stefaan Decorte, Danny De Schreye: Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. IJCSLP 1998: 235-249

  4. Termination inference (and precision analysis): • Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR 2001: 685-694 • Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel: Detecting Optimal Termination Conditions of Logic Programs. SAS 2002: 509-526 • Frédéric Mesnard: Inferring Left-terminating Classes of Queries for Constraint Logic Programs. JICSLP 1996: 7-21 • Sébastien Hoarau, Frédéric Mesnard: Inferring and Compiling Termination for Constraint Logic Programs. LOPSTR 1998: 240-254 • Frédéric Mesnard, Ulrich Neumerkel: Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. SAS 2001: 93-110 • Ulrich Neumerkel, Frédéric Mesnard: Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices. PPDP 1999: 328-342

  5. Systems: • Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: TermiLog: A System for Checking Termination of Queries to Logic Programs. CAV 1997: 444-447 • Alexander Serebrenik, Danny De Schreye: Hasta-La-Vista: Termination Analyser for Logic Programs. WLPE 2003: 60-74 • Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet: cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. JFPLC 2001: 271-286 • Serge Burckel, Sébastien Hoarau, Frédéric Mesnard, Ulrich Neumerkel: cTI: Bottom-Up Termination Inference for Logic Programs. 15. WLP 2000: 123-134 • Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard: CLP(chi) for Automatically Proving Program Properties. J. Log. Program. 37(1-3): 77-93 (1998) • Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard: CLP(chi) for Proving Program Properties. Frontiers of Combining Systems (FroCos) 1996: 321-338

  6. Delays (dynamic control rules): • Andrew Heaton, Patricia M. Hill, Andy King: Analysis of Logic Programs with Delay. LOPSTR 1997: 148-167 • Jan-Georg Smaus: Termination of Logic Programs for Various Dynamic Selection Rules. ICLP 2003: 511-512 • Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus: Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. ESOP 2001: 402-416 Arithmetic: • Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Electr. Notes Theor. Comput. Sci. 30(1): (1999) • Alexander Serebrenik, Danny De Schreye: Inference of Termination Conditions for Numerical Loops in Prolog. LPAR 2001: 654-668 • Alexander Serebrenik, Danny De Schreye: On Termination of Logic Programs with Floating Point Computations. SAS 2002: 151-164

  7. Termination and Transformation: • Annalisa Bossi, Nicoletta Cocco, Sabina Rossi: Termination of Well-Typed Logic Programs. PPDP 2001: 73-81 • Annalisa Bossi, Nicoletta Cocco, Sandro Etalle: Transformation of Left Terminating Programs. LOPSTR 1999: 156-175 • Annalisa Bossi, Nicoletta Cocco: Replacement Can Preserve Termination. LOPSTR 1996: 104-129 • Annalisa Bossi, Nicoletta Cocco: Preserving Universal Termination through Unfold/Fold. ALP 1994: 269-286 Meta-program termination: • Krzysztof R. Apt, Dino Pedreschi: Reasoning about Termination of Pure Prolog Programs Inf. Comput. 106(1): 109-157 (1993) • Dino Pedreschi, Salvatore Ruggieri: Verification of Meta-Interpreters. J. Log. Comput. 7(2): 267-303 (1997) • Alexander Serebrenik, Danny De Schreye: On Termination of Meta-Programs. LPAR 2001: 517-530

  8. Termination and Semantics of LP: • Dino Pedreschi, Salvatore Ruggieri: On logic programs that always succeed. Sci. Comput. Program. 48(2-3): 163-196 (2003) • Paolo Mancarella, Dino Pedreschi, Salvatore Ruggieri: Negation as Failure through Abduction: Reasoning about Termination. Computational Logic: Logic Programming and Beyond 2002: 240-272 • Dino Pedreschi, Salvatore Ruggieri: On Logic Programs That Do Not Fail. Electr. Notes Theor. Comput. Sci. 30(1): (1999) • Dino Pedreschi, Salvatore Ruggieri: Verification of Logic Programs. J. Log. Program. 39(1-3): 125-176 (1999) Interargument relations: • Danny De Schreye, Kristof Verschaetse: Deriving Linear Size Relation for Logic Programs by Abstract Interpretation. New Generation Comput. 13(2): 117-154 (1995) • Florence Benoy, Andy King: Inferring Argument Size Relationships with CLP(R). LOPSTR 1996: 204-223

  9. Control Generation: • Johathan C. Martin, Andy King: Generating Efficient, Terminating Logic Programs. TAPSOFT 1997: 273-284 • Frédéric Mesnard: Towards Automatic Control for CLP(x) Programs. LOPSTR 1995: 106-119, 1993 Abstract Interpretation: • Frédéric Mesnard: Approximations entre langages de programmation logique avec contraintes. JFPL 1993: 319-341 Modular Proofs: • Krzysztof R. Apt, Dino Pedreschi: Reasoning about Termination of Pure Prolog Programs Inf. Comput. 106(1): 109-157 (1993) • Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi: On modular termination proofs of general logic programs. TPLP 2(3): 263-291 (2002)

  10. Termination for subclasses of programs: • Jan-Georg Smaus: Proving Termination of Input-Consuming Logic Programs. ICLP 1999: 335-349 • Sandro Etalle, Annalisa Bossi, Nicoletta Cocco: Termination of Well-Moded Programs. J. Log. Program. 38(2): 243-257 (1999) Surveys: • Danny De Schreye, Stefaan Decorte: Termination of Logic Programs: The Never-Ending Story. J. Log. Program. 19/20: 199-260 (1994) • Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus: Classes of terminating logic programs. TPLP 2(3): 369-418 (2002) Other: • Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Unfolding the Mystery of Mergesort. LOPSTR 1997: 206-225 • Jan-Georg Smaus, Patricia M. Hill, Andy King: Verifying Termination and Error-Freedom of Logic Programs with block Declarations. TPLP 1(4): 447-486 (2001)

More Related