(EC)2 2012: Programme
Saturday, July 7
Session 1: 9:00 – 10:00 |
Invited talk: Mihai Budiu. The Compiler Forest |
break 10:00-10:30 | |
Session 2: 10:30 – 12:00 |
10:30am – 11am position paper: Gerhard Schellhorn, Heike Wehrheim, John Derrick, and Bogdan Tofan. Proofs of Linearizability and Lock-Freedom. 11am – 12pm Invited talk: Greg Bronevetsky. Compositional Dataflow: Seamless Collaboration for Compiler Analysis Development. |
Lunch break 12:00 – 1:30 |
|
Session 3: 1:30 – 3:00 |
1:30pm – 2pm position paper: Borzoo Bonakdarpour. Automated Construction of Concurrent Programs: Beyond Verification 2pm – 2:30pm position paper: Bernd Finkbeiner and Swen Jacobs. Lazy Synthesis 2:30pm – 3pm position paper: Muralidhar Talupur. Flow based Synthesis of Message Passing Protocols |
break: 3:00 – 3:30 |
|
Session 4: 3:30 – 4:30 |
3:30pm – 4pm position paper: Matthew Hague and Anthony Widjaja Lin. SMT-Based Approach to Verifying Counter Systems and Their Extensions 4pm – 4:30pm position paper: Igor Konnov, Helmut Veith, and Josef Widder. Who is afraid of Model Checking Distributed Algorithms? |
Sunday, July 8
shared session with REORDER 9:00 – 10:00 |
Invited talk: Akash Lal. Bounding and Sequentializing Concurrent Programs |
break 10:00-10:30 |
|
shared session with REORDER 10:30 – 12:00 |
REORDER Invited talk: Hans Boehm. The C11 and C++11 memory model |
Lunch break 12:00 – 1:30 |
|
Session 5: 1:30 – 3:00 |
1:30pm – 2pm position paper: Duc Hiep Chu and Joxan Jaffar. Exploiting Similarities for State Space Reduction 2pm – 3pm Invited talk: Christoph Kirsch. Incorrect Systems: It’s not the Problem, It’s the Solution |
break: 3:00 – 3:30 |
|
Session 6: 3:30 – 4:30 |
Discussions |