Program of Tuesday, April 3rd

 9.00
10.00

Session chair: Reinhard Wilhelm
Ole Lehrman Madsen
10.00
10.30
Coffee
10.30
12.30
CC
Intraprocessor Parallelism
Session chair: Christine Eisenbeiss

Software Pipelining of Nested Loops
Kalyan Muthukumar, Gautam Doshi (Intel Corporation)

A First Step Towards Time Optimal Software Pipelining of Loops with Control Flows
Han-Saem Yun, Jihong Kim, Soo-Mook Moon (Seoul National University)

Comparing Tail Duplication with Compensation Code in Single Path Global Instruction Scheduling
David Gregg (Technische Universität Wien)

Register Saturation in Superscalar and VLIW Code Case of Direct Acyclic Data Dependence Graphs
Sid Ahmed Ali Touati (INRIA)

FOSSACS
Automata
Session chair:
Pierre Lescanne

On the Complexity of Parity Word Automata
Valerie King (University of Victoria),
Orna Kupferman (Hebrew University),
Moshe Vardi (Rice University)

On the Modularity of Deciding Call-by-Need
Irèene Durand (Université Bordeaux I),
Aart Middeldorp (University of Tsukuba)

On the Decidability of the Finite Model Problem
Mikolaj Bojanczyk (Warsaw University)

Axiomatizing Tropical Semirings
Luca Aceto (Aalborg University),
Zoltan Esik (A. Jozsef University, Szeged),
Anna Ingólfsdóttir (Aalborg University)

TACAS
Timed and Probabilistic Systems
Session chair: Yassine Lakhnech

Efficient Guiding Towards Cost-Optimality in Uppaal
Gerd Behrmann (Aalborg University),
Ansgar Fehnker (University of Nijmegen),
Thomas Hune (Aarhus University),
Kim Larsen (University of Twente),
Paul Pettersson (Uppsala University),
Judi Romijn (University of Nijmegen)

Linear Parametric Model Checking of Timed Automata
Thomas Hune (Aarhus University),
Judi Romijn, Marielle Stoelinga, Frits Vaandrager (University of Nijmegen)

Abstraction in Probabilistic Process Algebra
Suzana Andova, J.C.M. Baeten (Eindhoven University)

First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
Theo C. Ruys, Rom Langerak, Joost-Pieter Katoen (University of Twente),
Diego Latella, Mieke Massink (CNUCE, Pisa)

WADT
12.30
15.00
Lunch
15.00
16.00
Session chair: Ed Brinksma
Michael Fourman (Invited Lecture)
16.00
17.00
CC
Parsing
Session chair:
Stefano Crespi-Reghizzi

Directly-Executable Earley Parsing
John Aycock, Nigel Horspool (University of Victoria)

A Bounded Graph-Connect Construction for LR-regular Parsers
Jacques Farré (CNRS and Université de Nice),
José Fortes Galvez (Universidad de Las Palmas de Gran Canaria)

FOSSACS
Automata and Languages
Session chair:
Colin Stirling

On Rational Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Remi Morin (TU-Dresden)

Synchronized Tree Languages Revisited and New Applications
Valerie Gouranton (Université d'Orléans),
Pierre Rety (Université d'Orléans),
Helmut Seidl (University of Trier)

TACAS
Hardware: Design and Verification
Session chair:
Ed Brinksma

Hardware/Software Co-Design using Functional Languages
Alan Mycroft (Cambridge University, AT&T Laboratories),
Richard Sharp (AT&T Laboratories)

Automatic Abstraction of Memories in the Formal Verification of Superscalar Microprocessors
Miroslav Velev (Carnegie Mellon University)

 
17.00
17.30
Coffee
17.30
19.00
CC
Demos
Session chair: Nigel Horspool

SmartTools: a Generator of Interactive Environments Tools
I. Attali, C. Courbis, P. Degenne, A. Fau, D. Parigot (INRIA Sophia Antipolis)

Visual Patterns in the VLEli System
M. Jung, U. Kastens, C. Schindler, C. Schmidt (Universität Paderborn)

The ASF+SDF Meta-Environment: a Component-Based Language Development Environment
M.G.J. van den Brand, J. Heering, H.A. de Jong, M. de Jonge, T. Kuipers, P. Klint, L. Moonen, P.A. Olivier (CWI Amsterdam),
J. Scheerder (Utrecht University),
J.J. Vinju (CWI Amsterdam),
E. Visser (Utrecht University),
J. Visser (CWI Amsterdam)

FOSSACS
Categorical Foundations
Session chair: Bart Jacobs

On the Duality between Observability and Reachability
Michel Bidoit (CNRS & ENS de Cachan),
Rolf Hennicker (Ludwig-Maximilians-Universität München),
Alexander Kurz (CWI, Amsterdam)

Foundations for a Graph-Based Approach to the Specification of Access Control Policies
Manuel Koch (PSI AG),
Luigi Vincenzo Mancini, Francesco Parisi-Presicce (Univ. Roma "La Sapienza")

Coalgebra of Abstract Processes
Sava Krstic, John Launchbury (Oregon Graduate Institute),
Dusko Pavlovic (Kestrel Institute)

TACAS
Software verification
Session chair: Susanne Graf

Boolean and Cartesian Abstractions for Model Checking C programs
Thomas Ball, Andreas Podelski, Sriram Rajamani (Microsoft Research)

Finding Feasible Counter-examples when Model Checking Abstracted Java Programs
Corina S. Pãsãreanu, Matthew B. Dwyer (Kansas State Univ.),
W. Visser (Nasa Ames Research Center, Moffet Field)

The LOOP Compiler for Java and JML
Joachim van den Berg, Bart Jacobs (University of Nijmegen)

WADT
20.00