1. Home
  2. Proceedings
  3. LICS
  4. LICS 2011
Default Cover Image

Logic in Computer Science, Symposium on

June 21 2011 to June 24 2011

Toronto, Ontario Canada

ISSN: 1043-6871

ISBN: 978-0-7695-4412-0

Table of Contents

Papers
Title Page iFreely available from IEEE.pp. i
Papers
Title Page iiiFreely available from IEEE.pp. iii
Papers
[Copyright notice]Freely available from IEEE.pp. iv
Papers
Table of contentsFreely available from IEEE.pp. v-viii
Papers
ForewordFreely available from IEEE.pp. ix-x
Papers
Conference organizationFreely available from IEEE.pp. xi-xii
Papers
List of Additional ReviewersFreely available from IEEE.pp. xiii-xiv
Papers
A Why-on-Earth Tutorial on Finite Model TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 3
by Albert Atserias
Papers
The Meaning of SemanticsFull-text access may be available. Sign in or learn about subscription options.pp. 4-5
by Prakash Panangaden
Papers
Logic in Software, Dynamical and Biological SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 9-10
by Ashish Tiwari
Papers
Qualitative Tree LanguagesFull-text access may be available. Sign in or learn about subscription options.pp. 13-22
by Arnaud Carayol, Axel Hadda, Olivier Serre
Papers
Languages of Dot-Depth One over Infinite WordsFull-text access may be available. Sign in or learn about subscription options.pp. 23-32
by Manfred Kufleitner, Alexander Lauser
Papers
Two Views on Multiple Mean-Payoff Objectives in Markov Decision ProcessesFull-text access may be available. Sign in or learn about subscription options.pp. 33-42
by Tom´š Br´zdil, V´clav Brožek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
Papers
Temporal Specifications with Accumulative ValuesFull-text access may be available. Sign in or learn about subscription options.pp. 43-52
by Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
Papers
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of TreesFull-text access may be available. Sign in or learn about subscription options.pp. 55-64
by Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring
Papers
Imperative Programs as Proofs via Game SemanticsFull-text access may be available. Sign in or learn about subscription options.pp. 65-74
by Martin Churchill, James Laird, Guy McCusker
Papers
Game Semantics for Good General ReferencesFull-text access may be available. Sign in or learn about subscription options.pp. 75-84
by Andrzej S. Murawski, Nikos Tzevelekos
Papers
The Computational Meaning of Probabilistic Coherence SpacesFull-text access may be available. Sign in or learn about subscription options.pp. 87-96
by Thomas Ehrhard, Michele Pagani, Christine Tasson
Papers
Continuous Random VariablesFull-text access may be available. Sign in or learn about subscription options.pp. 97-106
by Jean Goubault-Larrecq, Daniele Varacca
Papers
Noncomputable Conditional DistributionsFull-text access may be available. Sign in or learn about subscription options.pp. 107-116
by Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent ResultsFull-text access may be available. Sign in or learn about subscription options.pp. 119-119
by Toniann Pitassi
Papers
A Type System for Complexity Flow AnalysisFull-text access may be available. Sign in or learn about subscription options.pp. 123-132
by Jean-Yves Marion
Papers
Linear Dependent Types and Relative CompletenessFull-text access may be available. Sign in or learn about subscription options.pp. 133-142
by Ugo Dal Lago, Marco Gaboardi
Papers
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 143-151
by Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, Qian Wang
Papers
Isomorphisms of Types in the Presence of Higher-Order ReferencesFull-text access may be available. Sign in or learn about subscription options.pp. 152-161
by Pierre Clairambault
Papers
Listings and LogicsFull-text access may be available. Sign in or learn about subscription options.pp. 165-174
by Yijia Chen, Jöerg Flum
Papers
Computational Complexity of Quantum SatisfiabilityFull-text access may be available. Sign in or learn about subscription options.pp. 175-184
by Christian Herrmann, Martin Ziegler
Papers
Formalizing Randomized Matching AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 185-194
by Dai Tri Man Lê, Stephen A. Cook
Papers
Forcing as a Program TransformationFull-text access may be available. Sign in or learn about subscription options.pp. 197-206
by Alexandre Miquel
Papers
Proof Nets for Additive Linear Logic with UnitsFull-text access may be available. Sign in or learn about subscription options.pp. 207-216
by Willem Heijltjes
Papers
Higher-Order Model Checking: From Theory to PracticeFull-text access may be available. Sign in or learn about subscription options.pp. 219-224
by Naoki Kobayashi
Papers
Powermonads and Tensors of Unranked EffectsFull-text access may be available. Sign in or learn about subscription options.pp. 227-236
by Sergey Goncharov, Lutz Schröder
Papers
Semantics of Higher-Order Quantum Computation via Geometry of InteractionFull-text access may be available. Sign in or learn about subscription options.pp. 237-246
by Ichiro Hasuo, Naohiko Hoshino
Papers
Separation Logic in the Presence of Garbage CollectionFull-text access may be available. Sign in or learn about subscription options.pp. 247-256
by Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis
Papers
Ultrametric Semantics of Reactive ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 257-266
by Neelakantan R. Krishnaswami, Nick Benton
Papers
Ackermannian and Primitive-Recursive Bounds with Dickson's LemmaFull-text access may be available. Sign in or learn about subscription options.pp. 269-278
by Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Papers
The Complexity of Verifying Ground Tree Rewrite SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 279-288
by Stefan Göller, Anthony Widjaja Lin
Papers
Complexity of Two-Variable Dependence Logic and IF-LogicFull-text access may be available. Sign in or learn about subscription options.pp. 289-298
by Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema
Papers
The Dichotomy for Conservative Constraint Satisfaction Problems RevisitedFull-text access may be available. Sign in or learn about subscription options.pp. 301-310
by Libor Barto
Papers
A Tetrachotomy for Positive First-Order Logic without EqualityFull-text access may be available. Sign in or learn about subscription options.pp. 311-320
by Florent Madelaine, Barnaby Martin
Papers
Decidability of DefinabilityFull-text access may be available. Sign in or learn about subscription options.pp. 321-328
by Manuel Bodirsky, Michael Pinsker, Todor Tsankov
Papers
The Complexity of Evaluating First-Order Sentences over a Fixed StructureFull-text access may be available. Sign in or learn about subscription options.pp. 331
by Andrei Krokhin
Papers
Regular Repair of SpecificationsFull-text access may be available. Sign in or learn about subscription options.pp. 335-344
by Michael Benedikt, Gabriele Puppis, Cristian Riveros
Papers
Rigorous Approximated Determinization of Weighted AutomataFull-text access may be available. Sign in or learn about subscription options.pp. 345-354
by Benjamin Aminof, Orna Kupferman, Robby Lampert
Papers
Automata with Group ActionsFull-text access may be available. Sign in or learn about subscription options.pp. 355-364
by Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
Papers
A Decidable Two-Way Logic on Data WordsFull-text access may be available. Sign in or learn about subscription options.pp. 365-374
by Diego Figueira
Papers
The Ultimate Undecidability Result for the Halpern-Shoham LogicFull-text access may be available. Sign in or learn about subscription options.pp. 377-386
by Jerzy Marcinkowski, Jakub Michaliszyn
Papers
What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBLFull-text access may be available. Sign in or learn about subscription options.pp. 387-396
by Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco
Papers
Computing Optimal Coverability Costs in Priced Timed Petri NetsFull-text access may be available. Sign in or learn about subscription options.pp. 399-408
by Parosh Aziz Abdulla, Richard Mayr
Papers
Concurrent StrategiesFull-text access may be available. Sign in or learn about subscription options.pp. 409-418
by Silvain Rideau, Glynn Winskel
Papers
Author IndexFreely available from IEEE.pp. 419-420
[Roster page]Freely available from IEEE.pp. 422-422
Showing 52 out of 52