Anuj Dawar, Helmut Veith
Proceedings of the 19th EACSL Annual Conference / 24th International Workshop on Computer Science Logic
CSL, 2010.

@proceedings{CSL-2010,
	address       = "Brno, Czech Republic",
	doi           = "10.1007/978-3-642-15205-4",
	editor        = "Anuj Dawar and Helmut Veith",
	isbn          = "978-3-642-15204-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 19th EACSL Annual Conference / 24th International Workshop on Computer Science Logic}",
	volume        = 6247,
	year          = 2010,
}

Contents (40 items)

14 ×#logic
5 ×#proving
4 ×#induction
3 ×#algebra
3 ×#calculus
3 ×#complexity
3 ×#deduction
2 ×#algorithm
2 ×#constraints
2 ×#dependence

CSL-2010-BasinC #protocol #security

Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries (DAB, CJFC), pp. 1–18.

CSL-2010-Gradel #game studies

Definability in Games (EG), pp. 19–21.

CSL-2010-Krajicek #proving

From Feasible Proofs to Feasible Computations (JK), pp. 22–31.

CSL-2010-Krokhin #constraints

Tree Dualities for Constraint Satisfaction (AAK), pp. 32–33.

CSL-2010-KuncakPS #calculus #data type #order #set

Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.

CSL-2010-OHearn #abduction #deduction #induction #reasoning

Abductive, Inductive and Deductive Reasoning about Resources (PWO), pp. 49–50.

CSL-2010-Rybalchenko #constraints #theorem proving #theory and practice #verification

Constraint Solving for Program Verification: Theory and Practice by Example (AR), p. 51.

CSL-2010-AlendaOST #calculus

Tableau Calculi for CSL over minspaces (RA, NO, CS, DT), pp. 52–66.

CSL-2010-BaazF #logic

A Resolution Mechanism for Prenex Gödel Logic (MB, CGF), pp. 67–79.

CSL-2010-BaganDFG #performance #query

Efficient Enumeration for Conjunctive Queries over X-underbar Structures (GB, AD, EF, OG), pp. 80–94.

CSL-2010-BarthwalN #context-free grammar #formal method #normalisation

A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 (AB, MN), pp. 95–109.

CSL-2010-BenediktLP #automaton #logic #word

Automata vs. Logics on Data Words (MB, CL, GP), pp. 110–124.

CSL-2010-BiancoMM #logic

Graded Computation Tree Logic with Binary Coding (AB, FM, AM), pp. 125–139.

CSL-2010-BlassDG #algorithm

Exact Exploration and Hanging Algorithms (AB, ND, YG), pp. 140–154.

CSL-2010-Burel #deduction #proving

Embedding Deduction Modulo into a Prover (GB), pp. 155–169.

CSL-2010-CarraroES #exponential #infinity #multi

Exponentials with Infinite Multiplicities (AC, TE, AS), pp. 170–184.

CSL-2010-Chaudhuri #logic

Classical and Intuitionistic Subexponential Logics Are Equally Expressive (KC), pp. 185–199.

CSL-2010-ChenF #on the #problem #proving #slicing

On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT (YC, JF), pp. 200–214.

CSL-2010-ChurchillL #logic

A Logic of Sequentiality (MC, JL), pp. 215–229.

CSL-2010-CoeckeP #category theory #quantum

Environment and Classical Channels in Categorical Quantum Mechanics (BC, SP), pp. 230–244.

CSL-2010-CookF #algebra #linear

Formal Theories for Linear Algebra (SAC, LF), pp. 245–259.

CSL-2010-DegorreDGRT #energy #game studies

Energy and Mean-Payoff Games with Imperfect Information (AD, LD, RG, JFR, ST), pp. 260–274.

CSL-2010-EickmeyerG #complexity

Randomisation and Derandomisation in Descriptive Complexity Theory (KE, MG), pp. 275–289.

CSL-2010-Santo #canonical #deduction #towards

Towards a Canonical Classical Natural Deduction System (JES), pp. 290–304.

CSL-2010-FinkbeinerS #coordination #logic

Coordination Logic (BF, SS), pp. 305–319.

CSL-2010-FioreH #equation #higher-order #logic

Second-Order Equational Logic (MPF, CKH), pp. 320–335.

CSL-2010-GhaniJF #algebra #induction

Fibrational Induction Rules for Initial Algebras (NG, PJ, CF), pp. 336–350.

CSL-2010-Hetzl #calculus #representation

A Sequent Calculus with Implicit Term Representation (SH), pp. 351–365.

CSL-2010-GanzowK #algorithm #higher-order #induction #logic #monad

New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.

CSL-2010-AccattoliK #λ-calculus

The Structural λ-Calculus (BA, DK), pp. 381–395.

CSL-2010-KuskeLL #morphism #problem

The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.

CSL-2010-LohmannV #complexity #dependence #logic

Complexity Results for Modal Dependence Logic (PL, HV), pp. 411–425.

CSL-2010-MartinM #complexity #first-order #logic #similarity

The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case (BM, JM), pp. 426–438.

CSL-2010-NenovP #logic #on the

On the Computability of Region-Based Euclidean Logics (YN, IPH), pp. 439–453.

CSL-2010-ForsbergS #induction

Inductive-Inductive Definitions (FNF, AS), pp. 454–468.

CSL-2010-Platzer #difference #distributed #hybrid #logic #quantifier

Quantified Differential Dynamic Logic for Distributed Hybrid Systems (AP), pp. 469–483.

CSL-2010-Pous #algebra #linear #logic #proving

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (DP), pp. 484–498.

CSL-2010-SchwentickZ #logic #order

Two-Variable Logic with Two Order Relations — (TS, TZ), pp. 499–513.

CSL-2010-SternagelT #dependence #proving #termination

Signature Extensions Preserve Termination — An Alternative Proof via Dependency Pairs (CS, RT), pp. 514–528.

CSL-2010-Strub #coq #modulo theories

Coq Modulo Theory (PYS), pp. 529–543.