Proving partial correctness of guarded horn clauses programs

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

Abstract

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.

Original languageEnglish
Title of host publicationLogic Programming 1987 - Proceedings of the 6th Conference
EditorsHozumi Tanaka, Koichi Furukawa, Tetsunosuke Fujisaki
PublisherSpringer Verlag
Pages215-235
Number of pages21
ISBN (Print)9783540194262
DOIs
Publication statusPublished - 1988
Externally publishedYes
Event6th Conference on Logic Programming, 1987 - Tokyo, Japan
Duration: Jun 22 1987Jun 24 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume315 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th Conference on Logic Programming, 1987
Country/TerritoryJapan
CityTokyo
Period6/22/876/24/87

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Proving partial correctness of guarded horn clauses programs'. Together they form a unique fingerprint.

Cite this