Inference of Termination Conditions for Numerical Loops Inference of Termination Conditions for Numerical Loops
暂无分享,去创建一个
[1] Annalisa Bossi. Logic-Based Program Synthesis and Transformation , 1999, Lecture Notes in Computer Science.
[2] Maurice Bruynooghe,et al. A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns , 1992, FGCS.
[3] Alexander Serebrenik,et al. Unfolding the Mystery of Mergesort , 1997, LOPSTR.
[4] Ivan A. Sag,et al. Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.
[5] Annalisa Bossi,et al. Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs , 1993, J. Log. Program..
[6] Alexander Serebrenik,et al. Non-tranformational termination analysis of logic programs, based on general term-orderings , 2000, LOPSTR.
[7] Nachum Dershowitz,et al. A General Framework for Automatic Termination Analysis of Logic Programs , 2000, Applicable Algebra in Engineering, Communication and Computing.
[8] Frédéric Mesnard,et al. Inferring Left-terminating Classes of Queries for Constraint Logic Programs , 1996 .
[9] Annalisa Bossi,et al. Preserving Universal Termination through Unfold/Fold , 1994, ALP.
[10] Leon Sterling,et al. The Art of Prolog , 1987, IEEE Expert.
[11] Danny De Schreye,et al. Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..
[12] Yehoshua Sagiv,et al. Automatic Termination Analysis of Logic Programs , 1997, ICLP.
[13] Danny De Schreye,et al. Constraint-based termination analysis of logic programs , 1999, TOPL.
[14] Danny De Schreye,et al. Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space , 1998, IJCSLP.
[15] Elena Marchiori,et al. On Termination of Constraint Logic Programs , 1995, CP.