Verification of Starlog Programs

John Cleary; Mark Utting

Back

Conference paper

Verification of Starlog Programs

John Cleary and Mark Utting

Proceedings of the 2nd Australasian Workshop of Computational Logic, pp.31-45

Australasian Workshop of Computational Logic, 2nd (Gold Coast, Australia)

Queensland University of Technology

2001

Abstract

Computation Theory and Mathematics

computer logic

congresses

Starlog is a purely declarative, temporal, logic programming language. It supports both bottom-up and top-down execution and is well-suited to writing reactive programs. This paper presents a simple methodology for proving Starlog programs correct with respect to predicate calculus specifications.

Details

Title: Verification of Starlog Programs
Authors: John Cleary (Author) - University of Waikato, New Zealand
Mark Utting (Author) - University of Waikato, New Zealand
Contributors: Grigoris Antoniou (Editor)
Guido Governatori (Editor)
Publication details: Proceedings of the 2nd Australasian Workshop of Computational Logic, pp.31-45
Conference details: Australasian Workshop of Computational Logic, 2nd (Gold Coast, Australia)
Publisher: Queensland University of Technology
Date published: 2001
Organisation Unit: School of Science and Engineering - Legacy; University of the Sunshine Coast, Queensland
Language: English
Record Identifier: 99449148002621
Output Type: Conference paper

Metrics

646 Record Views