Talks

CTL* vs. Monadic Datalog

Foto Afrati

Logical Methods in Pointer Aliasing Analysis

Michael Benedikt

Implicit Temporal Query Languages: Towards Completeness

Nicole Bidoit

Stratified mu-Calculus

Witold Charatonik

Automatic Verification based on Decision Diagrams

Rolf Drechsler

Aspects of Model Checking

E. Allen Emerson

An Automata-theoretic Approach to Interprocedural Dataflow Analysis

Javier Esparza

Computing Bisimulation Symbolically

Kathi Fisler

Automatic Structures

Erich Grädel

Descriptive and Parameterized Complexity

Martin Grohe

Reachability Logic

Neil Immerman

Small Progress Measures and Model Checking Games

Marcin Jurdzinski

Database Query Languages - a Finite Model Theory Perspective

Phokion Kolaitis

Variable Independence

Leonid Libkin

Metafinite Monadic Second Order Logic

Janos Makowsky

Unranked Trees in Database Theory

Frank Neven

Finite Model Theory

Martin Otto

Temporal Properties as Models of Constraint Data Bases

Andreas Podelski

Probabilistic Model Checking and Compression

Michel de Rougemont

Capturing LOGSPACE over heriditarily-finite Sets

Vladimir Yu. Sazonov

Inter-Procedural Analysis of Parallel Programs - the Abstract Interpretation Perspective

Helmut Seidl

Games in Verification

Colin Stirling

Recognizability and Constraint Satisfaction

Wolfgang Thomas

Constraint Databases

Jan Van den Bussche

Emptiness of Tree Automata

Moshe Y. Vardi

Linear Time Datalog: Temporal versus Deductive Reasoning in Verification

Helmut Veith

Verifying Protocols for Electronic Commerce

Victor Vianu

Logic on Traces

Igor Walukiewicz

CTL+ is exponentially more succint than CTL

Thomas Wilke

Infinite Structures in Databases and Verification

Pierre Wolper