Simona Ronchi Della Rocca
Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic
CSL, 2013.

@proceedings{CSL-2013,
	address       = "Torino, Italy",
	editor        = "Simona Ronchi Della Rocca",
	ee            = "http://drops.dagstuhl.de/opus/portals/extern/index.php?semnr=13009",
	isbn          = "978-3-939897-60-6",
	publisher     = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic}",
	volume        = 23,
	year          = 2013,
}

Contents (41 items)

11 ×#logic
5 ×#semantics
4 ×#game studies
3 ×#calculus
3 ×#normalisation
3 ×#on the
3 ×#proving
2 ×#automaton
2 ×#bound
2 ×#complexity

CSL-2013-Dershowitz

Res Publica: The Universal Model of Computation (ND), pp. 5–10.

CSL-2013-Girard #logic

Three lightings of logic (JYG), pp. 11–23.

CSL-2013-Oitavem #nondeterminism #recursion

From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (IO), pp. 24–27.

CSL-2013-Tendera

Means and Limits of Decision (LT), pp. 28–29.

CSL-2013-AfshariL #calculus #on the #μ-calculus

On closure ordinals for the modal μ-calculus (BA, GEL), pp. 30–44.

CSL-2013-AschieriBB #normalisation

Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1 (FA, SB, GB), pp. 45–60.

CSL-2013-BerkholzKV #bound #logic #quantifier

Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy (CB, AK, OV), pp. 61–80.

CSL-2013-BilkowskiS #ambiguity #infinity #problem

Unambiguity and uniformization problems on infinite trees (MB, MS), pp. 81–100.

CSL-2013-BoudesHP

A characterization of the Taylor expansion of λ-terms (PB, FH, MP), pp. 101–115.

CSL-2013-Bradfield #dependence

Team building in dependence (JCB), pp. 116–128.

CSL-2013-BroadbentK #higher-order #model checking #recursion

Saturation-Based Model Checking of Higher-Order Recursion Schemes (CHB, NK), pp. 129–148.

CSL-2013-BulatovDT #approximate #complexity

Descriptive complexity of approximate counting CSPs (AAB, VD, MT), pp. 149–164.

CSL-2013-ChatterjeeCT #decidability #markov #process #what

What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives (KC, MC, MT), pp. 165–180.

CSL-2013-ChatterjeeF #game studies #infinity

Infinite-state games with finitary conditions (KC, NF), pp. 181–196.

CSL-2013-CloustonDGT #calculus #linear #logic

Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.

CSL-2013-ColcombetKLB #automaton

Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.

CSL-2013-GianantonioL #game studies #semantics

Innocent Game Semantics via Intersection Type Assignment Systems (PDG, ML), pp. 231–247.

CSL-2013-FortierS #proving #semantics

Cuts for circular proofs: semantics and cut-elimination (JF, LS), pp. 248–262.

CSL-2013-GallianiHK #independence #logic

Hierarchies in independence logic (PG, MH, JK), pp. 263–280.

CSL-2013-GallianiH #fixpoint #logic

Inclusion Logic and Fixed Point Logic (PG, LH), pp. 281–295.

CSL-2013-GhasemlooC #bound #proving

Theories for Subexponential-size Bounded-depth Frege Proofs (KG, SAC), pp. 296–315.

CSL-2013-GimenezM #interactive

The Structure of Interaction (SG, GM), pp. 316–331.

CSL-2013-Goller #concurrent #model checking #parametricity

The Fixed-Parameter Tractability of Model Checking Concurrent Systems (SG), pp. 332–347.

CSL-2013-HampsonK #first-order #linear #logic

One-variable first-order linear temporal logics with counting (CH, AK), pp. 348–362.

CSL-2013-HarwathS #first-order #invariant #locality #logic #on the #quantifier

On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.

CSL-2013-Hunter #logic #metric #question

When is Metric Temporal Logic Expressively Complete? (PH), pp. 380–394.

CSL-2013-Kikuchi #nondeterminism #normalisation #proving #λ-calculus

Proving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus (KK), pp. 395–414.

CSL-2013-KozenM #algebra

Kleene Algebra with Products and Iteration Theories (DK, KM), pp. 415–431.

CSL-2013-KrishnaswamiD #calculus #parametricity #relational

Internalizing Relational Parametricity in the Extensional Calculus of Constructions (NRK, DD), pp. 432–451.

CSL-2013-Kuusisto #automaton #distributed #logic #message passing

Modal Logic and Distributed Message Passing Automata (AK), pp. 452–468.

CSL-2013-Leivant #induction #semantics #type system

Global semantic typing for inductive and coinductive computing (DL), pp. 469–483.

CSL-2013-ManuelZ #2d #logic

Two-Variable Logic on 2-Dimensional Structures (AM, TZ), pp. 484–499.

CSL-2013-Maruyama #category theory #monad

Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad (YM), pp. 500–520.

CSL-2013-Materzok #axiom #continuation

Axiomatizing Subtyped Delimited Continuations (MM), pp. 521–539.

CSL-2013-Mellies #game studies #on the

On dialogue games and coherent strategies (PAM), pp. 540–562.

CSL-2013-MichaliszynO #logic #transitive

Elementary Modal Logics over Transitive Structures (JM, JO), pp. 563–577.

CSL-2013-Nishimura #game studies #parallel #semantics

A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables (SN), pp. 578–596.

CSL-2013-Rieg #using

Extracting Herbrand trees in classical realizability using forcing (LR), pp. 597–614.

CSL-2013-SchmidtW #abduction #complexity #constraints #similarity

The Complexity of Abduction for Equality Constraint Languages (JS, MW), pp. 615–633.

CSL-2013-Statman #normalisation

A New Type Assignment for Strongly Normalizable Terms (RS), pp. 634–652.

CSL-2013-WangB #decidability #equation #semantics #type system

Semantics of Intensional Type Theory extended with Decidable Equational Theories (QW, BB), pp. 653–667.