Verifying Correctness of Logic Programs
暂无分享,去创建一个
[1] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[2] Hisao Tamaki,et al. Unfold/Fold Transformation of Logic Programs , 1984, ICLP.
[3] Wlodzimierz Drabent,et al. Inductive Assertion Method for Logic Programs , 1988, Theor. Comput. Sci..
[4] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.
[5] D. Prawitz. Natural Deduction: A Proof-Theoretical Study , 1965 .
[6] Christopher John Hogger,et al. Introduction to logic programming , 1986, A.P.I.C. Studies in data processing.
[7] Hisao Tamaki,et al. Transformational Logic Program Synthesis , 1984, FGCS.
[8] Keith L. Clark,et al. A First Order Theory of Data and Programs , 1977, IFIP Congress.
[9] Annalisa Bossi,et al. A method for specializing logic programs , 1990, TOPL.
[10] Amir Pnueli,et al. Proving Termination of Prolog Programs , 1985, Logic of Programs.
[11] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[12] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.
[13] Christopher J. Hogger,et al. Derivation of Logic Programs , 1981, JACM.
[14] John P. Gallagher,et al. Transforming Logic Programs by Specialising Interpreters , 1986, ECAI.
[15] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.