LICS A*

44 papers

YearTitle / Authors
2011A Decidable Two-Way Logic on Data Words.
Diego Figueira
2011A Tetrachotomy for Positive First-Order Logic without Equality.
Florent R. Madelaine, Barnaby Martin
2011A Type System for Complexity Flow Analysis.
Jean-Yves Marion
2011A Why-on-Earth Tutorial on Finite Model Theory.
Albert Atserias
2011Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
2011Automata with Group Actions.
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
2011CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory.
Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, Qian Wang
2011Complexity of Two-Variable Dependence Logic and IF-Logic.
Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema
2011Computational Complexity of Quantum Satisfiability.
Christian Herrmann, Martin Ziegler
2011Computing Optimal Coverability Costs in Priced Timed Petri Nets.
Parosh Aziz Abdulla, Richard Mayr
2011Concurrent Strategies.
Silvain Rideau, Glynn Winskel
2011Continuous Random Variables.
Jean Goubault-Larrecq, Daniele Varacca
2011Decidability of Definability.
Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2011First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees.
Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring
2011Forcing as a Program Transformation.
Alexandre Miquel
2011Formalizing Randomized Matching Algorithms.
Dai Tri Man Le, Stephen A. Cook
2011Game Semantics for Good General References.
Andrzej S. Murawski, Nikos Tzevelekos
2011Higher-Order Model Checking: From Theory to Practice.
Naoki Kobayashi
2011Imperative Programs as Proofs via Game Semantics.
Martin Churchill, James Laird, Guy McCusker
2011Isomorphisms of Types in the Presence of Higher-Order References.
Pierre Clairambault
2011Languages of Dot-Depth One over Infinite Words.
Manfred Kufleitner, Alexander Lauser
2011Linear Dependent Types and Relative Completeness.
Ugo Dal Lago, Marco Gaboardi
2011Listings and Logics.
Yijia Chen, Jörg Flum
2011Logic in Software, Dynamical and Biological Systems.
Ashish Tiwari
2011Noncomputable Conditional Distributions.
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
2011Powermonads and Tensors of Unranked Effects.
Sergey Goncharov, Lutz Schröder
2011Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada
2011Proof Nets for Additive Linear Logic with Units.
Willem Heijltjes
2011Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results.
Toniann Pitassi
2011Qualitative Tree Languages.
Arnaud Carayol, Axel Haddad, Olivier Serre
2011Regular Repair of Specifications.
Michael Benedikt, Gabriele Puppis, Cristian Riveros
2011Rigorous Approximated Determinization of Weighted Automata.
Benjamin Aminof, Orna Kupferman, Robby Lampert
2011Semantics of Higher-Order Quantum Computation via Geometry of Interaction.
Ichiro Hasuo, Naohiko Hoshino
2011Separation Logic in the Presence of Garbage Collection.
Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis
2011Temporal Specifications with Accumulative Values.
Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
2011The Complexity of Evaluating First-Order Sentences over a Fixed Structure.
Andrei A. Krokhin
2011The Complexity of Verifying Ground Tree Rewrite Systems.
Stefan Göller, Anthony Widjaja Lin
2011The Computational Meaning of Probabilistic Coherence Spaces.
Thomas Ehrhard, Michele Pagani, Christine Tasson
2011The Dichotomy for Conservative Constraint Satisfaction Problems Revisited.
Libor Barto
2011The Meaning of Semantics.
Prakash Panangaden
2011The Ultimate Undecidability Result for the Halpern-Shoham Logic.
Jerzy Marcinkowski, Jakub Michaliszyn
2011Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera
2011Ultrametric Semantics of Reactive Programs.
Neelakantan R. Krishnaswami, Nick Benton
2011What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL.
Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco