CT-1995-03: Verification of Logic Programs with Delay Declarations

CT-1995-03: Apt, Krzysztof and Luitjes, Ingrid (1995) Verification of Logic Programs with Delay Declarations. [Report]

[img] Text (Full Text)
CT-1995-03.text.ps.gz

Download (62kB)
[img] Text (Abstract)
CT-1995-03.abstract.txt

Download (808B)

Abstract

Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors in presence of arithmetic relations, and termination. These methods turn out to be simple modifications of the corresponding methods dealing with Prolog programs. This allows us to derive correct delay declarations by analyzing Prolog programs. Finally, we point out difficulties concerning proofs of termination.

Item Type: Report
Report Nr: CT-1995-03
Series Name: Computation and Complexity Theory (CT)
Year: 1995
Date Deposited: 12 Oct 2016 14:39
Last Modified: 12 Oct 2016 14:39
URI: https://eprints.illc.uva.nl/id/eprint/1065

Actions (login required)

View Item View Item