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
A First Step Towards Time Optimal Software Pipelining of Loops
with Control Flows
Comparing Tail Duplication with Compensation Code in Single
Path Global Instruction Scheduling
Register Saturation in Superscalar and VLIW Code Case of
Direct Acyclic Data Dependence Graphs
|
FOSSACS
Automata Session chair: Pierre Lescanne
On the Complexity of Parity Word Automata
On the Modularity of Deciding Call-by-Need
On the Decidability of the Finite Model Problem
Axiomatizing Tropical Semirings
|
TACAS
Timed and Probabilistic Systems Session chair: Yassine Lakhnech
Efficient Guiding Towards Cost-Optimality in Uppaal
Linear Parametric Model Checking of Timed Automata
Abstraction in Probabilistic Process Algebra
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
|
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
A Bounded Graph-Connect Construction for LR-regular Parsers
|
FOSSACS
Automata and Languages Session chair: Colin Stirling
On Rational Message Sequence Chart Languages and Relationships to
Mazurkiewicz Trace Theory
Synchronized Tree Languages Revisited and New Applications
|
TACAS
Hardware: Design and Verification Session chair: Ed Brinksma
Hardware/Software Co-Design using Functional Languages
Automatic Abstraction of Memories in the Formal Verification
of Superscalar Microprocessors
|
|
17.00 17.30 |
Coffee | |||
17.30 19.00 |
CC
Demos Session chair: Nigel Horspool
SmartTools: a Generator of Interactive Environments Tools
Visual Patterns in the VLEli System
The ASF+SDF Meta-Environment: a Component-Based Language Development
Environment
|
FOSSACS
Categorical Foundations Session chair: Bart Jacobs
On the Duality between Observability and Reachability
Foundations for a Graph-Based Approach to the Specification of
Access Control Policies
Coalgebra of Abstract Processes
|
TACAS
Software verification Session chair: Susanne Graf
Boolean and Cartesian Abstractions for Model Checking C programs
Finding Feasible Counter-examples when Model Checking Abstracted Java
Programs
The LOOP Compiler for Java and JML
|
WADT |
20.00 |