Patrick Cégielski, Arnaud Durand
Proceedings of the 21st EACSL Annual Conference / 26th International Workshop on Computer Science Logic
CSL, 2012.

@proceedings{CSL-2012,
	address       = "Fontainebleau, France",
	editor        = "Patrick Cégielski and Arnaud Durand",
	ee            = "http://drops.dagstuhl.de/opus/portals/extern/index.php?semnr=12009",
	isbn          = "978-3-939897-42-2",
	publisher     = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 21st EACSL Annual Conference / 26th International Workshop on Computer Science Logic}",
	volume        = 16,
	year          = 2012,
}

Contents (39 items)

7 ×#logic
5 ×#complexity
4 ×#linear
4 ×#parametricity
3 ×#axiom
3 ×#bound
3 ×#equation
3 ×#proving
2 ×#approach
2 ×#automaton

CSL-2012-Abiteboul #distributed #web

Sharing Distributed Knowledge on the Web (SA), pp. 6–8.

CSL-2012-Cook #complexity #proving

Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (SAC), pp. 9–11.

CSL-2012-Lynce #named #satisfiability

Satisfiability: where Theory meets Practice (IL), pp. 12–13.

CSL-2012-Makowsky #complexity #graph #parametricity

Definability and Complexity of Graph Parameters (JAM), pp. 14–15.

CSL-2012-AltenkirchR #approach

A Syntactical Approach to Weak ω-Groupoids (TA, OR), pp. 16–30.

CSL-2012-Aschieri #axiom #interactive

Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms (FA), pp. 31–45.

CSL-2012-Atkey #parametricity #relational

Relational Parametricity for Higher Kinds (RA), pp. 46–61.

CSL-2012-BaillotL #complexity #higher-order

Higher-Order Interpretations and Program Complexity (PB, UDL), pp. 62–76.

CSL-2012-Berardid #learning

Knowledge Spaces and the Completeness of Learning Strategies (SB, Ud), pp. 77–91.

CSL-2012-BertrandFS #bound #satisfiability

Bounded Satisfiability for PCTL (NB, JF, SS), pp. 92–106.

CSL-2012-BirkedalST #concurrent #logic

A Concurrent Logical Relation (LB, FS, JT), pp. 107–121.

CSL-2012-BodirskyW #constraints #equivalence #problem

Equivalence Constraint Satisfaction Problems (MB, MW), pp. 122–136.

CSL-2012-Brault-Baron #query

A Negative Conjunctive Query is Easy if and only if it is β-Acyclic (JBB), pp. 137–151.

CSL-2012-CarraroS #consistency #equation #formal method #modelling #on the #λ-calculus

On the equational consistency of order-theoretic models of the λ-calculus (AC, AS), pp. 152–166.

CSL-2012-ChatterjeeCK #algorithm #performance #refinement

Faster Algorithms for Alternating Refinement Relations (KC, SC, PK), pp. 167–182.

CSL-2012-ChaudhuriHM #approach #calculus

A Systematic Approach to Canonicity in the Classical Sequent Calculus (KC, SH, DM), pp. 183–197.

CSL-2012-ChrzaszczS #complexity #ml

ML with PTIME complexity guarantees (JC, AS), pp. 198–212.

CSL-2012-DawarGHKP #equation #linear

Definability of linear equation systems over groups and rings (AD, EG, BH, EK, WP), pp. 213–227.

CSL-2012-DeYoungCPT #communication #linear #logic #reduction

Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication (HD, LC, FP, BT), pp. 228–242.

CSL-2012-DudderMRU #bound #combinator #logic

Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.

CSL-2012-Ehrhard

Collapsing non-idempotent intersection types (TE), pp. 259–273.

CSL-2012-GrandjeanO #complexity

Descriptive complexity for pictures languages (EG, FO), pp. 274–288.

CSL-2012-GroheO #equation #game studies #linear

Pebble Games and Linear Equations (MG, MO), pp. 289–304.

CSL-2012-GradelL #game studies

Banach-Mazur Games with Simple Winning Strategies (EG, SL), pp. 305–319.

CSL-2012-HetzlS #first-order #logic

Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.

CSL-2012-Hida #axiom

A Computational Interpretation of the Axiom of Determinacy in Arithmetic (TH), pp. 335–349.

CSL-2012-JouannaudL

Church-Rosser Properties of Normal Rewriting (JPJ, JL), pp. 350–365.

CSL-2012-KaiserL #logic

A Counting Logic for Structure Transition Systems (LK, SL), pp. 366–380.

CSL-2012-KellerL #parametricity

Parametricity in an Impredicative Sort (CK, ML), pp. 381–395.

CSL-2012-KieronskiM #logic #transitive

Two-Variable Universal Logic with Transitive Closure (EK, JM), pp. 396–410.

CSL-2012-KotekM #graph #matrix #parametricity

Connection Matrices and the Definability of Graph Parameters (TK, JAM), pp. 411–425.

CSL-2012-KufleitnerW #decidability

The FO2 alternation hierarchy is decidable (MK, PW), pp. 426–439.

CSL-2012-Kuroda #axiom #bound #concept #proving

Axiomatizing proof tree concepts in Bounded Arithmetic (SK), pp. 440–454.

CSL-2012-Kuske #automation #linear #morphism #order

Isomorphisms of scattered automatic linear orders (DK), pp. 455–469.

CSL-2012-KuusistoMV #decidability #first-order #geometry

Undecidable First-Order Theories of Affine Geometries (AK, JM, JV), pp. 470–484.

CSL-2012-LeitschRP #logic #towards

Towards CERes in intuitionistic logic (AL, GR, BWP), pp. 485–499.

CSL-2012-Parys #automaton

Variants of Collapsible Pushdown Systems (PP), pp. 500–515.

CSL-2012-Rabinovich #proving #theorem

A Proof of Kamp’s theorem (AR), pp. 516–527.

CSL-2012-Wu #automaton #commutative

Commutative Data Automata (ZW), pp. 528–542.