WEDNESDAY, 10 April |
|
9.00 10.00 |
ETAPS Invited Talk Daniel Jackson (MIT Lab for Computer Science) Alloy: A New Technology for Software Modelling Session chair: Susanne Graf |
10.00 10.45 |
Coffee |
10.45 12.45 |
FOSSACS Specification Session chair: Andrzej Tarlecki On the Integration of Observability and Reachability Concepts Logics Admitting Final Semantics On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability Heterogeneous Development Graphs and Heterogeneous Borrowing |
12.45 14.15 |
Lunch |
14.15 15.15 |
ETAPS Invited Talk Mary Shaw (Carnegie Mellon University) What Makes Good Research in Software Engineering? Session chair: José Fiadeiro |
15.15 16.00 |
Coffee |
16.00 17.30 |
FOSSACS Semantics and Types Session chair: Don Sanella Verification for Java's Reentrant Multithreading Concept Efficient Type Matching A Semantic Basis for Local Reasoning |
17.30 17.45 |
Short Break |
17.45 18.45 |
FOSSACS Distributed Systems Session chair: Fernando Orejas Characterization of Families of Graphs in which Election is Possible Conflict Detection and Resolution in Access Control Policy Specifications |
20.00 | ETAPS DINNER |
THURSDAY, 11 April |
|
9.00 10.00 |
FOSSACS Invited Talk Bruno Courcelle (Université Bordeaux, F) Semantical Evaluations as Monadic Second-order Compatible Structure Transformations Session chair: Mogens Nielsen |
10.00 10.45 |
Coffee |
10.45 12.45 |
FOSSACS Infinite State Systems Session chair: Julian Bradfield Higher-order Pushdown Trees are Easy Model-Checking Infinite Systems Generated by Ground Tree Rewriting Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds Note on the Tableau Technique for Commutative Transition Systems |
12.45 14.15 |
Lunch |
14.15 15.15 |
SPIN Invited Talk Ed Clarke (Carnegie Mellon University) SAT-based Counterexample Guided Abstraction Refinement Session chair: |
15.15 16.00 |
Coffee |
16.00 17.30 |
FOSSACS Logic Session chair: Antoine Petit Model Checking Fixed Point Logic with Chop Verifying Temporal Properties using Explicit Approximants: Completeness for Context-free Processes A Calculus of Circular Proofs and its Categorical Semantics |
17.30 17.45 |
Short Break |
17.45 18.45 |
FOSSACS Message Sequence Charts Session chair: Doron Peled Bounded MSC Communication Generalised Regular MSC Languages |
20.00 | nyd |
FRIDAY, 12 April |
|
9.00 10.00 |
CC and SPIN Invited Talk Session chair: Nigel Horspool Abstract Interpretation: Theory and Practice |
10.00 10.45 |
Coffee |
10.45 12.45 |
FOSSACS Semantics Session chair: Peter Mosses Varieties of Effects Notions of computation determine monads A First-Order One-Pass CPS Transformation The Informatic Derivative at a Compact Element |
12.45 14.15 |
Lunch |
14.15 15.45 |
FOSSACS Process Calculi Session chair: Andy Gordon Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation Linearity and Bisimulation On Compositional Reasoning in the Spi-Calculus |
15.45 16.15 |
Coffee |
16.15 17.45 |
FOSSACS Time and Probability Session chair: Pierpaolo Degano Proving Correctness of Timed Concurrent Constraint Programs On Model Checking Durational Kripke Structures The Demonic Product of Probabilistic Relations |
17.45 18.00 |
Closing Session |
20.00 | SPIN dinner |