<h2>LIPIcs, Volume 12, CSL 2011</h2>
<ul>
<li>
<span class="authors">Marc Bezem</span>
<span class="title">LIPIcs, Volume 12, CSL'11, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011">10.4230/LIPIcs.CSL.2011</a>
</li>
<li>
<span class="authors">Marc Bezem</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.i">10.4230/LIPIcs.CSL.2011.i</a>
</li>
<li>
<span class="authors">Thomas Ehrhard</span>
<span class="title">Resource Lambda-Calculus: the Differential Viewpoint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.1">10.4230/LIPIcs.CSL.2011.1</a>
</li>
<li>
<span class="authors">Martin Otto</span>
<span class="title">The Freedoms of Guarded Bisimulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.2">10.4230/LIPIcs.CSL.2011.2</a>
</li>
<li>
<span class="authors">Moshe Y. Vardi</span>
<span class="title">Branching vs. Linear Time: Semantical Perspective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.3">10.4230/LIPIcs.CSL.2011.3</a>
</li>
<li>
<span class="authors">Frank Wolter</span>
<span class="title">Ontology-Based Data Access and Constraint Satisfaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.4">10.4230/LIPIcs.CSL.2011.4</a>
</li>
<li>
<span class="authors">Jiri Adamek, Stefan Milius, Lawrence S. Moss, and Lurdes Sousa</span>
<span class="title">Power-Set Functors and Saturated Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.5">10.4230/LIPIcs.CSL.2011.5</a>
</li>
<li>
<span class="authors">Federico Aschieri</span>
<span class="title">Transfinite Update Procedures for Predicative Systems of Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.20">10.4230/LIPIcs.CSL.2011.20</a>
</li>
<li>
<span class="authors">Romain Beauxis and Samuel Mimram</span>
<span class="title">A Non-Standard Semantics for Kahn Networks in Continuous Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.35">10.4230/LIPIcs.CSL.2011.35</a>
</li>
<li>
<span class="authors">Alexis Bernadet and Stéphane Lengrand</span>
<span class="title">Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.51">10.4230/LIPIcs.CSL.2011.51</a>
</li>
<li>
<span class="authors">Alexis Bès and Olivier Carton</span>
<span class="title">Algebraic Characterization of FO for Scattered Linear Orderings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.67">10.4230/LIPIcs.CSL.2011.67</a>
</li>
<li>
<span class="authors">Udi Boker and Thomas A. Henzinger</span>
<span class="title">Determinizing Discounted-Sum Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.82">10.4230/LIPIcs.CSL.2011.82</a>
</li>
<li>
<span class="authors">Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, and Giulio Manzonetto</span>
<span class="title">Full Abstraction for Resource Calculus with Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.97">10.4230/LIPIcs.CSL.2011.97</a>
</li>
<li>
<span class="authors">Yang Cai and Ting Zhang</span>
<span class="title">Tight Upper Bounds for Streett and Parity Complementation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.112">10.4230/LIPIcs.CSL.2011.112</a>
</li>
<li>
<span class="authors">Domenico Cantone, Cristiano Longo, and Marianna Nicolosi Asmundo</span>
<span class="title">A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.129">10.4230/LIPIcs.CSL.2011.129</a>
</li>
<li>
<span class="authors">Luca Cardelli, Kim G. Larsen, and Radu Mardare</span>
<span class="title">Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.144">10.4230/LIPIcs.CSL.2011.144</a>
</li>
<li>
<span class="authors">Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger</span>
<span class="title">The Focused Calculus of Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.159">10.4230/LIPIcs.CSL.2011.159</a>
</li>
<li>
<span class="authors">Lukasz Czajka</span>
<span class="title">A Semantic Approach to Illative Combinatory Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.174">10.4230/LIPIcs.CSL.2011.174</a>
</li>
<li>
<span class="authors">Arnaud Durand and Yann Strozecki</span>
<span class="title">Enumeration Complexity of Logical Query Problems with Second-order Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.189">10.4230/LIPIcs.CSL.2011.189</a>
</li>
<li>
<span class="authors">László Egri</span>
<span class="title">On Constraint Satisfaction Problems below P*</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.203">10.4230/LIPIcs.CSL.2011.203</a>
</li>
<li>
<span class="authors">Kord Eickmeyer</span>
<span class="title">Non-Definability Results for Randomised First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.218">10.4230/LIPIcs.CSL.2011.218</a>
</li>
<li>
<span class="authors">Martin Escardo, Paulo Oliva, and Thomas Powell</span>
<span class="title">System T and the Product of Selection Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.233">10.4230/LIPIcs.CSL.2011.233</a>
</li>
<li>
<span class="authors">Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, and Thomas Wilke</span>
<span class="title">Unifying Büchi Complementation Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.248">10.4230/LIPIcs.CSL.2011.248</a>
</li>
<li>
<span class="authors">Wladimir Fridman, Christof Löding, and Martin Zimmermann</span>
<span class="title">Degrees of Lookahead in Context-free Infinite Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.264">10.4230/LIPIcs.CSL.2011.264</a>
</li>
<li>
<span class="authors">Martin Grohe, Berit Grußien, André Hernich, and Bastian Laubner</span>
<span class="title">L-Recursion and a new Logic for Logarithmic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.277">10.4230/LIPIcs.CSL.2011.277</a>
</li>
<li>
<span class="authors">Alan Jeffrey and Julian Rathke</span>
<span class="title">The Lax Braided Structure of Streaming I/O</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.292">10.4230/LIPIcs.CSL.2011.292</a>
</li>
<li>
<span class="authors">Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, and James Worrell</span>
<span class="title">The Church Synthesis Problem with Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.307">10.4230/LIPIcs.CSL.2011.307</a>
</li>
<li>
<span class="authors">Alexander Kartzow</span>
<span class="title">A Pumping Lemma for Collapsible Pushdown Graphs of Level 2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.322">10.4230/LIPIcs.CSL.2011.322</a>
</li>
<li>
<span class="authors">Emanuel Kieronski</span>
<span class="title">Decidability Issues for Two-Variable Logics with Several Linear Orders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.337">10.4230/LIPIcs.CSL.2011.337</a>
</li>
<li>
<span class="authors">Ekaterina Komendantskaya and John Power</span>
<span class="title">Coalgebraic Derivations in Logic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.352">10.4230/LIPIcs.CSL.2011.352</a>
</li>
<li>
<span class="authors">Eryk Kopczynski</span>
<span class="title">Trees in Trees: Is the Incomplete Information about a Tree Consistent?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.367">10.4230/LIPIcs.CSL.2011.367</a>
</li>
<li>
<span class="authors">Dai Tri Man Lê, Stephen A. Cook, and Yuli Ye</span>
<span class="title">A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.381">10.4230/LIPIcs.CSL.2011.381</a>
</li>
<li>
<span class="authors">Steffen Lösch and Andrew M. Pitts</span>
<span class="title">Relating Two Semantics of Locally Scoped Names</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.396">10.4230/LIPIcs.CSL.2011.396</a>
</li>
<li>
<span class="authors">Yoad Lustig, Sumit Nain, and Moshe Y. Vardi</span>
<span class="title">Synthesis from Probabilistic Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.412">10.4230/LIPIcs.CSL.2011.412</a>
</li>
<li>
<span class="authors">Parthasarathy Madhusudan</span>
<span class="title">Synthesizing Reactive Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.428">10.4230/LIPIcs.CSL.2011.428</a>
</li>
<li>
<span class="authors">Sara Miner More, Pavel Naumov, and Benjamin Sapp</span>
<span class="title">Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.443">10.4230/LIPIcs.CSL.2011.443</a>
</li>
<li>
<span class="authors">Andrew Polonsky</span>
<span class="title">Axiomatizing the Quote</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.458">10.4230/LIPIcs.CSL.2011.458</a>
</li>
<li>
<span class="authors">Bernhard Reus and Thomas Streicher</span>
<span class="title">Relative Completeness for Logics of Functional Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.470">10.4230/LIPIcs.CSL.2011.470</a>
</li>
<li>
<span class="authors">Andreas Schnabl and Jakob Grue Simonsen</span>
<span class="title">The Exact Hardness of Deciding Derivational and Runtime Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.481">10.4230/LIPIcs.CSL.2011.481</a>
</li>
<li>
<span class="authors">Daniel Schwencke</span>
<span class="title">A Category Theoretic View of Nondeterministic Recursive Program Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.496">10.4230/LIPIcs.CSL.2011.496</a>
</li>
<li>
<span class="authors">Jan Schwinghammer and Lars Birkedal</span>
<span class="title">Step-Indexed Relational Reasoning for Countable Nondeterminism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.512">10.4230/LIPIcs.CSL.2011.512</a>
</li>
<li>
<span class="authors">Howard Straubing</span>
<span class="title">Algebraic Characterization of the Alternation Hierarchy in FO^2[<] on Finite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.525">10.4230/LIPIcs.CSL.2011.525</a>
</li>
<li>
<span class="authors">Makoto Tatsuta and Stefano Berardi</span>
<span class="title">Non-Commutative Infinitary Peano Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.538">10.4230/LIPIcs.CSL.2011.538</a>
</li>
<li>
<span class="authors">Johann A. Makowsky</span>
<span class="title">Model Theory in Computer Science: My Own Recurrent Themes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2011.553">10.4230/LIPIcs.CSL.2011.553</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing