ARGUS/V: A SYSTEM FOR VERIFICATION OF PROLOG PROGRAMS.

Tadashi Kanamori, Hiroshi Fujita, Hirohisa Seki, Kenji Horiuchi, Machi Maeji

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The verification system Argus/V for proving properties of Prolog programs is outlined by contrasting verification with testing in logic programming. Specifications in Argus/V are given by a class of first-order formulas, including goals for normal execution. The specification states a partial property of the program that states what the program does as a whole. Though verification in Argus/V does not guarantee the correctness of the program at one stroke, the more properties of the program proved the closer the program is to what the authors intend. Verification in Argus/V is done using inference rules. Execution in Prolog, on which testing is based, is a special case of the inferences in the verification.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
EditorsHarold S. Stone
PublisherIEEE
Pages994-999
Number of pages6
ISBN (Print)0818607432
Publication statusPublished - Dec 1 1986
Externally publishedYes

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Kanamori, T., Fujita, H., Seki, H., Horiuchi, K., & Maeji, M. (1986). ARGUS/V: A SYSTEM FOR VERIFICATION OF PROLOG PROGRAMS. In H. S. Stone (Ed.), Unknown Host Publication Title (pp. 994-999). IEEE.