default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th LICS 2011: Toronto, Ontario, Canada
- Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada. IEEE Computer Society 2011, ISBN 978-0-7695-4412-0
Tutorials
- Albert Atserias:
A Why-on-Earth Tutorial on Finite Model Theory. 3 - Prakash Panangaden:
The Meaning of Semantics. 4-5
Invited Talk
- Ashish Tiwari:
Logic in Software, Dynamical and Biological Systems. 9-10
Logic and Automata I
- Arnaud Carayol, Axel Haddad, Olivier Serre:
Qualitative Tree Languages. 13-22 - Manfred Kufleitner
, Alexander Lauser:
Languages of Dot-Depth One over Infinite Words. 23-32 - Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. 33-42 - Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. 43-52
Semantics I
- Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring:
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees. 55-64 - Martin Churchill, James Laird, Guy McCusker:
Imperative Programs as Proofs via Game Semantics. 65-74 - Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Good General References. 75-84
Probabilistic Computation
- Thomas Ehrhard, Michele Pagani, Christine Tasson:
The Computational Meaning of Probabilistic Coherence Spaces. 87-96 - Jean Goubault-Larrecq, Daniele Varacca:
Continuous Random Variables. 97-106 - Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
Noncomputable Conditional Distributions. 107-116
Invited Talk
- Toniann Pitassi:
Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results. 119
Type Theory
- Jean-Yves Marion:
A Type System for Complexity Flow Analysis. 123-132 - Ugo Dal Lago, Marco Gaboardi:
Linear Dependent Types and Relative Completeness. 133-142 - Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, Qian Wang:
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory. 143-151 - Pierre Clairambault:
Isomorphisms of Types in the Presence of Higher-Order References. 152-161
Complexity
- Yijia Chen, Jörg Flum:
Listings and Logics. 165-174 - Christian Herrmann, Martin Ziegler:
Computational Complexity of Quantum Satisfiability. 175-184 - Dai Tri Man Le, Stephen A. Cook:
Formalizing Randomized Matching Algorithms. 185-194
Proof Theory and Linear Logic
- Alexandre Miquel:
Forcing as a Program Transformation. 197-206 - Willem Heijltjes:
Proof Nets for Additive Linear Logic with Units. 207-216
Invited Tal
- Naoki Kobayashi:
Higher-Order Model Checking: From Theory to Practice. 219-224
Semantics II
- Sergey Goncharov, Lutz Schröder:
Powermonads and Tensors of Unranked Effects. 227-236 - Ichiro Hasuo, Naohiko Hoshino:
Semantics of Higher-Order Quantum Computation via Geometry of Interaction. 237-246 - Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis:
Separation Logic in the Presence of Garbage Collection. 247-256 - Neelakantan R. Krishnaswami, Nick Benton:
Ultrametric Semantics of Reactive Programs. 257-266
Decidability and Complexity
- Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen:
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. 269-278 - Stefan Göller, Anthony Widjaja Lin:
The Complexity of Verifying Ground Tree Rewrite Systems. 279-288 - Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of Two-Variable Dependence Logic and IF-Logic. 289-298
Constraint Satisfaction and Related Problems
- Libor Barto:
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited. 301-310 - Florent R. Madelaine, Barnaby Martin:
A Tetrachotomy for Positive First-Order Logic without Equality. 311-320 - Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of Definability. 321-328
Invited Talk
- Andrei A. Krokhin:
The Complexity of Evaluating First-Order Sentences over a Fixed Structure. 331
Logic and Automata II
- Michael Benedikt, Gabriele Puppis, Cristian Riveros:
Regular Repair of Specifications. 335-344 - Benjamin Aminof, Orna Kupferman, Robby Lampert:
Rigorous Approximated Determinization of Weighted Automata. 345-354 - Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata with Group Actions. 355-364 - Diego Figueira:
A Decidable Two-Way Logic on Data Words. 365-374
Halpern-Shoham Logic
- Jerzy Marcinkowski, Jakub Michaliszyn:
The Ultimate Undecidability Result for the Halpern-Shoham Logic. 377-386 - Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco:
What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL. 387-396
Concurrency
- Parosh Aziz Abdulla, Richard Mayr:
Computing Optimal Coverability Costs in Priced Timed Petri Nets. 399-408 - Silvain Rideau, Glynn Winskel:
Concurrent Strategies. 409-418
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-27 23:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
