Abstract Many existing systems are written in C and are not re‐entrant or thread safe. Sometimes these systems are required in a context for which they were not first designed, possibly meaning they now need to be re‐entrant. This article introduces a program that filters C source code, modifying shared resources (the global variables) to make the code re‐entrant: ‘virtualizing’ the code. The code is then compiled as normal. This approach allows programmatic virtualization with little cost at runtime. Copyright © 2007 John Wiley & Sons, Ltd.

This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between systems and theory researchers. The protocol is a media access control (MAC) protocol for the SWIFT optical network, which uses optical switching and wavelength striping to provide very high bandwidth packet- switched interconnects. The use of optical switching (and the lack of optical buffering) means that the protocol must control the switch within hard timing constraints. We use higher-order logic to express the protocol design, in the general-purpose HOL automated proof assistant. The specification is thus completely precise, but still concise, readable, and without accidental overspecification. Further, we test conformance between the specification and two implementations of the protocol: an NS-2 simulation model and the VHDL code of the network hardware. This involves: (1) proving, within HOL, that the specification is equivalent to an algorithmically-checkable version; (2) using automatic code-extraction to generate a testing oracle; and (3) applying that oracle to traces of the implementation. This design-time use of rigorous methods has resulted in a protocol that is better specified and more correct than it would otherwise be, with relatively little effort.

Much current simulation of TCP makes use of simplified models of TCP, which is a large and complex protocol with many variations possible between implementations. We use direct execution of real world network stacks in the network simulator ns-2 to compare TCP performance between implementations and reproduce existing work. A project called The Network Simulation Cradle provides the real world network stacks and we show how it can be used for performance evaluation and validation. There are large differences in performance between simplified TCP models and TCP implementations in some situations. Such differences are apparent in some reproduced research, with results using the Network Simulation Cradle very different from the results produced with the ns-2 TCP models. In other cases, using the real implementations gives very similar results, validating the original research.

There are various software technologies that allow capture and redelivery of lectures. Most of these technologies however rely on the use of proprietary software, often requiring extra efforts from the lecturer in terms of the initial preparation of the lecture material, or in editing and annotating after the lecture to make the material suitable for the students. To review the material students then require access to the proprietary software. This paper describes a system for the lightweight capture of lecture presentations, based on the use of a low-cost large interactive display surface, together with standard Microsoft PowerPoint/spl trade/ presentation software. The captured version of the presentation includes the original lecture slides' graphical annotations made by the lecturer during the lecture, and the audio recording of the lecture; all saved as a PowerPoint file. In addition, the system adds some annotations and index slides to allow quick and easy access to different segments of the presentation. Presentations can be replayed in part or in full as required, preserving all of the content of the live lecture.