25. CSL 2011:
Bergen,
Norway
Marc Bezem (Ed.):
Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings.
LIPIcs 12 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011, ISBN 978-3-939897-32-3 
- Frontmatter, Table of Contents, Preface, Conference Organization.
- Thomas Ehrhard:
Resource Lambda-Calculus: the Differential Viewpoint.
1
- Martin Otto:
The Freedoms of Guarded Bisimulation.
2
- Moshe Y. Vardi:
Branching vs. Linear Time: Semantical Perspective.
3
- Frank Wolter:
Ontology-Based Data Access and Constraint Satisfaction.
4
- Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Power-Set Functors and Saturated Trees.
5-19
- Federico Aschieri:
Transfinite Update Procedures for Predicative Systems of Analysis.
20-34
- Romain Beauxis, Samuel Mimram:
A Non-Standard Semantics for Kahn Networks in Continuous Time.
35-50
- Alexis Bernadet, Stéphane Lengrand:
Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism.
51-66
- Alexis Bès, Olivier Carton:
Algebraic Characterization of FO for Scattered Linear Orderings.
67-81
- Udi Boker, Thomas A. Henzinger:
Determinizing Discounted-Sum Automata.
82-96
- Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Giulio Manzonetto:
Full Abstraction for Resource Calculus with Tests.
97-111
- Yang Cai, Ting Zhang:
Tight Upper Bounds for Streett and Parity Complementation.
112-128
- Domenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo:
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics.
129-143
- Luca Cardelli, Kim G. Larsen, Radu Mardare:
Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas.
144-158
- Kaustuv Chaudhuri, Nicolas Guenot, Lutz Straßburger:
The Focused Calculus of Structures.
159-173
- Lukasz Czajka:
A Semantic Approach to Illative Combinatory Logic.
174-188
- Arnaud Durand, Yann Strozecki:
Enumeration Complexity of Logical Query Problems with Second-order Variables.
189-202
- László Egri:
On Constraint Satisfaction Problems below P.
203-217
- Kord Eickmeyer:
Non-Definability Results for Randomised First-Order Logic.
218-232
- Martín Hötzel Escardó, Paulo Oliva, Thomas Powell:
System T and the Product of Selection Functions.
233-247
- Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Unifying Büchi Complementation Constructions.
248-263
- Wladimir Fridman, Christof Löding, Martin Zimmermann:
Degrees of Lookahead in Context-free Infinite Games.
264-276
- Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner:
L-Recursion and a new Logic for Logarithmic Space.
277-291
- Alan Jeffrey, Julian Rathke:
The Lax Braided Structure of Streaming I/O.
292-306
- Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell:
The Church Synthesis Problem with Metric.
307-321
- Alexander Kartzow:
A Pumping Lemma for Collapsible Pushdown Graphs of Level 2.
322-336
- Emanuel Kieronski:
Decidability Issues for Two-Variable Logics with Several Linear Orders.
337-351
- Ekaterina Komendantskaya, John Power:
Coalgebraic Derivations in Logic Programming.
352-366
- Eryk Kopczynski:
Trees in Trees: Is the Incomplete Information about a Tree Consistent?.
367-380
- Dai Tri Man Le, Stephen A. Cook, Yuli Ye:
A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem.
381-395
- Steffen Lösch, Andrew M. Pitts:
Relating Two Semantics of Locally Scoped Names.
396-411
- Yoad Lustig, Sumit Nain, Moshe Y. Vardi:
Synthesis from Probabilistic Components.
412-427
- Parthasarathy Madhusudan:
Synthesizing Reactive Programs.
428-442
- Sara Miner More, Pavel Naumov, Benjamin Sapp:
Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence.
443-457
- Andrew Polonsky:
Axiomatizing the Quote.
458-469
- Bernhard Reus, Thomas Streicher:
Relative Completeness for Logics of Functional Programs.
470-480
- Andreas Schnabl, Jakob Grue Simonsen:
The Exact Hardness of Deciding Derivational and Runtime Complexity.
481-495
- Daniel Schwencke:
A Category Theoretic View of Nondeterministic Recursive Program Schemes.
496-511
- Jan Schwinghammer, Lars Birkedal:
Step-Indexed Relational Reasoning for Countable Nondeterminism.
512-524
- Howard Straubing:
Algebraic Characterization of the Alternation Hierarchy in FO2[<] on Finite Words.
525-537
- Makoto Tatsuta, Stefano Berardi:
Non-Commutative Infinitary Peano Arithmetic.
538-552
- Johann A. Makowsky:
Model Theory in Computer Science: My Own Recurrent Themes.
553-567
Last update Thu May 24 04:15:27 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
