| March 29, 2011 | ||
| Tuesday | ||
| 9:00-10:00 in E2.2 Invited Talk: Martin Odersky | ||
| 10:00-10:30 Coffee break | ||
| Tuesday 10:30-12:30 | ||
| CC | TACAS | FOSSACS |
| Parallelism and High-Performance Computing | Interpolations and SAT-solvers | Automata I |
| in E2.1/001 | in E1.3/001 | in E1.3/003 |
| Actor-based Parallel Dataflow Analysis | Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic | Alternation Elimination for Automata over Nested Words |
| Jonathan Rodriguez, Ondřej Lhoták | Alberto Griggio, Thi Thieu Hoa Le, Roberto Sebastiani | Christian Dax, Felix Klaedtke |
| Using Disjoint Reachability for Parallelization | Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems | Co-Büching Them All |
| James Jenista, Yong hun Eom, Brian Demsky | Tino Teige, Martin Fränzle | Udi Boker, Orna Kupferman |
| Data Layout Transformation for Stencil Computations on Short-Vector SIMD Architectures | Specification based Program Repair using SAT | Minimizing Deterministic Lattice Automata |
| Thomas Henretty, Kevin Stock, Louis-Noël Pouchet, Franz Franchetti, J. Ramanujam, P. Sadayappan | Divya Gopinath, Zubair Malik, Sarfraz Khurshid | Shulamit Halamish, Orna Kupferman |
| Subregion Analysis and Bounds Check Elimination for High Level Arrays | Optimal Base Encodings for Pseudo-Boolean Constraints | Regularity and context-freeness over word rewriting systems |
| Mackale Joyner, Zoran Budimlić, Vivek Sarkar | Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp | Didier Caucal, Trong Hieu Dinh |
| 12:30-14:00 Lunch | ||
| 14:00-15:00 in E2.2 Invited Talk: Andreas Podelski | ||
| Tuesday 15:15-16:15 | ||
| CC | TACAS | FOSSACS |
| Task and Data Distribution | Learning | Timed Automata |
| in E2.1/001 | in E1.3/001 | in E1.3/003 |
| Practical Loop Transformations for Tensor Contraction Expressions on Multi-Level Memory Hierarchies | Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference | Quantitative Robustness Analysis of Flat Timed Automata |
| Wenjing Ma, Sriram Krishnamoorthy, Gagan Agrawal | Yungbum Jung, Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi | Rem Jaubert, Pierre-Alain Reynier |
| A Static Task Partitioning Approach for Heterogeneous Systems Using OpenCL | Next Generation Learnlib (Tool) | A game approach to determinize timed automata |
| Dominik Grewe, Michael O'Boyle | Maik Merten, Bernhard Steffen, Falk Howar, Tiziana Margaria | Nathalie Bertrand, Amelie Stainer, Thierry Jéron, Moez Krichen |
| 16:15-16:45 Coffee break | ||
| Tuesday 16:45-18:15 | ||
| TACAS | FOSSACS | |
| Model Checking | Automata II | |
| in E1.3/001 | in E1.3/003 | |
| Applying CEGAR to the Petri Net State Equation | A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes | |
| Karsten Wolf, Harro Wimmel | Naoki Kobayashi | |
| Biased Model Checking using Flows | Church Synthesis Problem for Noisy Input | |
| Muralidhar Talupur, Hyojung Han | Yaron Velner, Alexander Rabinovich | |
| S-TALIRO: A Tool for Temporal Logic Falsification for Hybrid Systems (Tool) | Probabilistic Modal µ-Calculus with Independent Product | |
| Yashwanth Annapureddy, Che Liu, Georgios Fainekos, Sriram Sankaranarayanan | Matteo Mio | |