3rd Refinement Workshop: Proceedings of the 3rd Refinement Workshop (organised by BCS-FACS, and Sponsored by IBM UK Laboratories, Hursley Park, and the Programming Research Group, University of Oxford) 9-11 January 1990, Hursley Park
The papers contained in this volume were presented at the 3rd Refinement Workshop which was held at IBM's Hursley Park Laboratory, from 9-11 January 1990. In January 1988, Professor John McDermid, of the University of York, organised a two-day workshop on the "Theory and Practice of Refinement." The purpose of this first workshop was to focus attention on refinement and expedite work in the area. Since then, the 2nd and 3rd Refinement Workshops have been held and the 4th Refinement Workshop is planned for January 1991. Refinement, in its most general sense, is the extraction of programs from specifications. The objective of work in the refinement area is the systematic and verified development of implementations from specifications, be they hardware or software developments.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Refinement Algebra Proves Correctness of Compiling
On the Usability of Logics Which Handle Partial Functions
6 other sections not shown
Other editions - View all
abstraction invariant algebraic algorithm Attrib available(a)(t axioa axioms behaviour binary number binn boolean calculus catalogue chooser circuit committer compiler Computer Science constraints construct constructor correctness corresponding Cover coverage data refinement datatype defined definition domain dstl element equation example executed expression Extended ML false Figure formal program development functor guard higher-order functions identifier integers interfaces IP Value ladn Lemma logic map bit matches mathematical may-do maystart method ML programming language module object code occam occam implementation occam-like operation output pair parameter partial functions patterns predicate problem programming language Programming Research Group proof obligations proof theory properties prove recursive refinement calculus relation removebookO representation semantics sender SEQDUP SEQPAIRS sequence sequential set of values sharing Id signature specification Standard ML step structure subp(i,j Syatab symbol table task theorems true tuple vals variables X.Task