Current events

From The Programming Languages and Systems Research Group
Revision as of 14:27, 22 May 2007 by Muehlber (talk | contribs) (Meetings in Summer 2007)

Jump to: navigation, search

Thursday, 24 May Malcolm Wallace: "Functional Programming and Visualisation: A Lazy PolyTypic Grid"



Regular group meetings

During term time we meet each week to discuss topical issues. A discussion may be initiated by a short talk given by a member or guest of the group.

Talks can be booked by contacting Jan Tobias Muehlberg. Suitable topics are:

  • Any subject related to programming languages and systems
  • Work in progress to discuss, or ideas you've been mulling over
  • Reports on a paper you read, a recent conference, workshop or visit to another institution, which you think may interest other members of the group
  • Practice for a talk you will be giving at a conference or workshop to obtain feedback from your colleagues

Details of meetings in previous years are available.

Meetings in Summer 2007

Thursday, 03 May Ben Mitchel: "Animating Simulated Annealing with Lego Mindstorms"
12:20 -- 12:40, CS202J Abstract: This project explores the physical animation of simulated annealing using Lego Mindstorms, and assesses the suitability of this approach to algorithm animation for use as an interactive teaching aid.

Thursday, 03 May Ian Boden: "Animation of Garbage Collection Algorithms using Lego Mindstorms"
12:40 -- 13:00, CS202J Abstract: My project investigates the use of Lego Mindstorms for educating students about Garbage Collection algorithms. It concentrates on producing a tool for demonstration and independent learning which is as capable of educating as standard methods with the advantage of making the topic more exciting for the students.

Thursday, 24 May Malcolm Wallace: "Functional Programming and Visualisation: A Lazy PolyTypic Grid"
12:15 -- 13:15, CS202J Abstract: This talk will give an overview of the Lazy Polytypic Grid project,and outline some of our early results. Our aim is to explore how to make existing well-known visualisation algorithms (e.g. volumetric surface extraction):
  • lazy, so that the whole dataset is not required all at once;
  • datatype-generic (polytypic), so that the algorithm is independent of the original dataset storage format, including questions of irregular and unstructured sampling;
  • grid-enabled, such that it is possible to distribute the processing tasks across a heterogeneous network of machines, harnessing any implicit parallelism in the algorithms to speed up the calculation for huge datasets.

Thursday, 31 May Neil Mitchell: "Fastest Lambda First"
12:15 -- 13:15, CS202J Abstract: Haskell programs are often very succinct, but what they gain in beauty they can sometimes loose in speed. Work on the GHC compiler has enabled Haskell programs to perform at C speeds, or faster in some cases, but at the cost of using a lower-level style of Haskell.

This talk introduces a new technique for optimisation, which attempts to eliminate any overhead from an algorithm. The idea relies on the first-order transformation presented last term, and attempts to remove all data and higher-order functions from a program. With the techniques presented Haskell can remain beautiful, and perform at the same speed as C.


The list above contains only talks for which at least a speaker and a title are available. The full schedule with incomplete talks and empty slots is available under Meetings in Summer 2007.

Other events

Thursday, 31 August 2006 Jonathan Ezekiel: "Can Saturation be Parallelised? On the Parallelisation of a Symbolic State-Space Generator"
14:430 -- 15:00, PDMC, Bonn (satellite of CONCUR) Abstract: Symbolic state-space generators are notoriously hard to parallelise. However, the Saturation algorithm implemented in the SMART verification tool differs from other sequential symbolic state-space generators in that it exploits the locality of firing events in asynchronous system models.

This paper explores whether event locality can be utilised to efficiently parallelise Saturation on shared-memory adrchitectures. Conceptually, we propose to parallelise the firing of events within a decision diagram node, which is technically realised via a thread pool. We discuss the challenges involved in our parallel design and conduct experimental studies on its prototypical implementation. On a dual-processor dual-core PC, our studies show speed-ups for several example models, e.g., of up to 50% for a Kanban model, when compared to running our algorithm only on a single core. (Joint work with Gerald Luettgen and Radu Siminiceanu)


Sunday, 27 August 2006 Jan Tobias Muehlberg: "BLASTing Linux Code"
About 11:45, FMICS, Bonn (satellite of CONCUR) Abstract: Computer programs can only run reliably if the underlying operating system is free of errors. In this paper we evaluate, from a practitioners point of view, the utility of the popular software model checker BLAST for revealing errors in Linux kernel code. The emphasis is on important errors related to memory safety in and locking behaviour of device drivers. Our conducted case studies show that, while BLAST's abstraction and refinement techniques are efficient and powerful, the tool has deficiencies regarding usability and support for analysing pointers, which are likely to prevent kernel developers from using it. (Joint work with Gerald Luettgen)

Links: slides, paper and additional material


Sunday, 2 April 2006 Greg Manning: "The York Abstract Machine"
About 2pm, GT-VMT, Vienna (satellite of ETAPS) Abstract: We introduce the York Abstract Machine (YAM) for implementing the graph programming language GP and, potentially, other graph transformation languages. The advantages of an abstract machine over a direct interpreter for graph transformation rules are better efficiency, use as a common target for compiling both future versions of GP and other languages, and portability of GP programs to different platforms.