LICS 2011 Accepted Papers

Juha Kontinen, Antti Kuusisto, Peter Lohmann and Jonni Virtema. Complexity of two-variable Dependence Logic and IF-Logic
Manuel Bodirsky, Michael Pinsker and Todor Tsankov. Decidability of Definability
Thomas Ehrhard, Michele Pagani and Christine Tasson. The Computational Meaning of Probabilistic Coherence Spaces
Richard Mayr and Parosh Abdulla. Computing Optimal Coverability Costs in Priced Timed Petri Nets
Yijia Chen and Jörg Flum. Listings and logics
Nathanael L. Ackerman, Cameron E. Freer and Daniel M. Roy. Noncomputable conditional distributions
Stefan Göller and Anthony Widjaja Lin. The Complexity of Verifying Ground Tree Rewrite Systems
Arnaud Carayol, Axel Haddad and Olivier Serre. Qualitative Tree Languages
Florent Madelaine and Barnaby Martin. A tetrachotomy for positive first-order logic without equality
Dai Tri Man Le and Stephen A. Cook. Formalizing Randomized Matching Algorithms
Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger and Orna Kupferman. Temporal Specifications with Accumulative Values
Jean Goubault-Larrecq and Daniele Varacca. Continuous Random Variables
Sergey Goncharov and Lutz Schröder. Powermonads and Tensoring Unranked Effects
Silvain Rideau and Glynn Winskel. Concurrent strategies
Manfred Kufleitner and Alexander Lauser. Languages of Dot-Depth One over Infinite Words
Diego Figueira, Santiago Figueira, Sylvain Schmitz and Philippe Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
Jakub Michaliszyn and Jerzy Marcinkowski. The Ultimate Undecidability Result for the Halpern-Shoham Logic
Nikos Tzevelekos and Andrzej Murawski. Game semantics for good general references
Jean-Yves Marion. A type system for complexity flow analysis
Christian Herrmann and Martin Ziegler. Computational Complexity of Quantum Satisfiability
Pierre Clairambault. Isomorphisms of types in the presence of higher-order references
Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer and Kristian Støvring. First steps in synthetic guarded domain theory: step-indexing in the topos of trees
Diego Figueira. A decidable two-way logic on data words
Martin Churchill, James Laird and Guy McCusker. Imperative Programs as Proofs via Game Semantics
Davide Bresolin, Angelo Montanari, Pietro Sala and Guido Sciavicco. What's decidable about Halpern and Shoham's interval logic? The maximal fragment ABBL
Ichiro Hasuo and Naohiko Hoshino. Semantics of Higher-Order Quantum Computation via Geometry of Interaction
Tomas Brazdil, Vaclav Brozek, Krishnendu Chatterjee, Vojtech Forejt and Antonin Kucera. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes
Ugo Dal Lago and Marco Gaboardi. Linear Dependent Types and Relative Completeness
Chung-Kil Hur, Derek Dreyer and Viktor Vafeiadis. Separation Logic in the Presence of Garbage Collection
Alexandre Miquel. Forcing as a program transformation
Neelakantan Krishnaswami and Nick Benton. Ultrametric Semantics of Reactive Programs
Mikołaj Bojańczyk, Bartek Klin and Sławomir Lasota. Automata with group actions
Libor Barto. The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
Willem Heijltjes. Proof nets for additive linear logic with units
Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub and Qian Wang. COQ MTU : a higher-order type theory with a predicative hierachy of universes parameterized by a decidable first-order theory
Michael Benedikt, Gabriele Puppis and Cristian Riveros. Regular Repair of Specifications
Benjamin Aminof, Orna Kupferman and Robby Lampert. Rigorous Approximated Determinization of Weighted Automata