| FLoC 2006 | The 2006 Federated Logic Conference Seattle, August 10 - 22, 2006 |
Thursday, August 10th
See also the by-session program.
| GALOP | IFIP WG | LCC | SSPV |
| 09:00‑10:30 IFIP WG Meeting |
|||
| 09:25‑09:30 (Suite 3128) Welcome to LCC06 |
|||
| 09:30‑10:30 (Suite 3102) Luke Ong A game semantic approach to infinite structures [pdf] |
09:30‑10:30 (Suite 3128) Toniann Pitassi TBA |
||
| 09:45‑10:30 (Metropolitan A) Ed Clarke Bounded and Unbounded Model Checking using SAT [ppt] |
|||
| 10:30‑11:00 Break |
|||
| 11:00‑11:45 (Suite 3102) Andrezj Murawski Algorithmic game semantics and the complexity of may-equivalence |
11:00‑12:30 IFIP WG Meeting (continued) |
11:00‑11:45 (Suite 3128) Patrick Baillot , Ugo Dal Lago and Jean-Yves Moyen On Quasi-Interpretations, Blind Abstractions and Implicit Complexity |
11:00‑11:45 (Metropolitan A) Ken McMillan SAT, interpolants, and software model checking [ppt] |
| 11:45‑12:30 (Suite 3102) John Longley and Nicholas Wolverson Game semantics for object-oriented languages: a progress report |
11:45‑12:30 (Suite 3128) Marion Jean-Yves and Pechoux Romain Quasi-friendly sup-interpretations |
11:45‑12:30 (Metropolitan A) Shuvendu Lahiri Efficient SAT-based Techniques for Predicate Abstraction [ppt] |
|
| 12:30‑14:00 Lunch break |
|||
| 14:00‑14:45 (Suite 3102) Dominic Hughes Hypergame semantics: Ten years later |
14:00‑15:30 IFIP WG Meeting (continued) |
14:00‑14:45 (Suite 3128) Antonina Kolokolova, Yongmei Liu, David Mitchell and Eugenia Ternovska Complexity of Expanding a Finite Structure and Related Tasks |
14:00‑14:45 (Metropolitan A) Carla Gomes Beyond Satisfiability: Model Counting, Quantification, and Randomization [ppt] |
| 14:45‑15:30 (Suite 3102) Joachim de Lataillade Curry-style type isomorphisms and game semantics |
14:45‑15:30 (Suite 3128) Murray Patterson , Yongmei Liu, Eugenia Ternovska and Arvind Gupta Grounding for Model Expansion in $k$-Guarded Formulas |
14:45‑15:30 (Metropolitan A) Daniel Kroening SAT-based methods for proving properties in Reynolds/O'Hearn Separation Logic [ppt] |
|
| 15:30‑16:00 Break |
|||
| 16:00‑16:45 (Suite 3102) Chrysida Galanaki, Panos Rondogiannis and William Wadge Game Semantics for Infinite Propositional Logic Programs with Negation |
16:00‑18:00 IFIP WG Meeting (continued) |
16:00‑17:00 (Suite 3128) Neil Jones The Spectrum Problem from a Computer Science Perspective [pdf] |
16:00‑16:45 (Metropolitan A) Alex Aiken Scalable Program Analysis Using Boolean Satisfiability [pdf] |
| 16:45‑17:30 (Suite 3102) Samson Abramsky [tentative] TBD |
|||
