LICS 2007 Accepted Papers

============================================================================================
The following papers (listed in random order) have been accepted at LICS 2007:
============================================================================================

Pawel Idziak, Petar Markovic, Ralph McKenzie, Matt Valeriote and Ross
Willard. Tractability and learnability arising from algebras with few
subpowers

Paulo Oliva. Modified Realizability Interpretation of Classical Linear Logic

Steven James Perron. Examining The Fragments of G

Cristiano Calcagno, Peter O'Hearn and Hongseok Yang. Local Action and
Abstract Separation Logic

Martin Escardo. Infinite sets that admit fast exhaustive search

Detlef Kaehler, Ralf Kuesters and Tomasz Truderung. Infinite State
AMC-Model Checking for Cryptographic Protocols

Nikos Tzevelekos. Full abstraction for nominal general references

Bartek Klin. Bialgebraic operational semantics and modal logic

Phuong Nguyen and Stephen A. Cook. The Complexity of Proving the
Discrete Jordan Curve Theorem

Naoki Kobayashi, Davide Sangiorgi and Eijiro Sumii. Environment
Bisimulations for Higher-Order Languages

Paul-André Melliès and Nicolas Tabareau. Resource Modalities in Game
Semantics

Phuong Nguyen. Separating DAG-Like and Tree-Like Proof Systems

Francois Pottier. Static Name Control for FreshML

Hugo Gimbert and Wieslaw Zielonka. Limits of Multi–Discounted Markov
Decision Processes

Ulrich Schoepp. Stratified Bounded Affine Logic for Logarithmic Space

Marcello Bonsangue and Alexander Kurz. Pi-Calculus in Logical Form

Jean Goubault-Larrecq. Well Topologies

Rajeev Alur, Marcelo Arenas, Pablo Barcelo, Kousha Etessami, Neil
Immerman and Leonid Libkin. First-order and Temporal Logics for Nested Words

Salvatore La Torre, Madhusudan Parthasarathy and GENNARO PARLATO. A
Robust Class of Context-Sensitive Languages

Patrick Baillot, Paolo Coppola and Ugo Dal Lago. Light Logics and
Optimal Reduction: Completeness and Complexity

Angelo Montanari and Gabriele Puppis. A Contraction Method to Decide MSO
Theories of Trees

Francesco Ranzato and Francesco Tapparo. A New Efficient Simulation
Equivalence Algorithm

James Brotherston and Alex Simpson. Complete Sequent Calculi for
Induction and Infinite Descent

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan and
Chenyi Zhang. Characterising Testing Preorders for Finite Probabilistic
Processes

Balder ten Cate, Jouko Vaananen and Johan van Benthem. Lindstrom
theorems for fragments of first-order logic

Mika Cohen and Mads Dam. A Complete Axiomatization of Knowledge and
Cryptography

Wojciech Moczydlowski. A Dependent Set Theory

Rasmus Ejlers Mogelberg and Alex Simpson. Relational Parametricity for
Computational Effects

Anuj Dawar, Martin Grohe and Stephan Kreutzer. Locally Excluding a Minor

Mikolaj Bojanczyk. Two-way unary temporal logic over trees

Paul Brauner, Clément Houtmann and Claude Kirchner. Principles of
Superdeduction

Manuel Bodirsky and Hubie Chen. Quantified Equality Constraints

Patricia Bouyer, Nicolas Markey, Joel Ouaknine and James Worrell. The
Cost of Punctuality

Andreas Abel, Thierry Coquand and Peter Dybjer. Dependent Types with
Universes via Normalization-by-Evaluation

Abbas Edalat. A Computable Approach to Measure and Integration Theory

Colin Riba. Strong Normalization as Safe Interaction

Laszlo Egri, Benoit Larose and Pascal Tesson. Symmetric Datalog and
Constraint Satisfaction Problems in Logspace

Luca de Alfaro, Rupak Majumdar, Vishwanath Raman and Marielle Stoelinga.
Game Relations and Metrics

Marcin Jurdzinski and Ranko Lazic. Alternation-Free Modal Mu-Calculus
for Data Trees