Proving partial correctness of guarded horn clauses programs

  • Masaki Murakami
Part of the Lecture Notes in Computer Science book series (LNCS, volume 315)


Guarded Horn Clauses (GHC) [Ueda 85] is a parallel programming language based on Horn logic. A verification method of partial correctness for GHC programs is discussed here. The author investigated a Hoare-like axiomatic system for proving partial correctness of GHC programs. This paper presents fragments of the axiomatic system. Programs which generate processes dynamically during the execution or which contain control of nondeterminism by the guard mechanism are verified by these systems.


Inference Rule Variable Term Axiomatic System Verification System Proof Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Clark 86]
    K. L. Clark and S. Gregory, PARLOG: Parallel programming in logic, ACM Trans. on Programming Language and Systems 86, 1986Google Scholar
  2. [Kameyama 87]
    Y. Kameyama, Axiomatic System for Concurrent Logic Programming Languages, Master's Thesis of the University of Tokyo 1987Google Scholar
  3. [Kanamori 86]
    T. Kanamori and H. Seki, Verification of Prolog Programs Using an Extension of Execution, Lecture Notes in Comp. Sci., No. 225, 1986Google Scholar
  4. [Levi 85]
    G. Levi and C. Palamidessi, The Declarative Semantics of Logical Read-only Variables, Prc. of Symp. on Logic Programming 85 1985Google Scholar
  5. [Levi 87]
    G. Levi and C. Palamidessi, An Approach to The Declarative Semantics of Synchronization in Logic Language, to appear in Proc. of International Conf. on Logic Programming 87, 1987Google Scholar
  6. [Murakami 86]
    M. Murakami and Y. Inagaki, Verification System for Partial Correctness of Communicating Sequential Processes, Systems and Computers in Japan, 1986Google Scholar
  7. [Murakami 87]
    M. Murakami, Toward Axiomatic Semantics of Guarded Horn Clauses, 2nd France-Japan Artificial Intelligence and Computer Science Symposium, 1987Google Scholar
  8. [Saraswat 85]
    V. A. Saraswat, Partial Correctness Semantics for CP [↓, ¦, &], Lecture Notes in Comp. Sci., no. 206, 1985Google Scholar
  9. [Saraswat 87]
    V. A. Saraswat, GHC: Operational Semantics, Problems, and Relationships with CP (↓, ¦), Prc. of Symp. on Logic Programming 87 1987Google Scholar
  10. [Saundararajan 84]
    N. Saundararajan, Axiomatic Semantics of Communicating Sequential Processes, ACM Trans. on Programming Languages and Systems, Vol. 6, No. 4, 1984Google Scholar
  11. [Shapiro 86]
    E. Y. Shapiro, Concurrent Prolog: A progress report, Lecture Notes in Comp. Sci. No. 232, 1986Google Scholar
  12. [Takeuchi 86]
    A. Takeuchi, Towards a Semantic Model of GHC, Tec. Rep. of IECE, COMP86-59, 1986Google Scholar
  13. [Ueda 85]
    K. Ueda, Guarded Horn Clauses, Tec. Rep. of ICOT, TR-103, 1985Google Scholar
  14. [Ueda 86]
    K. Ueda, On Operational Semantics of Guarded Horn Clauses, Tec. Memo of ICOT, TM-0160, 1986Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Masaki Murakami
    • 1
  1. 1.Institute for New Generation Computer TechnologyTokyoJapan

Personalised recommendations