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.

There is a separate list of Technical Reports printed before 1995.

This series merged with the Technical Monographs series at the start of 2001 to become the Research Reports series.

2000

TR-16-00
Out of the office into the school : electronic whiteboards for education
Christian Greiffenhagen, December 2000, 29pp.
TR-15-00
Abstracts for the PRG student conference 2000
edited by Ranko Lazic and Luke Ong, December 2000, 28pp.
TR-14-00
Factorizations of Cunningham numbers with bases 13 to 99 : millenium edition
Richard P. Brent, Peter L. Montgomery and Herman J.J. te Riele, December 2000, 509pp.
TR-13-00
A fast algorithm for testing irreducibility of trinomials mod 2
R. P. Brent, S. Larvala and P. Zimmermann, December 2000, 16pp.
TR-12-00
Tractable constraints closed under a binary operation
Andrei Bulatov and Peter Jeavons, November 2000, 27pp.
TR-11-00
Logical reversibility
Paolo Zuliani, November 2000, 25pp.
TR-10-00
A universal innocent model of the Böhm tree lambda theory
A. Ker, H. Nickau and C.-H.L. Ong, November 2000, 40pp.
TR-9-00
Towards development of secure systems using UML
Jan Jürjens, November 2000, 14pp.
TR-8-00
The weakest specifunction
Yifeng Chen and J.W. Sanders, November 2000, 41pp.
TR-7-00
On the antisymmetry of Galois embedding
J. Burghardt, F. Kammüller and J.W. Sanders, October 2000, 9pp.
TR-6-00
A calculus of signals
C. Ratzko and J.W. Sanders, October 2000, 14pp.
TR-5-00
Two papers on the foundations of computer ethics
Luciano Floridi and J.W. Sanders, September 2000, 35pp.
TR-4-00
A unifying approach to data-independence
Ranko Lazic and David Nowak, June 2000, 30pp.
TR-3-00
Recent progress and prospects for integer factorisation algorithms
Richard P. Brent, April 2000, 20pp.
TR-2-00
Public Key Cryptography with a Group of Unknown Order
Richard P. Brent, June 2000, 11 pp.
TR-1-00
IoData Types and Processes
Christie Bolton, April 2000, 142pp.

1999

TR-8-99
New Tractable Classes From Old
David Cohen, Richard Gault, and Peter Jeavons, November 1999 24pp.
TR-7-99
Further Analysis of the Binary Euclidean Algorithm
Richard P. Brent, November 1999 18pp.
TR-6-99
Learning about Actions and Change: An Inductive Logic Programming Approach
S. Moyle, September 1998, 91pp.
TR-5-99
Quantum Programming
J. W. Sanders and P. Zuliani, November 1999, 21pp.
TR-4-99
Constraint Satisfaction and Finite Algebras
Peter Jeavons, 1999, pp.
TR-2-99
Note on the location of optimal classifiers in n-dimensional ROC space
Ashwin Srinivasan, 1999
TR-1-99
TTP : a case study in combining induction and data independence
S.J. Creese and A.W. Roscoe, January 1999, 21 pp.

1998

TR-9-98
Machine Learning Changing Concepts
Rupert Parson
TR-8-98
Abstracts for the 1998 Sun PRG student conference
edited by Ranko Lazic and J.M. Spivey
TR-6-98
BSP in CSP: easy as ABC
Andrew Simpson, Jonathan M.D. Hill, and Stephen R. Donaldson
TR-5-98
A lightwieight kernel-space BSP transport protocol that enables a 100Mbps Ethernet PC cluster to out-perform an Origin ~2000 and SP2 on the NAS parallel benchmarks
Stephen R. Donaldson, Jonathan M.D. Hill, and David B. Skillicorn
TR-3-98
Network performance assessment under the BSP model
A. Gerbessiotis and F. Petrini
TR-2-98
Verifying Determinism of Concurrent Systems Which Use Unbounded Arrays
Ranko Lazic and Bill Roscoe, April 1998, 21pp.
TR-1-98
Approximating simulations
Ingrid M Rewitzky, 1998, 12pp

1997

TR-41-97
Process migration and fault tolerance of BSPlib programs running on Networks of Workstations
Jonathan Hill, Stephen Donaldson, and Tim Lanfear, 1997.
TR-40-97
Predictable Communication on Unpredictable Networks: Implementing BSP over TCP/IP
Stephen R Donaldson, Jonathan M D Hill and David B Skillicorn, November 1997, 15pp
TR-39-97
Communication Performance Optimisation Requires Minimising Variance
Stephen R Donaldson, Jonathan M D Hill and David B Skillicorn, November 1997, 9pp
TR-36-97
A BSP Scheduling Tool for Loop Nest Parallelisation
Radu Calinescu, November 1997, 30pp
TR-35-97
Partial correctness for probabilistic demonic programs
Annabelle McIver and Carroll Morgan, 1997, 23pp
TR-33-97
Stability of communication performance in practice: from the Cray T3E to Networks of Workstations
Jonathan M D Hill, Stephen R Donaldson and David B Skillicorn, October 1997 33pp
TR-32-97
Algorithmic and Practical Considerations for Dense Matrix Computations on the BSP Model
A. V. Gerbessiotis, 1997, 40pp
TR-31-97
An algorithm for the detection of peaks and troughs in Physiological signals
Bryan S Todd, September 1997, 12pp
TR-30-97
Parallel BSP Algorithm for Toeplitz Systems
Yuguang Huang, 1997, 25pp
TR-29-97
BSPlib - The BSP Programming Library
Jonathan M. D. Hill and Bill McColl, May 97, 18pp
TR-26-97
A Scheme for the BSP Scheduling of Generic Loop Nests
Radu Calinescu, August 1997, 26pp
TR-23-97
Experiments in learning event calculus programs
Stephen Moyle and Stephen Muggleton, 1997, 19pp
TR-22-97
Converting Sorting Algorithms to Fast Randomized Ones via Searching
Alexandros V Gerbessiotis and Constantinos J Siniolakis, June 1997, 6pp
TR-21-97
PRAM Programming: Theory vs. Practice
A V Gerbessiotis, D S Lecomber, C J Siniolakis and K R Sujithan, June 1997, 14pp
TR-20-97
An expectation-transformer model for probabilistic temporal logic
Carroll Morgan and Annabelle McIver, August 1997, April 1997, 25pp.
TR-17-97
Portable and Architecture independent parallel performance tuning using a call-graph profiling tool: A case study inoptmising SQL
Jonathan M D Hill, Stephen A Jarvis, Constantinos Siniolakis and Vasil P Vasilev, May 97, 18pp
TR-16-97
A weakest precondition semantics for Z
Ana Cavalcanti and Jim Woodcock. May 1997, 28pp.
TR-15-97
Parallel Algorithms for Structured Matrix Computations
Yuguang Huang, 1997, 38pp
TR-14-97
A Note on Probabilistic Integer Sorting
A.V.Gerbessiotis and C.J.Siniolakis, May 1997, 9pp
TR-13-97
A probabilistic temporal calculus based on expectations
Carroll Morgan and Annabelle McIver. April 1997, 20pp.
TR-12-97
A Stepwise Development of the Alternating Bit Protocol
Axel Wabenhorst. March 1997, 29pp.
TR-11-97
Dynamic Data Structures: The BSP Approach
A. V. Gerbessiotis and C. J. Siniolakis. 1997, 27pp.
TR-8-97
Direct BSP algorithms for parallel discrete-event simulation
M Marin. January 1997
TR-7-97
Binary tournament and priority queues : PRAM and BSP
M. Marin
TR-6-97
An Experimental Study of Sorting Algorithms on the BSP Model: Theory, Practice and Experience
A.V.Gerbessiotis and C.J.Siniolakis, February 1997, 16pp
TR-5-97
Procedures, Parameters, and Substitution in the Refinement Calculus
Ana Cavalcanti, Augusto Sampaio, Jim Woodcock, February 1997, Revised in June 1997, 1pp
TR-4-97
Adaptive proforms for accident and emergency medicine
Bryan S Todd, February 1997, 14pp
TR-3-97
Efficient evaluation of Boolean expressions
Bryan S Todd, February 1997, 9pp
TR-1-97
BSP Scheduling of Regular Patterns of Computation
Radu Calinescu, January 1997, 85pp

1996

TR-26-96
Learning to Read by Theory Revision
Stephen Muggleton, David Page, and Ashwin Srinivasan. 1996, 17pp.
TR-23-96
Primitive Operations on the BSP Model
Alexandros V Gerbessiotis and Constantinos J Siniolakis. October 1996, 12pp.
TR-22-96
Experiments in numerical reasoning with ILP
A. Srinivasan and R.C. Camacho, 1996
TR-21-96
Lessons learned from Implementing BSP
Jonathan M D Hill and David B Skillicorn, April 1998, 10pp
TR-19-96
Efficient Deterministic Sorting on the BSP Model
A V Gerbessiotis, CJ Siniolakis, June 1997
TR-16-96
Practical barrier synchronisation
Jonathan M D Hill and David B Skillicorn, August 1996, 9pp
TR-15-96
Questions and answers about BSP
David B Skillicorn, Jonathan M D Hill and W F McColl, August 1996, 38pp
TR-14-96
Concurrent Heaps on the BSP Model
A V Gerbessiotis, CJ Siniolakis, 1996, 37pp.
TR-13-96
Communication Efficient Data Structures on the BSP model with Applications
Alexandros V Gerbessiotis and Constantinos J Siniolakis. May 1996, 28pp.
TR-10-96
Direct Bulk-Synchronous Parallel Algorithms in Computational Geometry
Constantinos J Siniolakis. May 1996, 136pp.
TR-9-96
On the complexity of BSP sorting
Constantinos J Siniolakis. May 1996, 32pp.
TR-8-96
Bulk Synchronous Parallel Algorithms for Optmistic Discrete Event Simulation
Radu Calinescu, April 1996, 33pp
TR-7-96
Classifications in Algebraic Specifications of Abstract Data Types
Simon Veglioni, August 1997, 28pp.
TR-6-96
An introduction to probabilistic predicate transformers
Karen Seidel, Carroll Morgan and Annabelle McIver. March 1996, 27pp.
TR-5-96
Probabilistic predicate transformers: Part 2
Annabelle McIver and Carroll Morgan. March 1996, 23pp.
TR-4-96
The theory, practice, and a tool for BSP performance prediction applied to a CFD application
Jonathan M D Hill, Paul I Crumpton and David A Burgess. February 1996, 17pp.
TR-2-96
A representation for clinical procedures
Bryan S Todd. January 1996, 14pp.
TR-1-96
Developing fairness in terminating and reactive programs
Axel Wabenhorst. January 1996, 53pp.

1995

TR-25-95
Proof rules for probabilistic loops
Carroll Morgan. November 1995, 28pp.
TR-24-95
A weakest precondition semantics for Z
Ana Cavalcanti and Jim Woodcock. November 1995, 55pp.
TR-23-95
Unifying wp and wlp
Carroll Morgan and Annabelle McIver. August 1995, 10pp.
TR-22-95
A Concrete Z Grammar
Peter Breuer and Jonathan Bowen. September 1995, 23pp.
TR-21-95
Semantics of non-terminating systems through term rewriting
José Barros. August 1995, 141pp.
TR-20-95
A distributed semantics for FOOPS
Corina Cirstea. June 1995, 77pp.
TR-18-95
Refinement of concurrent object oriented programs
Paulo Borba and Joseph A Goguen. November 1995, 39pp.
TR-17-95
A refinement calculus for communicating processes with state
Luming Lai and J W Sanders. May 1995, 36pp.
TR-16-95
Conservative discrete-event simulations on Bulk Synchronous Parallel architectures
Radu Calinescu. April 1995, 33pp.
TR-13-95
Probabilistic determinism
Annabelle McIver and Carroll Morgan. November 1995, 13pp.
TR-12-95
A weakest-environment calculus for communicating processes
Luming Lai and J W Sanders. March 1995, 15pp.
TR-11-95
Argument duplication in probabilistic CSP
Carroll Morgan, Annabelle McIver, Karen Seidel and J W Sanders. October 1995, 25pp.
TR-4-95
Probabilistic predicate transformers
Carroll Morgan, Annabelle McIver, Karen Seidel and J W Sanders. February 1995, 37pp.
TR-3-95
Infinite behaviours in the Temporal Agent Model
Gavin Lowe. February 1995, 8pp.
TR-2-95
Refinement of complex systems: a case study
Gavin Lowe and Hussein Zedan. February 1995, 32pp.
TR-1-95
The lambda-Pi calculus with type similarity
Jason Brown and Eike Ritter. January 1995, 13pp.