20. LICS 2005: Chicago, IL, USA

• Front Cover.
  
• Cover Pages.
  
• Prakash Panangaden:
  Foreword.
  
• Conference Organization.
  
• Program Committee.
  
• Additional Reviewers.
  

Session 1

• Glynn Winskel:
  Relations in Concurrency. 2-11
  
• Jos C. M. Baeten, Flavio Corradini:
  Regular Expressions in Process Algebra. 12-19
  

Session 2

• Anuj Dawar, Martin Otto:
  Modal Characterisation Theorems over Special Classes of Frames. 21-30
  
• Pablo Barceló, Leonid Libkin:
  Temporal Logics over Unranked Trees. 31-40
  
• Hannu Niemistö:
  On Locality and Uniform Reduction. 41-50
  
• Evan Goris, Maarten Marx:
  Looping Caterpillars. 51-60
  

Session 3

• Geoffrey Washburn, Stephanie Weirich:
  Generalizing Parametricity Using Information-flow. 62-71
  
• Masahito Hasegawa:
  Relational Parametricity and Control. 72-81
  
• Paul-André Melliès, Jerome Vouillon:
  Recursive Polymorphic Types and Parametricity in an Operational Framework. 82-91
  
• Giuseppe Castagna, Rocco De Nicola, Daniele Varacca:
  Semantic Subtyping for the p-Calculus. 92-101
  

Session 5

• Michael Benedikt:
  An Insider's Guide to Logic in Telecommunications Data. 104-105
  
• Albert Atserias:
  On Digraph Coloring Problems and Treewidth Duality. 106-115
  

Session 6

• Javier Esparza, Antonín Kucera, Richard Mayr:
  Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. 117-126
  
• Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
  Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. 127-136
  
• Christel Baier, Marcus Größer:
  Recognizing omega-regular Languages with Probabilistic Automata. 137-146
  
• Jérôme Leroux:
  A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams. 147-156
  

Session 7

• Patrice Godefroid, Michael Huth:
  Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics. 158-167
  
• Markus Lohrey:
  Model-Checking Hierarchical Structures. 168-177
  
• Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
  Mean-Payoff Parity Games. 178-187
  
• Joël Ouaknine, James Worrell:
  On the Decidability of Metric Temporal Logic. 188-197
  

Session 8

• Clemens Kupke, Yde Venema:
  Closure Properties of Coalgebra Automata. 199-208
  
• François Lamarche, Lutz Straßburger:
  Constructing Free Boolean Categories. 209-218
  
• Luigi Santocanale:
  Completions of µ-algebras. 219-228
  
• Martin Hofmann:
  Proof-Theoretic Approach to Description-Logic. 229-237
  

Session 9

• Jane Hillston:
  Process Algebras for Quantitative Analysis. 239-248
  
• Thorsten Altenkirch, Jonathan Grattage:
  A Functional Quantum Programming Language. 249-258
  

Session 10

• Lars Birkedal, Noah Torp-Smith, Hongseok Yang:
  Semantics of Separation-Logic Typing and Higher-Order Frame Rules. 260-269
  
• Kohei Honda, Nobuko Yoshida, Martin Berger:
  An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules. 270-279
  
• Iovka Boneva, Jean-Marc Talbot, Sophie Tison:
  Expressiveness of a Spatial Logic for Trees. 280-289
  
• Chris Hardin:
  Proof Theory for Kleene Algebra. 290-299
  

Session 11

• Glynn Winskel:
  Name Generation and Linearity. 301-310
  
• Vladimiro Sassone, Pawel Sobocinski:
  Reactive Systems over Cospans. 311-320
  
• Bernd Finkbeiner, Sven Schewe:
  Uniform Distributed Synthesis. 321-330
  
• Bruno Blanchet, Martín Abadi, Cédric Fournet:
  Automated Verification of Selected Equivalences for Security Protocols. 331-340
  

Session 12

• Solomon Feferman:
  Tarski's Influence on Computer Science. 342
  

Session 13

• Walter Fontana:
  Logic and Systems Biology. 344
  
• Soren Lassen:
  Eager Normal Form Bisimulation. 345-354
  

Session 14

• Alexis Saurin:
  Separation with Streams in the lambdaµ-calculus. 356-365
  
• Ugo Dal Lago:
  The Geometry of Linear Higher-Order Recursion. 366-375
  
• Claudia Faggian, François Maurel:
  Ludics Nets, a game Model of Concurrent Interaction. 376-385
  
• Paul-André Melliès:
  Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic. 386-395
  

Session 15

• Michael J. Maher:
  Herbrand Constraint Abduction. 397-406
  
• Limin Jia, Frances Spalding, David Walker, Neal Glew:
  Certifying Compilation for a Language with Stack Allocation. 407-416
  
• Abbas Edalat, Dirk Pattinson:
  Inverse and Implicit Functions in Domain Theory. 417-426
  
• Martín Hötzel Escardó, Weng Kin Ho:
  Operational Domain Theory and Topology of a Sequential Programming Language. 427-436
  

Session 16

• Víctor Dalmau:
  Generalized Majority-Minority Operations are Tractable. 438-447
  
• Emanuel Kieronski, Martin Otto:
  Small Substructures and Decidability Issues for First-Order Logic with Two Variables. 448-457
  
• Albert Atserias:
  Definability on a Random 3-CNF Formula. 458-466
  
• Benjamin Rossman:
  Existential Positive Types and Preservation under Homomorphisisms. 467-476