LIPIcs, Volume 12, CSL 2011

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