Programming Research Group Technical Reports

The Programming Research Group published a series of "Technical Reports", which were intended to be a less formal medium than the Technical Monographs.

They are obtainable by contacting the Librarian. Some are also available online, as shown in the list below.

The following list contains the Technical Reports of the years 1986 to 1994 only. There is a separate list of more recent reports.

From 2001 the PRG replaced this series with a series of PRG Research Reports following the merger of the Technical Reports series with the Technical Monographs series.

1986-1989

TR-1-86
Formal methods for stepwise refinement in the Z specification language,
Mark B Josephs. 1986, 20pp.
TR-1-87
The birth of the Disputer: draft 1.0,
C Philip Winder. September 1987, 12pp.
TR-2-87
Bouncing balls on the Disputer: draft 1.0,
C Philip Winder. October 1987, 23pp.
TR-1-88
Visual perceptual attention: towards a computational model for feature-integration theory,
C Philip Winder. 1988.
TR-1-89
Z in the development process: proceedings of a workshop held in Oxford, 15-Dec-1988,
edited by John Nicholls. June 1989, 54pp.
TR-2-89
On higher order operating systems,
Peter T Breuer. December 1989, 42pp.
TR-3-89
Iterated function systems and tiling structures: an introduction,
Alistair N Horn. November 1989, 24pp.
TR-4-89
Deriving the fast Fourier algorithm by calculation,
Geraint Jones. October 1989, 23pp.
TR-5-89
User interface languages: a survey of existing methods,
G Abowd, J Bowen, A Dix, M Harrison, and R Took. October 1989, 65pp.
TR-6-89
A theory of asynchronous processes,
Mark B Josephs, C A R Hoare, He Jifeng. 1989, 26pp.
TR-7-89
A single complete rule for data refinement,
P H B Gardiner, Carroll Morgan. November 1989, 13pp.

1990

TR-1-90
Spatial scale and perceptual grouping in human visual attention,
C Philip Winder. September 1989, 52pp.
TR-2-90
Making things happen in Timed CSP,
Jim Davies, Dave Jackson, Steve Schneider. 1990, 25pp.
TR-3-90
Waiting for Timed CSP,
Jim Davies, Steve Schneider. July 1990, 49pp.
TR-4-90
An extended syntax for Timed CSP,
Jim Davies, Steve Schneider. July 1990, 38pp.
TR-5-90
Specifying timed communicating sequential processes using temporal logic,
D M Jackson. June 1990, 40pp.
TR-6-90
Refinement algebra proves correctness of compiling specifications,
C A R Hoare. 1990, 17pp.
TR-7-90
A refinement calculus case study,
Steve King. 1990, 34pp.
TR-8-90
Shallow circuits for the counting functions,
Andrew Chin. 1990, 6pp.
TR-9-90
General purpose parallel computers: algorithms and complexity,
Andrew Chin. 1990, 26pp.
TR-10-90
Designing circuits by calculation,
Geraint Jones. April 1990, 92pp.
TR-11-90
Computing with lattices: an application of type classes,
Mark P Jones. 1990, 34pp.
TR-12-90
The aliens' guide to Oxford,
Jonathan Bowen and Peter Breuer. 1990, 27pp.
TR-13-90
Relations and refinement in circuit design,
Geraint Jones and Mary Sheeran. 1990, 20pp.
TR-14-90
The study of butterflies,
Geraint Jones and Mary Sheeran. 1990, 15pp.
TR-15-90
The specification of aircraft engine control software using Timed CSP,
D M Jackson. 1990, 49pp.
TR-16-90
A CSP toy interpreter,
A S Jeffery. August 1990, 34pp.
TR-17-90
Rewriting, and equational unification: the higher-order cases,
D A Wolfram. September 1990.
Withdrawn - superseded by The Clausal Theory of Types, D A Wolfram, Cambridge Tracts in Theoretical Computer Science 21, Cambridge, 1993.
TR-18-90
Categories, relations and dynamic programming,
Oege de Moor. September 1990, 157pp.
Withdrawn - published as PRG-98.
TR-19-90
A specification of a telephone exchange in Timed CSP,
Andrew Kay and J N Reed. October 1990, 21pp.
TR-20-90
A comparative study of theorem provers: proving correctness of compiling specifications,
Augusto Sampaio. 1990, 50pp.
TR-21-90
Latency hiding for fault-tolerant PRAM computations,
Andrew Chin. 1990, 17pp.
TR-22-90
The semantics of lambda Prolog,
D A Wolfram. January 1991.
Withdrawn - superseded by TR-8-92.

1991

TR-1-91
An operational semantics for Timed CSP,
S A Schneider. February 1991, 42pp.
TR-2-91
A temporal logic proof system for Timed CSP,
D M Jackson. 1991, 36pp.
TR-3-91
Deriving bit-serial circuits in Ruby,
Geraint Jones and Mary Sheeran (Univ. Glasgow). February 1991, 10pp.
TR-4-91
A survey of Z courses in the UK,
John Nicholls. March 1991, 8pp.
TR-5-91
Selected Z bibliography,
Jonathan Bowen. April 1991, 22pp.
Superseded - see TR-8-94.
TR-6-91
Towards a theory of qualified types,
Mark P Jones. April 1991, 26pp.
TR-7-91
Sequential buffer refinement,
Andrew Kay and Peter Lupton. May 1991, 6pp.
Withdrawn - published in Formal Aspects of Computing 4 (5), 1992, 487-492.
TR-8-91
Permutations on the block PRAM,
Andrew Chin. February 1991, 8pp.
TR-9-91
Locality-preserving hash functions for general purpose parallel computation,
Andrew Chin. February 1991, 19pp.
TR-10-91
Type inference for qualified types,
Mark P Jones. 1991,
TR-11-91
Using Rely and Guarantee in TCSP: a specification and design of a telephone exchange,
A Kay and J N Reed. June 1991, 33pp.
TR-12-91
Getting your wires crossed,
Geraint Jones. 1991, 16pp.
TR-13-91
An analysis/synthesis language with learning strategies,
Peter T Breuer. July 1991, 21pp.
TR-14-91
A software maintenance management model based on queueing networks,
Giorgos Papapanagiotakis and Peter Breuer. July 1991, 19pp.
TR-15-91
Understanding programs through formal methods,
Peter T Breuer, Kevin Lano and Jonathan Bowen. May 1991, 17pp.
TR-16-91
Reverse engineering COBOL via formal methods,
K Lano, P Breuer, H Haughton and J Estdale. May 1991, 23pp.
TR-17-91
Fully controlled ambiguity of some context-free grammars,
Mikkel Thorup. 1991, 55pp.
TR-18-91
Algebraic verification of speed-independent circuits,
Mark B Josephs. February 1991, 9pp.
TR-19-91
Specifying reactive systems in Z,
Mark B Josephs. July 1991, 9pp.
TR-20-91
Entity-relationship models expressed in Z: a synthesis of structured and formal methods,
Mark B Josephs and David Redmond-Pyle. July 1991, 15pp.
TR-21-91
A Library of Z schemas for use in entity-relationship modelling,
Mark B Josephs, David Redmond-Pyle. August 1991, 6pp.
TR-22-91
Using object-oriented extensions of Z for maintenance and reverse-engineering,
Kevin Lano, Howard Laughton, Peter Breuer. 1991, 78pp.
TR-23-91
The REDO project: final report,
Jonathan P Bowen, Peter T Breuer, Kevin C Lano. 1991, 45pp.
TR-24-91
Prioritized and probabilistic models of Timed CSP,
Gavin Lowe. 1991, 50pp.
TR-25-91
Two examples in OOZE,
Antonio Alencar and Joseph Goguen. 1991, 21pp.

1992

TR-1-92
Designing arithmetic circuits by refinement in Ruby,
G Jones and Mary Sheeran (Univ. Glasgow). January 1992, 27pp.
TR-2-92
Controlled grammatic ambiguity,
Mikkel Thorup. 1992, 41pp.
TR-4-92
Shortcutting planar digraphs (Draft 2.0),
Mikkel Thorup. January 1992, 18pp.
TR-5-92
Safety-critical systems, formal methods and standards,
Jonathan P Bowen and Victoria Stavridou. 1992, 36pp.
TR-7-92
OOZE with examples,
Antonio J Alencar and Joseph A Goguen. 1992, 27pp.
TR-8-92
A semantics for lambda Prolog,
D A Wolfram. 1992, 13pp.
Withdrawn - a version of this report has been published in Theoretical Computer Science 136 (1) pages 277-289 (1994).
TR-9-92
Some extensions to the probabilistic, biased model of Timed CSP,
Gavin Lowe. 1992, 38pp.
TR-10-92
Select Z bibliography,
Jonathan Bowen
Superseded - see TR-8-94.
TR-11-92
Decompilation: the enumeration of types and grammars,
Peter T Breuer and Jonathan P Bowen. 1992, 27pp.
TR-12-92
The Formal completeness of equational logics,
Razvan Diaconescu. 1992, 16pp.
TR-13-92
Unbounded nondeterminism in Timed CSP,
S A Schneider. June 1992, 51pp.
TR-14-92
A certain loss of identity,
Geraint Jones. 1992, 9pp.
TR-15-92
Specification and implementation of the General Purpose Macroprocessor,
Andrew J Batchelor. 1992, 36pp.
TR-16-92
The First order parchment,
Petros S Stefaneas. 1992, 11pp.
TR-17-92
Specification and proof of prioritized, Timed CSP processes,
Gavin Lowe. 1992, 49pp.
TR-18-92
Relating the Prioritized model of Timed CSP to the Timed Failures model,
Gavin Lowe. 1992, 39pp.
TR-20-92
A PREttier compiler-compiler: generating higher order parsers in C,
P T Breuer and J P Bowen. 1992, 25pp.
TR-21-92
Random allocation and massive parallelism (Draft 2.0),
Mikkel Thorup. 1992, 12pp.
TR-23-92
Specification and proof in probabilistic, prioritized, Timed CSP,
Gavin Lowe. 1992, 66pp.
TR-24-92
Ambiguity for incremental parsing and evaluation (Draft 2.0),
Mikkel Thorup. 1992, 13pp.
TR-25-92
Action systems, unbounded nondeterminism, and infinite traces,
Michael Butler and Carroll Morgan. April 1992, 10pp.
TR-28-92
Introducing FOOPS,
Lucia Rapanotti and Adolfo Socorro. 1992, 117pp.
TR-29-92
The Modal charter,
Petros S Stefaneas. 1992, 8pp.
TR-31-92
Linear-time breadth-first tree algorithms: an exercise in the arithmetic of folds and zips,
Geraint Jones and Jeremy Gibbons. 1992, 4pp.
TR-32-92
The complexity of two simple unifiability problems,
Paliath Narendran and D A Wolfram. 1992, 6pp.
Withdrawn

1993

TR-1-93
Select Z bibliography,
Jonathan Bowen. 1993, 33pp.
Superseded - see TR-8-94.
TR-2-93
Using CSP to verify a reliable network protocol,
Stephen Jarvis. 1992, 103pp.
TR-3-93
The logic of horn clauses is equational,
Razvan Diaconescu. 1993, 12pp.
TR-4-93
A model of the peripheral nervous system,
Bryan Todd. 1993, 22pp.
TR-5-93
Fixed points without completeness,
M W Mislove, A W Roscoe and S A Schneider. May 1993, 43pp.
TR-6-93
Exits in the refinement calculus,
Carroll Morgan, Steve King. 1993.
TR-7-93
Category theory for functional programming,
Mike Spivey. June 1993, 140pp.
TR-8-93
An implementation of higher-order rewriting (Extended abstract),
D A Wolfram. 1993, 4pp.
TR-9-93
The Second order parchment,
Petros S Stefaneas. 1993, 14pp.
TR-10-93
A Framework for generating compilers from natural semantics specifications,
Steve McKeever. October 1993, 35pp.
TR-11-93
Representing nondeterminism and probabilistic behaviour in reactive processes,
Gavin Lowe. 1993, 27pp.
TR-12-93
A theory of Rely and Guarantee for Timed CSP,
Andrew Kay. October 1993, 21pp.
TR-13-93
An Appraisal of INTERNIST-I,
D A Wolfram, April 1994, 31pp.
Withdrawn - a version of this report has been published in Artificial Intelligence in Medicine 7 (1995) 93-116.
TR-15-93
Using Mentor GDT designer for design, simulation and layout of circuits using custom standard cell elements,
Mick Patrick. September 1993, 13pp.
TR-16-93
The design and VLSI implementation of the variable and decision-wait asynchronous elements,
Mark Josephs, Mick Patrick. September 1993, 26pp.

1994

TR-1-94
Towards a provable correct compiler for OBJ3,
Lutz H Hamel. February 1994, 52pp.
TR-2-94
2OBJ
Andrew Stevens. 1994.
TR-3-94
A learnability model for universal representations
Stephen Muggleton and C David Page Jr. 1994, 18pp.
TR-7-94
Seven More Myths of Formal Methods,
Jonathan P Bowen and Michael G Hinchey. June 1994, 19pp.
TR-8-94
Select Z bibliography,
Jonathan Bowen. June 1994, 42pp.
TR-9-94
A Brief History of Algebra and Computing: An Eclectic Oxonian View,
Jonathan Bowen. July 1994, 11pp.
TR-10-94
Scheduling-oriented models for real-time systems
Gavin Lowe. June 1994, 22pp.
TR-11-94
Summarizing Case Histories,
Bryan Todd. 1994, 11pp.
TR-12-94
Refinement-oriented probability for CSP
Carroll Morgan, Annabelle McIver, Karen Seidel, and J W Sanders. August 1994, 47pp.
TR-13-94
Beyond first-order learning: inductive learning with higher-order logic
Stephen Muggleton and C David Page Jr. 1994.
TR-14-94
Binding time analysis for natural semantics specifications
Stephen McKeever. 1994, 17pp.
TR-15-94
Formal development of aircraft control software: a case study in the specification, design and scheduling of a real-time system
Gavin Lowe. October 1994, 16pp.
TR-16-94
An Operational Semantics for FOOPS
Paulo Borba and Joseph A Goguen. November 1994, 61pp.
TR-17-94
On Refinement and FOOPS
Paulo Borba and Joseph A Goguen. November 1994, 28pp.
TR-18-94
Program development and performance prediction on BSP machines using Opal
Simon Knee. August 1994, 68pp.