Proof rules for Angelic choice

Article View: comp.specification

Article #144

Back to comp.specification Previous Next

#144

From: Gary Leavens
Date: Mon, 16 Jul 1990 21:42

11 lines
770 bytes

	Thanks to those who responded to my initial query on this subject.
Those who followed it may also be interested in DEC SRC research report 38,
"Can fair choice be added to Dijkstra's calculus" by Broy and Nelson
(Feb, 1989).
	Gary Leavens

--
	229 Atanasoff Hall, Department of Computer Science
	Iowa State University, Ames, Iowa 50011-1040, USA
	phone: (515) 294-1580

Technical Details

Message-ID: <2265@dino.cs.iastate.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!know!samsung!uunet!dino!leavens

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!know!samsung!uunet!dino!leavens
From: leavens@cs.iastate.edu (Gary Leavens)
Newsgroups: comp.specification
Subject: Proof rules for Angelic choice
Keywords: verification, fair choice
Message-ID: <2265@dino.cs.iastate.edu>
Date: 16 Jul 90 21:42:08 GMT
Sender: usenet@dino.cs.iastate.edu
Distribution: comp
Lines: 11