메뉴 건너뛰기
Information Processing Letters
Volumn 67, Issue 3, 1998, Pages 145-150
Weakest preconditions for pure Prolog programs
Author keywords

Hoare's logic; Logic programming; Program correctness; Prolog; Weakest liberal preconditions; Weakest preconditions
Indexed keywords

EID: 0043265803     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00098-2     Document Type: Article
Times cited : (5)
References (13)
  • 1
    • 84976766710 scopus 로고
    • Ten years of Hoare's logic: A survey - Part I
    • K.R. Apt, Ten years of Hoare's logic: a survey - Part I, ACM Trans. Program. Languages Systems 3 (4) (1981) 431-483.
    • (1981) ACM Trans. Program. Languages Systems , vol.3 , Issue.4 , pp. 431-483
    • Apt, K.R.1
  • 3
    • 84868698136 scopus 로고
    • Verifying correctness of logic programs
    • J. Diaz, F. Orejas (Eds.), TAPSOFT '89, Springer, Berlin
    • A. Bossi, N. Cocco, Verifying correctness of logic programs, in: J. Diaz, F. Orejas (Eds.), TAPSOFT '89, Lecture Notes in Computer Science, Vol. 352, Springer, Berlin, 1989, pp. 96-110.
    • (1989) Lecture Notes in Computer Science , vol.352 , pp. 96-110
    • Bossi, A.1    Cocco, N.2
  • 4
    • 0026301946 scopus 로고
    • Proving correctness of logic programs using axiomatic semantics
    • MIT Press, Cambridge, MA
    • L. Colussi, E. Marchiori, Proving correctness of logic programs using axiomatic semantics, in: Proc. Eight Internat. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 629-644.
    • (1991) Proc. Eight Internat. Conf. on Logic Programming , pp. 629-644
    • Colussi, L.1    Marchiori, E.2
  • 5
    • 0027659678 scopus 로고
    • Proof methods of declarative properties of definite programs
    • P. Deransart, Proof methods of declarative properties of definite programs, Theoret. Comput. Sci. 118 (1993) 99-166.
    • (1993) Theoret. Comput. Sci. , vol.118 , pp. 99-166
    • Deransart, P.1
  • 6
    • 0016543936 scopus 로고
    • Guarded commands, nondeterminancy and formal derivation of programs
    • E.W. Dijkstra, Guarded commands, nondeterminancy and formal derivation of programs, Comm. ACM 18 (8) (1975) 453-457.
    • (1975) Comm. ACM , vol.18 , Issue.8 , pp. 453-457
    • Dijkstra, E.W.1
  • 8
    • 0024035296 scopus 로고
    • Inductive assertion method for logic programs
    • W. Drabent, J. Maluszynski, Inductive assertion method for logic programs, Theoret. Comput. Sci. 59 (1) (1988) 133-155.
    • (1988) Theoret. Comput. Sci. , vol.59 , Issue.1 , pp. 133-155
    • Drabent, W.1    Maluszynski, J.2
  • 10
    • 0043176770 scopus 로고    scopus 로고
    • Technical Report 97-05, Dipartimento di Informatica, Università di Pisa
    • D. Pedreschi, S. Ruggieri, Verification of logic programs, Technical Report 97-05, Dipartimento di Informatica, Università di Pisa, 1997; also: J. Logic Programming, to appear.
    • (1997) Verification of Logic Programs
    • Pedreschi, D.1    Ruggieri, S.2
  • 11
    • 0042174517 scopus 로고    scopus 로고
    • to appear
    • D. Pedreschi, S. Ruggieri, Verification of logic programs, Technical Report 97-05, Dipartimento di Informatica, Università di Pisa, 1997; also: J. Logic Programming, to appear.
    • J. Logic Programming
  • 12
    • 0042675691 scopus 로고    scopus 로고
    • Verification of metainterpreters
    • D. Pedreschi, S. Ruggieri, Verification of metainterpreters, J. Logic Comput. 7 (2) (1997) 267-303.
    • (1997) J. Logic Comput. , vol.7 , Issue.2 , pp. 267-303
    • Pedreschi, D.1    Ruggieri, S.2
  • 13
    • 84972541021 scopus 로고
    • A lattice-theoretical fixpoint theorem and its applications
    • A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
    • (1955) Pacific J. Math. , vol.5 , pp. 285-309
    • Tarski, A.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.