CALCO-jnr 2005: Scientific Programme
The CALCO Young Researchers Workshop, CALCO-jnr, is a CALCO satellite
meeting dedicated to presentations by PhD students and by those who
completed their doctoral studies within the past few years.
The scientific programme for CALCO-jnr is as follows:
Opening
8:45-9:00
Session 1:
9:00-9:25
Daniel Gebler, CWI Amsterdam,
On Behavioral Abstraction in Hidden Logic
9:25-9:50
Kim Solin, Turku Centre for Computer Science,
Outline of a Dually Nondeterministic Refinement Algebra
9:50-10:15
Juan Santa-Cruz, Complutense University of Madrid,
ASIP+ITP: A Verification Tool Based on Algebraic Semantics
10:15-10:40
Matt Webster, University of Liverpool,
Algebraic Specification of Computer Viruses and their Environments
Session 2:
11:10-11:35
Ichiro Hasuo and Bart Jacobs, Radboud University Nijmegen,
Coalgebraic Trace Semantics for Probabilistic Systems
11:35-12:00
Helle Hvid Hansen and David Costa, Free University Amsterdam,
Constructing Sequential Machines from Coinductive Specifications
12:00-12:25
Dominik Lücke, Technical University of Braunschweig,
Recursive Coalgebras of Finitary Functors
12:25-12:50
Koki Nishizawa, National Institute of Advanced Industrial Science
and University of Tokyo,
Lawvere Theories for Complete Fibrations and Fibred CCCs
Session 3:
14:20-14:45
Will Harwood, University of Wales Swansea,
Weak Bisimulation Approximations
14:45-15:10
David Costa, Dave Clarke, CWI Amsterdam,
Intensional Constraint Automata
15:10-15:35
Gareth A. Evans, University of Wales Bangor,
Involutive Rewrite Systems
15:35-16:00
Magne Haveraaen, Adis Hodzic, University of Bergen,
Extending the Birkhoff Theorem to Parametrized Specifications
Session 4:
16:30-16:55
Satish Mishra, Humboldt University Berlin,
Towards the reuse of test suites during the evolution of software systems
16:55-17:20
Klaus Lüttich, University of Bremen,
Approximation of Ontologies in Casl
17:20-17:45
Kathrin Hoffmann, Technical University Berlin,
Folding and Unfolding Constructions of Algebraic Higher-Order Nets
