LICS 2013 Accepted Papers

Jerome Leroux. Presburger Vector Addition Systems
Martin Otto. Groupoids, Hypergraphs, and Symmetries in Finite Models
Matthew Anderson, Anuj Dawar and Bjarki Holm. Linear Programming and Maximum Matching in Fixed-Point Logic with Counting
Ori Lahav. From Frame Properties to Hypersequent Rules in Modal Logics
Pierre-Evariste Dagand and Conor McBride. A Categorical Treatment of Ornaments
Piotr Hofman, Richard Mayr and Patrick Totzke. Decidability of Weak Simulation on One-counter Nets
Kord Eickmeyer, Ken-Ichi Kawarabayashi and Stephan Kreutzer. Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
Stephan Kreutzer and Cristian Riveros. Quantitative Monadic Second-Order Logic
Chuck Liang and Dale Miller. Unifying Classical and Intuitionistic Logics for Computational Control
Hugo Férée, Walid Gomaa and Mathieu Hoyrup. On the query complexity of real functionals
Lars Birkedal and Rasmus Ejlers Møgelberg. Intensional Type Theory with Guarded Recursive Types qua Fixed-Points on Universes
Tomasz Gogacz and Jerzy Marcinkowski. Converging to the Chase -- a Tool for Finite Controllability
Olle Fredriksson and Dan Ghica. Abstract machines for game semantics, revisited
Alessandro Facchini, Yde Venema and Fabio Zanasi. A characterization theorem for the alternation-free fragment of the modal mu-calculus
Jan Hoffmann, Michael Marmar and Zhong Shao. Quantitative Reasoning for Proving Lock-Freedom of Non-Blocking Data Structures
Michael Benedikt, Stefan Goller, Stefan Kiefer and Andrzej Murawski. Bisimilarity of Pushdown Automata is Nonelementary
Andrea Asperti and Jean-Jacques Levy. The cost of usage in the lambda calculus
Dexter Kozen, Kim Guldstrand Larsen, Radu Mardare and Prakash Panangaden. Stone Duality for Markov Processes
Lucas Heimberg, Dietrich Kuske and Nicole Schweikardt. An optimal Gaifman normal form construction for structures of bounded degree
Daniel Hirschkoff, Jean-Marie Madiot and Davide Sangiorgi. Name-passing calculi: from fusions to preorders and types
Naoki Kobayashi. Pumping by Typing
Thomas Colcombet. Cost Functions with Several Order of Magnitudes and the use of Relative Internal Set Theory
Bart Jacobs. Measurable Spaces and their Effect Logic
Alessandro Facchini, Filip Murlak and Michał Skrzypczak. Rabin-Mostowski index problem: a step beyond deterministic automata
Paul Hunter, Joel Ouaknine and James Worrell. Expressive Completeness for Metric Temporal Logic
Jim Laird, Giulio Manzonetto, Guy Mccusker and Michele Pagani. Weighted relational models of typed lambda-calculi
Swarat Chaudhuri, Sriram Sankaranarayanan and Moshe Vardi. Regular Real Analysis
Anudhyan Boral and Sylvain Schmitz. Model-Checking Parse Trees
Colin Riba. Forcing MSO on Infinite Words in Weak MSO
Ashutosh Trivedi, Antoine Durand-Gasselin and Rajeev Alur. From Monadic Second-Order Definable String Transformations to Transducers
James Hales. Arbitrary Action Model Logic and the Synthesis of Action Models
Neil Ghani, Peter Hancock, Lorenzo Malatesta, Fredrik Nordvall Forsberg and Anton Setzer. Fibred Data Types
Jamie Vicary. Topological Structure of Quantum Algorithms
Ioana Domnina Cristescu, Jean Krivine and Daniele Varacca. A Compositional semantics for the reversible pi-calculus
Dirk Pattinson. The Logic of Exact Covers: Completeness and Uniform Interpolation
Angelo Montanari and Pietro Sala. Adding an equivalence relation to the interval logic $\ABB$: complexity and expressiveness
Sergey Goncharov and Lutz Schröder. A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
Stéphane Demri, Diego Figueira and M. Praveen. Reasoning about Data Repetitions with Counter Systems
Benedikt Bollig, Dietrich Kuske and Roy Mennicke. The Complexity of Model Checking Multi-Stack Systems
Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota and Szymon Toruńczyk. Turing Machines with Atoms
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier and Frédéric Servais. From Two-Way to One-Way Finite State Transducers
Beniamino Accattoli. Compressing polarized boxes
Massimo Benerecetti, Fabio Mogavero and Aniello Murano. Substructure Temporal Logic
Jorge Luis Sacchini. Type-Based Productivity of Stream Definitions in the Calculus of Constructions
Jerome Leroux, Vincent Penelle and Grégoire Sutre. On the Context-freeness Problem for Vector Addition Systems
Grigore Rosu, Andrei Stefanescu, Stefan Ciobaca and Brandon Moore. Reachability Logic
Tom Gundersen, Willem Heijltjes and Michel Parigot. Atomic lambda-calculus: a typed lambda-calculus with explicit sharing
Achim Jung and Umberto Rivieccio. Kripke semantics for modal bilattice logic
Philippe Balbiani, Andreas Herzig and Nicolas Troquard. Dynamic logic of propositional assignments: a well-behaved variant of PDL
Gaelle Fontaine. Why is it hard to obtain a dichotomy for consistent query answering?
Tomas Brazdil, Krishnendu Chatterjee, Vojtech Forejt and Antonin Kucera. Trading Performance for Stability in Markov Decision Processes
Fabio Mogavero, Aniello Murano and Luigi Sauro. On the Boundary of Behavioral Strategies
Sam Staton. Instances of computational effects: an algebraic perspective
Witold Charatonik and Piotr Witkowski. Two-variable Logic with Counting and Trees
Makoto Hamana and Marcelo Fiore. Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
Sumit Nain and Moshe Vardi. Solving Partial Information Stochastic Parity Games
Daniel R. Licata and Michael Shulman. Calculating the Fundamental Group of the Circle in Homotopy Type Theory