Marc Bezem
Proceedings of the 20th EACSL Annual Conference / 25th International Workshop on Computer Science Logic
CSL, 2011.

@proceedings{CSL-2011,
	address       = "Bergen, Norway",
	editor        = "Marc Bezem",
	ee            = "http://drops.dagstuhl.de/opus/portals/extern/index.php?semnr=11007",
	isbn          = "978-3-939897-32-3",
	publisher     = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 20th EACSL Annual Conference / 25th International Workshop on Computer Science Logic}",
	volume        = 12,
	year          = 2011,
}

Contents (42 items)

8 ×#logic
5 ×#semantics
4 ×#problem
3 ×#algebra
3 ×#automaton
3 ×#axiom
3 ×#complexity
3 ×#linear
3 ×#order
2 ×#calculus

CSL-2011-Ehrhard #difference #λ-calculus

Resource λ-Calculus: the Differential Viewpoint (TE), p. 1.

CSL-2011-Otto #bisimulation

The Freedoms of Guarded Bisimulation (MO), p. 2.

CSL-2011-Vardi #branch #linear #perspective #semantics

Branching vs. Linear Time: Semantical Perspective (MYV), p. 3.

CSL-2011-Wolter #constraints #data access #ontology

Ontology-Based Data Access and Constraint Satisfaction (FW), p. 4.

CSL-2011-AdamekMMS

Power-Set Functors and Saturated Trees (JA, SM, LSM, LS), pp. 5–19.

CSL-2011-Aschieri #analysis

Transfinite Update Procedures for Predicative Systems of Analysis (FA), pp. 20–34.

CSL-2011-BeauxisM #network #semantics #standard

A Non-Standard Semantics for Kahn Networks in Continuous Time (RB, SM), pp. 35–50.

CSL-2011-BernadetL #modelling #morphism #orthogonal #polymorphism

Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism (AB, SL), pp. 51–66.

CSL-2011-BesC #algebra #linear #order

Algebraic Characterization of FO for Scattered Linear Orderings (AB, OC), pp. 67–81.

CSL-2011-BokerH #automaton

Determinizing Discounted-Sum Automata (UB, TAH), pp. 82–96.

CSL-2011-BucciarelliCEM #abstraction #calculus #testing

Full Abstraction for Resource Calculus with Tests (AB, AC, TE, GM), pp. 97–111.

CSL-2011-CaiZ #bound

Tight Upper Bounds for Streett and Parity Complementation (YC, TZ), pp. 112–128.

CSL-2011-CantoneLA #decidability #logic #order #quantifier #set

A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.

CSL-2011-CardelliLM #axiom #logic #markov #metric

Continuous Markovian Logic — From Complete Axiomatization to the Metric Space of Formulas (LC, KGL, RM), pp. 144–158.

CSL-2011-ChaudhuriGS #calculus

The Focused Calculus of Structures (KC, NG, LS), pp. 159–173.

CSL-2011-Czajka #approach #combinator #logic #semantics

A Semantic Approach to Illative Combinatory Logic (LC0), pp. 174–188.

CSL-2011-DurandS #complexity #higher-order #logic #problem #query

Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.

CSL-2011-Egri #constraints #on the #problem

On Constraint Satisfaction Problems below P (LE), pp. 203–217.

CSL-2011-Eickmeyer #first-order #logic #random

Non-Definability Results for Randomised First-Order Logic (KE), pp. 218–232.

CSL-2011-EscardoOP

System T and the Product of Selection Functions (MHE, PO, TP), pp. 233–247.

CSL-2011-FogartyKVW #automaton

Unifying Büchi Complementation Constructions (SF, OK, MYV, TW), pp. 248–263.

CSL-2011-FridmanLZ #game studies #infinity #lookahead

Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.

CSL-2011-GroheGHL #logic #recursion

L-Recursion and a new Logic for Logarithmic Space (MG, BG, AH, BL), pp. 277–291.

CSL-2011-JeffreyR #streaming

The Lax Braided Structure of Streaming I/O (AJ, JR), pp. 292–306.

CSL-2011-JenkinsORW #metric #problem #synthesis

The Church Synthesis Problem with Metric (MJ, JO, AR, JW), pp. 307–321.

CSL-2011-Kartzow #automaton #graph

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.

CSL-2011-Kieronski #decidability #linear #logic #order

Decidability Issues for Two-Variable Logics with Several Linear Orders (EK), pp. 337–351.

CSL-2011-KomendantskayaP #algebra #logic programming

Coalgebraic Derivations in Logic Programming (EK, JP), pp. 352–366.

CSL-2011-Kopczynski #consistency #question

Trees in Trees: Is the Incomplete Information about a Tree Consistent? (EK), pp. 367–380.

CSL-2011-LeCY #complexity #formal method #problem

A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (DTML, SAC, YY), pp. 381–395.

CSL-2011-LoschP #semantics

Relating Two Semantics of Locally Scoped Names (SL, AMP), pp. 396–411.

CSL-2011-LustigNV #component #probability #synthesis

Synthesis from Probabilistic Components (YL, SN, MYV), pp. 412–427.

CSL-2011-Madhusudan #source code

Synthesizing Reactive Programs (PM), pp. 428–442.

CSL-2011-MoreNS #axiom #concurrent #independence #semantics

Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence (SMM, PN, BS), pp. 443–457.

CSL-2011-Polonsky #axiom

Axiomatizing the Quote (AP), pp. 458–469.

CSL-2011-ReusS #functional #logic #source code

Relative Completeness for Logics of Functional Programs (BR, TS), pp. 470–480.

CSL-2011-SchnablS #complexity #runtime

The Exact Hardness of Deciding Derivational and Runtime Complexity (AS, JGS), pp. 481–495.

CSL-2011-Schwencke #nondeterminism #recursion

A Category Theoretic View of Nondeterministic Recursive Program Schemes (DS), pp. 496–511.

CSL-2011-SchwinghammerB #nondeterminism #reasoning #relational

Step-Indexed Relational Reasoning for Countable Nondeterminism (JS, LB), pp. 512–524.

CSL-2011-Straubing #algebra #finite #word

Algebraic Characterization of the Alternation Hierarchy in FO2[<] on Finite Words (HS), pp. 525–537.

CSL-2011-TatsutaB #commutative

Non-Commutative Infinitary Peano Arithmetic (MT, SB), pp. 538–552.

CSL-2011-Makowsky

Model Theory in Computer Science: My Own Recurrent Themes (JAM), pp. 553–567.