|
| Computer Science Association |
PROGRAMME
| MONDAY 19 JANUARY |
| 11.00 - 12.30 FORMAL ASPECTS |
| Jeremy Dawson: Formalising General Correctness |
| Taolue Chen, Jingyang Zhou, Tingting Han, Jian Lu: Checking Open Congruence in chi-Calculus |
| Greg O'Keefe: Towards a Readable Formalisation of Category Theory |
| 2.00 - 3.30 LOGIC AND ALGORITHMS I |
| Sebastian Link, Sven Hartmann: A Membership Algorithm for Functional and Multi-valued Dependencies in the Presence of Lists |
| Gem Stapleton, Jean Flower:
Automated Theorem Proving with Spider Diagrams |
| David Hemer: Higher-order associative
commutative pattern matching for component retrieval |
| 4.00 - 5.30 ALGORITHMS AND COMBINATORICS |
| Hirotaka Ono, Yuichi Asahiro, Takashi
Horiyama, Kazuhisa Makino, Toshinori Sakuma, Masafumi Yamashita
: How to Collect Balls Moving in the Euclidean Plane |
| William Duckworth: Small Edge
Dominating Sets of Regular Graphs |
| Jesper Jansson, Charles Choy, Kunihiko Sadakane,
Ken W.-K. Sung: Computing the Maximum Agreement of Phylogenetic
Networks |
| TUESDAY 20 JANUARY |
| 9.00 - 10.30 LOGIC AND
ALGORITHMS II |
| Neil Leslie, Edwin Mares: CHR:
A constructive relevant natural-deduction logic |
| Elio Giovannetti: Type Inference
for Mobile Ambients in Prolog |
| Vladimir Estivill-Castro: Generating
Nearly Sorted Sequences - The use of measures of disorder |
| 11.00 - 12.30 |
| KEYNOTE LECTURE: Ian Munro:
Succinct Data Structures |
| 4.00 - 6.00 SYSTEMS AND ALGORITHMS |
| Tak-Wah Lam, Johnny Ngan, Kar-Keung To,
Prudence Wai-Ha Wong: Aggressive Online Deadline Scheduling |
| Quy Tuan Nguyen, Barry Jay,
H.Y. Lu: The
Polymorphic Imperative: a Generic Approach to In-place Update |
| Graham Farr: Cost-effectiveness of algorithms
(informal presentation) |
| Margaret Mitchell:Creating Vertex Series Parallel
Graphs from Directed Acyclic Graphs is NP-Complete (informal presentation) |
| Stefan Szeider:The Parameterized Complexity
of SAT Backdoors (informal presentation) |