21. LICS 2006: Seattle, WA, USA

21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. IEEE Computer Society 2006 BibTeX

Introduction

Randal E. Bryant:
Formal Verification of Infinite State Systems Using Boolean Methods. 3-4
Electronic Edition (link) BibTeX

Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David:
Two-Variable Logic on Words with Data. 7-16
Electronic Edition (link) BibTeX
Stéphane Demri, Ranko Lazic:
LTL with the Freeze Quantifier and Register Automata. 17-26
Electronic Edition (link) BibTeX
Guoqiang Pan, Moshe Y. Vardi:
Fixed-Parameter Hierarchies inside PSPACE. 27-36
Electronic Edition (link) BibTeX
Martin Otto:
The Boundedness Problem for Monadic Universal First-Order Logic. 37-48
Electronic Edition (link) BibTeX

Marcelo P. Fiore, Sam Staton:
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. 49-58
Electronic Edition (link) BibTeX
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, Björn Victor:
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. 59-68
Electronic Edition (link) BibTeX
Filippo Bonchi, Barbara König, Ugo Montanari:
Saturated Semantics for Reactive Systems. 69-80
Electronic Edition (link) BibTeX

C.-H. Luke Ong:
On Model-Checking Trees Generated by Higher-Order Recursion Schemes. 81-90
Electronic Edition (link) BibTeX
Dietrich Kuske, Markus Lohrey:
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. 91-100
Electronic Edition (link) BibTeX
Vineet Kahlon, Aarti Gupta:
An Automata-Theoretic Approach for Model Checking Threads for LTL Propert. 101-110
Electronic Edition (link) BibTeX
Tachio Terauchi, Alex Aiken:
On Typability for Rank-2 Intersection Types with Polymorphic Recursion. 111-122
Electronic Edition (link) BibTeX

Adam Barth, John C. Mitchell:
Managing Digital Rights using Linear Logic. 127-136
Electronic Edition (link) BibTeX
Matthew J. Parkinson, Richard Bornat, Cristiano Calcagno:
Variables as Resource in Hoare Logics. 137-146
Electronic Edition (link) BibTeX
Jonathan Hayman, Glynn Winskel:
Independence and Concurrent Separation Logic. 147-156
Electronic Edition (link) BibTeX
Daniel Leivant:
Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. 157-168
Electronic Edition (link) BibTeX

Ugo Dal Lago:
Context Semantics, Linear Logic and Computational Complexity. 169-178
Electronic Edition (link) BibTeX
Olivier Laurent, Lorenzo Tortora de Falco:
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity. 179-188
Electronic Edition (link) BibTeX
Alexis Maciel, Toniann Pitassi:
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. 189-200
Electronic Edition (link) BibTeX

Benoit Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. 201-210
Electronic Edition (link) BibTeX
Laura Chaubard, Jean-Eric Pin, Howard Straubing:
First Order Formulas with Modular Ppredicates. 211-220
Electronic Edition (link) BibTeX
Emil W. Kiss, Matthew Valeriote:
On Tractability and Congruence Distributivity. 221-230
Electronic Edition (link) BibTeX
Lutz Schröder, Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics. 231-242
Electronic Edition (link) BibTeX

Orna Kupferman:
Avoiding Determinization. 243-254
Electronic Edition (link) BibTeX

Nir Piterman:
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata. 255-264
Electronic Edition (link) BibTeX
Orna Kupferman, Moshe Y. Vardi:
Memoryful Branching-Time Logic. 265-274
Electronic Edition (link) BibTeX
Nir Piterman, Amir Pnueli:
Faster Solutions of Rabin and Streett Games. 275-284
Electronic Edition (link) BibTeX
Mikolaj Bojanczyk, Thomas Colcombet:
Bounds in w-Regularity. 285-296
Electronic Edition (link) BibTeX

Søren B. Lassen:
Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus. 297-306
Electronic Edition (link) BibTeX
Thierry Coquand, Arnaud Spiwack:
A Proof of Strong Normalisation using Domain Theory. 307-316
Electronic Edition (link) BibTeX
Giulio Manzonetto, Antonino Salibra:
Boolean Algebras for Lambda Calculus. 317-326
Electronic Edition (link) BibTeX
Makoto Tatsuta, Mariangiola Dezani-Ciancaglini:
Normalisation is Insensible to lambda-Term Identity or Difference. 327-338
Electronic Edition (link) BibTeX

John W. Dawson:
Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel's Impact on Logic, Mathematics, and Computer Science. 339-341
Electronic Edition (link) BibTeX

Andrew D. Gordon:
Provable Implementations of Security Protocols. 345-346
Electronic Edition (link) BibTeX

Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Stochastic Games with Branching-Time Winning Objectives. 349-358
Electronic Edition (link) BibTeX
Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes. 359-366
Electronic Edition (link) BibTeX
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Control in o-minimal Hybrid Systems. 367-378
Electronic Edition (link) BibTeX

Thomas Ball, Orna Kupferman:
An Abstraction-Refinement Framework for Multi-Agent Systems. 379-388
Electronic Edition (link) BibTeX
Daniele Varacca, Hagen Völzer:
Temporal Logics and Model Checking for Fairly Correct Systems. 389-398
Electronic Edition (link) BibTeX
Sharon Shoham, Orna Grumberg:
3-Valued Abstraction: More Precision at Less Cost. 399-410
Electronic Edition (link) BibTeX

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Approximation Schemes for First-Order Definable Optimisation Problems. 411-420
Electronic Edition (link) BibTeX
Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. 421-430
Electronic Edition (link) BibTeX