Brad D. Bingham

Learn More
We present Preach, an industrial strength distributed explicit state model checker based on Murphi. The goal of this project was to develop a reliable, easy to maintain, scalable model checker that was compatible with the Murphi specification language. Preach is implemented in the concurrent functional language Erlang, chosen for its parallel programming(More)
We show that the problem of finding an energy minimal schedule for execution of a collection of jobs on a multiprocessor with job migration allowed has polynomial complexity. Each job is specified by a release time, a deadline, and an amount of work to be performed. All of the processors have the same, convex power-speed trade-off of the form P = phi(s),(More)
An important problem in the verification of hardware protocols is that of proving deadlock freedom. We view deadlock freedom as the property that for all reachable states, there exists some path to a quiescent state, i.e. one wherein all resources of interest are free and thus all prior requests have been resolved. We establish a framework for showing this(More)
Non-attendance by patients for elective surgery with insufficient time to find replacement leads to wasted theatre time and wasted resources. The introduction of pre-admission clinics at the North Riding Infirmary, Middlesbrough has alleviated this problem and has led to considerable financial savings. A 12 month prospective study has shown an increase in(More)
Power consumption has become one of the most critical concerns for processor design. This motivates designing algorithms for minimum execution time subject to energy constraints. We propose simple models for analysing algorithms that reflect the energy-time trade-offs of CMOS circuits. Using these models, we derive lower bounds for the energy-constrained(More)
Crucial to the implementation and success of any educational program, especially problem-based learning (PBL), is the support and co-operation from staff involved in its use. It is suggested that this support and co-operation is dependent on their understanding of and comfort with the process especially when PBL may require substantial change in teaching(More)
The performance of today’s computers is limited primarily by power consumption rather than the number of instructions executed. Because the energy required to perform an operation using VLSI circuits drops rapidly with the time allowed for the operation, many slow processors can complete a parallel computation using less time and less energy than a fast(More)
This paper presents a practical method and associated tool for verifying deadlock freedom properties in guarded command systems. Such properties are expressed in CTL as AGEF q where q is a set of quiescent states. We require the user to provide transitions of the system that are “helpful” in reaching quiescent states. The distributed search constructs a(More)
The design and analysis of algorithms requires a model of computation. Such a model should faithfully reflect the physical processes of computation so that a programmer can distinguish efficient computations from inefficient ones. At the same time, the model must be simple enough to be tractable and general enough to continue to apply as the underlying(More)