Xref: utzoo ont.events:1347 uw.talks:50 uw.cs.grad:51
Path: utzoo!attcan!utgpu!watmath!watdragon!ylkingsbury
From: ylkingsbury@watdragon.waterloo.edu (Yvonne Kingsbury)
Newsgroups: ont.events,uw.talks,uw.cs.grad
Subject: ICR Colloquium
Keywords: programming
Message-ID: <17376@watdragon.waterloo.edu>
Date: 19 Oct 89 16:48:18 GMT
Distribution: ont
Organization: U of Waterloo, Ontario
Lines: 24

ICR Colloquium

A Practical Theory of Programming

Dr. Eric C.R. Hehner
Department of Computer Science
University of Toronto

Date: Wednesday, October 25, 1989
Time: 3:30 p.m.
Place: Davis Centre Room 1302

ABSTRACT

The logic of programs that we present is both simpler and more general than its
competitors.  In place of a pair of predicates (precondition and post-condition)
as in Hoare Logic, or a function from predicates to predicates as in Dijkstra's
predicate transformers, we offer a single predicate to serve as specification
and as semantics.  We do note require a Kleene squence or a least-fixed-point
construction or any induction that is specific to programs or computation.  We
include time complexity.  The logic covers sequential and parallel programming
communcating processes and nonterminating computations.

Everyone welcome.  Refreshments served.