List of Papers Accepted at IEEE Symposium On Logic In Computer Science 2005

Geoffrey Washburn and Stephanie Weirich. Generalizing Parametricity Using
Information-flow 

Clemens Kupke and Yde Venema. Closure properties of coalgebra automata

Abbas Edalat and Dirk Pattinson. Inverse and Implicit Functions in Domain
Theory 

Jerome Leroux. A Polynomial Time Presburger Criterion and Synthesis for
Number Decision Diagrams 

Patrice Godefroid and Michael Huth. Model Checking Vs. Generalized Model
Checking: Semantic Minimizations for Temporal Logics 

Giuseppe Castagna, Rocco De Nicola and Daniele Varacca. Semantic Subtyping
for the PI-calculus 

Paul-Andre Mellies and Jerome Vouillon. Recursive polymorphic types and
parametricity in an operational framework 

Pawel Sobocinski and Vladimiro Sassone. Reactive systems over cospans

Anuj Dawar and Martin Otto. Modal Characterisation Theorems over Special
Classes of Frames 

Emanuel Kieronski and Martin Otto. Small Substructures and Decidability
Issues for First-Order Logic with Two Variables 

Richard Mayr, Parosh Abdulla and Noomene Ben Henda. Verifying Infinite
Markov Chains with a Finite Attractor or the Global Coarseness Property 

Hongseok Yang, Lars Birkedal and Noah Torp-Smith. Semantics of
Separation-logic Typing and Higher-order Frame Rules 

Kohei Honda, Martin Berger and Nobuko Yoshida. An Observationally Complete
Logic for Imperative Higher-Order Functions 

Bernd Finkbeiner and Sven Schewe. Uniform Distributed Synthesis

Leonid Libkin and Pablo Barcelo. Temporal Logics over Unranked Trees

Victor Dalmau. Generalized Majority-Minority Operations are Tractable

Glynn Winskel. Name Generation and Linearity

Ugo Dal Lago. The Geometry of Linear Higher-Order Recursion

Maarten Marx and Evan Goris. Looping Caterpillars

Luigi Santocanale. Completions of mu-algebras

Soren Lassen. Normal Form Bisimulation for Call-By-Value Lambda Calculus

Javier Esparza, Antonin Kucera and Richard Mayr. Quantitative Analysis of
Probabilistic Pushdown Automata: Expectations and Variances 

Lutz Strassburger and Francois Lamarche. Constructing free Boolean
categories

Joel Ouaknine and James Worrell. On the Decidability of Metric Temporal
Logic

Martin Escardo and Ho Weng Kin. Operational domain theory and topology of a
sequential programming language 

Albert Atserias. Definability on a Random 3-CNF Formula

Bruno Blanchet, Martin Abadi and Cedric Fournet. Automated Verification of
Selected Equivalences for Security Protocols 

Alexis Saurin. Separation with streams in the $\Lambda\mu$-calculus

Krishnendu Chatterjee, Thomas A. Henzinger and Marcin
Jurdzinski. Mean-Payoff Parity Games 

Hannu Niemisto. On locality and uniform reduction

Claudia Faggian and Francois Maurel. Ludics nets, a model of concurrent
interaction 

Christel Baier and Marcus Groesser. Recognizing omega-regular languages
with probabilistic automata 

Iovka Boneva, Jean-Marc Talbot and Sophie Tison. Expressiveness of a
spatial logic for trees 

Christopher Hardin. Proof Theory for Kleene Algebra

Benjamin Rossman. Existential Positive Types and Preservation under
Homomorphisms 

Paul-Andre Mellies. A fully complete model of propositional linear logic

Markus Lohrey. Model-Checking Hierarchical Structures

Masahito Hasegawa. Relational Parametricity and Control

Martin Hofmann. Proof-theoretic approach to description-logic

Thorsten Altenkirch and Jonathan Grattage. A functional quantum programming
language 

Michael Maher. Herbrand Constraint Abduction

Jos C.M. Baeten and Flavio Corradini. A Characterization of Regular
Expressions in Process Algebra 

Limin Jia, Frances Spalding, David Walker and Neal Glew. Certifying
Compilation for a Language with Stack Allocation 

Albert Atserias. On Digraph Coloring Problems and Treewidth Duality