On this page:
Invited Speakers
- Ronald Fagin
Logic, Complexity, and Games - Saul A. Kripke
From the Church-Turing Thesis to the First-Order Algorithm Theorem - Jean-Louis Krivine
The Curry-Howard Correspondence in Set Theory - Kenneth L. McMillan
Some Strategies for Proving Theorems with a Model Checker - Bart Selman
Satisfiability Testing: Recent Developments and Challenge Problems
Invited Papers
- Ronald Fagin
Logic, Complexity, and GamesMore Information... - Saul A. Kripke
From the Church-Turing Thesis to the First-Order Algorithm TheoremMore Information... - Jean-Louis Krivine
The Curry-Howard Correspondence in Set TheoryMore Information... - Kenneth L. McMillan
Some Strategies for Proving Theorems with a Model CheckerMore Information... - Bart Selman
Satisfiability Testing: Recent Developments and Challenge ProblemsMore Information...
Presented Papers
Entries are ordered by surname of first author
- Parosh A. Abdulla Aletta Nylén
Better is Better than Well: On Efficient Verification of Infinite-State SystemsMore Information... - Klaus Aehlig Helmut Schwichtenberg
A Syntactical Analysis of Non-Size-Increasing Polynomial Time ComputationMore Information... - Foto N. Afrati Hans Leiß Michel de Rougemont
Definability and CompressionMore Information... - Clifford Bergman Giora Slutzki
Computational Complexity of Some Problems Involving Congruences on AlgebrasMore Information... - Lars Birkedal
A General Notion of RealizabilityMore Information... - Bard Bloom Wan Fokkink Rob J. van Glabbeek
Precongruence Formats for Decorated Trace PreordersMore Information... - Achim Blumensath Erich Grädel
Automatic StructuresMore Information... - Samuel R. Buss Bruce M. Kapron
Resource-Bounded Continuity and Sequentiality for Type-Two FunctionalsMore Information... - Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini Moshe Y. Vardi
View-Based Query Processing and Constraint SatisfactionMore Information... - Gian Luca Cattani Peter Sewell
Models for Name-Passing Processes: Interleaving and CausalMore Information... - Juliusz Chroboczek
Game Semantics and SubtypingMore Information... - Vincent Danos Russell Harmer
Probabilistic Game SemanticsMore Information... - Luca de Alfaro Thomas A. Henzinger
Concurrent Omega-Regular GamesMore Information... - Josée Desharnais Prakash Panangaden Radha Jagadeesan Vineet Gupta
Approximating Labeled Markov ProcessesMore Information... - E. Allen Emerson John W. Havlicek Richard J. Trefler
Virtual Symmetry ReductionMore Information... - Guillem Godoy Robert Nieuwenhuis
Paramodulation with Built-In Abelian GroupsMore Information... - Erich Grädel Colin Hirsch Martin Otto
Back and Forth between Guarded and Modal LogicsMore Information... - Martin Grohe Luc Segoufin
On First-Order Topological QueriesMore Information... - Alan Jeffrey Julian Rathke
A Theory of Bisimulation for a Fragment of Concurrent ML with Local NamesMore Information... - Konstantin Korovin Andrei Voronkov
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix OrderingMore Information... - Kjell Lemström Lauri Hella
Approximate Pattern Matching is Expressible in Transitive Closure LogicMore Information... - Steven Lindell Scott Weinstein
The Role of Decidability in First Order Separations over Classes of Finite StructuresMore Information... - Alexandre Miquel
A Model for Impredicative Type Systems, Universes, Intersection Types and SubtypingMore Information... - Ben C. Moszkowski
A Complete Axiomatization of Interval Temporal Logic with Infinite TimeMore Information... - Andrzej S. Murawski C.-H. Luke Ong
Dominator Trees and Fast Verification of Proof NetsMore Information... - Hiroshi Nakano
A Modality for RecursionMore Information... - Jens Palsberg Tian Zhao
Efficient and Flexible Matching of Recursive TypesMore Information... - Frédéric Prost
A Static Calculus of Dependencies for the λ-CubeMore Information... - Mark Reynolds
More Past GloriesMore Information... - Tatiana Rybina Andrei Voronkov
A Decision Procedure for Term Algebras with QueuesMore Information... - Alex K. Simpson Gordon D. Plotkin
Complete Axioms for Categorical Fixed-Point OperatorsMore Information... - Andrei Voronkov
How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent CalculiMore Information... - Hongwei Xi
Imperative Programming with Dependent TypesMore Information... - Nobuko Yoshida Matthew Hennessy
Assigning Types to ProcessesMore Information...
Organizers
General ChairJohn C. Mitchell Program ChairMartín Abadi Publicity ChairMartin Grohe |
Program Committee:Pierre-Louis Curien (CNRS & U. Paris 7); Rocco De Nicola (U. Florence); Javier Esparza (U. Munich); Marcelo P. Fiore (U. Sussex); Harald Ganzinger (MPI Informatik); Joseph Y. Halpern (Cornell U.); Martin Hofmann (U. Edinburgh); Bart Jacobs (U. Nijmegen); Orna Kupferman (Hebrew U.); Kim G. Larsen (Aalborg U.); Leonid Libkin (Bell Labs); James F. Lynch (Clarkson U.); Vincent van Oostrom (U. Utrecht & CWI); Frank Pfenning (CMU); Benjamin C. Pierce (U. Penn); Jon G. Riecke (Bell Labs); Igor Walukiewicz (Warsaw U.) Organizing CommitteeMartín Abadi; Alok Aggarwal; Marc Bezem; Edmund M. Clarke; Robert L. Constable; Nachum Dershowitz; Josep Díaz; Harald Ganzinger; Fausto Giunchiglia; Martin Grohe; Daniel Leivant; Leonid Libkin; Giuseppe Longo; Donald A. Martin; John C. Mitchell (chair); Eugenio Moggi; Vaughan R. Pratt; Simona Ronchi della Rocca; Jerzy Tiuryn; Moshe Y. Vardi; Jeffrey S. Vitter; Glynn Winskel Advisory BoardMartín Abadi; Serge Abiteboul; Samson Abramsky; Mariangiola Dezani-Ciancaglini; Joseph Y. Halpern; Russell Impagliazzo; Dexter C. Kozen; Leszek Pacholski; Andre Scedrov; Dana S. Scott; Jeannette M. Wing |