The web-version of the programme is not very suitable for printing, so please download the following: ps. Participants will receive a printed copy as part of the welcome pack.
| British Colloquium for Theoretical Computer Science |
| BCTCS 17 Prelimary Programme |
| Kelvin Conference Centre; Glasgow; 9th-12th April 2001 |
| |
| Monday, 9th April 2001 |
| |
|
|
|
|
|
|
| |
17:00-19:30 |
|
| |
Arrival and Registration |
|
| |
|
|
|
|
|
|
| |
19:30-20:30 |
|
| |
Dinner |
|
| |
|
|
|
|
|
|
| |
| Tuesday, 10th April 2001 |
| |
|
|
|
|
|
|
| |
8:00-8:50 |
|
| |
Breakfast |
|
| |
|
|
|
|
|
|
| |
9:00-9:15 |
|
| |
Welcome |
|
| |
Prof Malcolm McLeod |
University of Glasgow Vice-Prinicipal |
|
| |
|
|
|
|
|
|
| |
9:15-10:15 |
|
| |
Invited Talk |
|
| |
Ursula Martin |
Computational math: the new challenge for computational logic |
|
| |
|
|
|
|
|
|
| |
10:15-10:45 |
|
| |
Coffee |
|
| |
|
|
|
|
|
|
| |
10:45-11:45 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Marius C. Bujorianu |
An Abstract Domain for Probabilistic Hybrid Systems |
|
Claudia Nalon |
Theroem Proving for Synchronous Systems with No Learning |
|
| |
Denham Coates-Evelyn |
An Analysis of Kronrod's and Related merge Algorithms |
|
Martin Lange |
Satisfiability Games and Completeness of Temporal Logic |
|
| |
|
|
|
|
|
|
| |
11:45-12:45 |
|
| |
Tutorial |
|
| |
Faron Moller |
Techniques for decidability and undecidability for bisimilarity |
|
| |
|
|
|
|
|
|
| |
12:45-14:15 |
|
| |
Lunch |
|
| |
|
|
|
|
|
|
| |
14:15-15:15 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Steve Lakin |
Context-sensitive Decision Problems in Groups |
|
Victor Khomenko |
Verification of Bounded Petri Nets Using Integer Programming |
|
| |
Tom Newcomb |
On model checking data-independent systems with arrays |
|
M. Carmen Fernandez-Gago |
Algorithms for Guiding Clausal Temporal Resolution |
|
| |
|
|
|
|
|
|
| |
15:15-16:15 |
|
| |
Invited Talk |
|
| |
Muffy Calder |
A Day in the Life of a Spin Doctor |
|
| |
|
|
|
|
|
|
| |
16:15-16:45 |
|
| |
Coffee |
|
| |
|
|
|
|
|
|
| |
16:45-17:45 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Denham Coates-Evelyn |
An Optimum In-Place Merge |
|
Florent Madelaine |
A family of Colouring problems that are not Homomorphism Problems |
|
| |
Richard Bruce |
Introduction to ad hoc wireless networks and a new fan-out broadcasting method |
|
Peter Saffrey |
State Space Reduction by Specification Modification |
|
| |
|
|
|
|
|
|
| |
18:30-20:00 |
|
| |
Dinner |
|
| |
|
|
|
|
|
|
| |
| Wednesday, 11th April 2001 |
| |
|
|
|
|
|
|
| |
8:00-8:50 |
|
| |
Breakfast |
|
| |
|
|
|
|
|
|
| |
9:00-10:00 |
|
| |
Invited Talk |
|
| |
Alexander Rabinovich |
Temporal Logic over Branching Time: Expressiveness and Complexity |
|
| |
|
|
|
|
|
|
| |
10:00-10:30 |
|
| |
Coffee |
|
| |
|
|
|
|
|
|
| |
10:30-11:30 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Barry John Norton |
Clocked Transition Systems and the Compositional Modelling of Reactive Components under Synchronous Scheduling |
|
Antonio Puricella |
A Generic Greedy Algorithm, Partially-ordered Graphs and NP-completeness |
|
| |
David Manlove |
The Stable Roommates Problem with Ties |
|
Jonathan Burton |
Implementation of Relations in the Event of Interface Difference |
|
| |
|
|
|
|
|
|
| |
11:30-12:30 |
|
| |
Tutorial |
|
| |
Joachim Parrow |
An Introduction to the pi-Calculus |
|
| |
|
|
|
|
|
|
| |
12:30-14:00 |
|
| |
Lunch |
|
| |
|
|
|
|
|
|
| |
14:00-15:00 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Manuela L. Bujorianu |
Constructive Foundations of Stochastic Analysis in Linear Logic |
|
Paul Sant |
A Direct Construction of a Universal P System |
|
| |
Carron Shankland |
Prototyping Model Checkers over Symbolic Transition Systems |
|
Aileen McLoughlin |
New Noncommutative Bilinear Algorithms for 3 by 3 Matrix Multiplication |
|
| |
|
|
|
|
|
|
| |
15:00-16:00 |
|
| |
Invited Talk |
|
| |
Mike Paterson |
Getting your message across, but nicely: an introduction to contention resolution |
|
| |
|
|
|
|
|
|
| |
16:00-16:30 |
|
| |
Coffee |
|
| |
|
|
|
|
|
|
| |
16:30-17:30 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Graham Farr |
Planarization and fragmentability for graphs of bounded degree |
|
David Haniff |
Augmenting Reality |
|
| |
S. Crespi-Reghizzi |
Associative Language Descriptions versus Context-free Models |
|
Dietrich Kuske |
Languages of Series-Parallel Pomsets |
|
| |
|
|
|
|
|
|
| |
17:30-18:30 |
|
| |
Open General Meeting |
|
| |
|
|
|
|
|
|
| |
19:30-22:00 |
|
| |
Conference Dinner |
|
| |
|
|
|
|
|
|
| |
| Thursday 12th April 2001 |
| |
|
|
|
|
|
|
| |
8:00-8:50 |
|
| |
Breakfast |
|
| |
|
|
|
|
|
|
| |
9:00-10:00 |
|
| |
Invited Talk |
|
| |
Simon Peyton Jones |
Asynchronous Exceptions in Concurrent Haskell |
|
| |
|
|
|
|
|
|
| |
10:00-10:30 |
|
| |
Coffee |
|
| |
|
|
|
|
|
|
| |
10:30-11:30 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Rick Thomas |
String Rewriting in Groups |
|
Michele Zito |
A Remark on the Space Complexity of Random Formulae in Resolution |
|
| |
Gerald Luettgen |
A Faster-than Relation for Asynchronous Processes |
|
Graham Hutton |
The Generic Approximation Lemma |
|
| |
|
|
|
|
|
|
| |
11:30-12:30 |
|
| |
Contributed Talks |
|
| |
Stream A |
|
Stream B |
|
| |
Mark Jerrum |
A Polynomial-time Approximation Algorithm for the Permanent of a Matrix with Non-negative Entries |
|
Simon Gay |
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL |
|
| |
Aris Pagourtzis |
Counting the leaves of a nondeterministic computation tree |
|
Alice Miller |
Using SPIN to Analyse the Tree Identification Phase of
the FireWire Protocol |
|
| |
|
|
|
|
|
|
| |
12:30-12:35 |
|
| |
Close |
|
| |
|
|
|
|
|
|
| |
12:45-14:00 |
|
| |
Lunch |
|
| |
|
|
|
|
|
|
