Erich Grädel, Reinhard Kahle
Proceedings of the 18th EACSL Annual Conference / 23rd International Workshop on Computer Science Logic
CSL, 2009.

@proceedings{CSL-2009,
	address       = "Coimbra, Portugal",
	doi           = "10.1007/978-3-642-04027-6",
	editor        = "Erich Grädel and Reinhard Kahle",
	isbn          = "978-3-642-04026-9",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th EACSL Annual Conference / 23rd International Workshop on Computer Science Logic}",
	volume        = 5771,
	year          = 2009,
}

Contents (39 items)

5 ×#on the
5 ×#problem
4 ×#decidability
4 ×#linear
4 ×#logic
3 ×#calculus
2 ×#algebra
2 ×#analysis
2 ×#bound
2 ×#first-order

CSL-2009-Bojanczyk #algebra

Algebra for Tree Languages (MB), p. 1.

CSL-2009-Coquand #type system

Forcing and Type Theory (TC), p. 2.

CSL-2009-FerreiraO #functional #linear #logic

Functional Interpretations of Intuitionistic Linear Logic (GF, PO), pp. 3–19.

CSL-2009-Grohe #fixpoint #polynomial

Fixed-Point Definability and Polynomial Time (MG), pp. 20–23.

CSL-2009-Moschovakis #recursion #theorem

Kleene’s Amazing Second Recursion Theorem (YNM), pp. 24–39.

CSL-2009-Abel #evaluation #normalisation

Typed Applicative Structures and Normalization by Evaluation for System Fω (AA0), pp. 40–54.

CSL-2009-AccattoliG

Jumping Boxes (BA, SG), pp. 55–70.

CSL-2009-AdlerW #first-order

Tree-Width for First Order Formulae (IA, MW), pp. 71–85.

CSL-2009-AlurCW #algorithm #analysis #source code

Algorithmic Analysis of Array-Accessing Programs (RA, PC, SW), pp. 86–101.

CSL-2009-AtseriasW #consistency #constraints #decidability #problem

Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (AA, MW), pp. 102–116.

CSL-2009-BaranyKR #quantifier

Cardinality Quantifiers in MLO over Trees (VB, LK, AR), pp. 117–131.

CSL-2009-Berger #induction #proving

From Coinductive Proofs to Exact Real Arithmetic (UB), pp. 132–146.

CSL-2009-BlanquiR #on the #semantics #termination

On the Relation between Sized-Types Based Termination and Semantic Labelling (FB, CR), pp. 147–162.

CSL-2009-CiabattoniST #proving

Expanding the Realm of Systematic Proof Theory (AC, LS, KT), pp. 163–178.

CSL-2009-CirsteaKP #algebra #calculus #μ-calculus

EXPTIME Tableaux for the Coalgebraic μ-Calculus (CC, CK, DP), pp. 179–193.

CSL-2009-CockettS #communication #on the #problem #word

On the Word Problem for ΣΠ-Categories, and the Properties of Two-Way Communication (JRBC, LS), pp. 194–208.

CSL-2009-Dezani-CiancagliniGR #quantifier

Intersection, Universally Quantified, and Reference Types (MDC, PG, SRDR), pp. 209–224.

CSL-2009-DuparcFM #automaton #decidability #game studies #linear #problem

Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (JD, AF, FM), pp. 225–239.

CSL-2009-EggerMS #calculus #linear

Enriching an Effect Calculus with Linear Types (JE, REM, AS), pp. 240–254.

CSL-2009-EndrullisGZ #term rewriting

Degrees of Undecidability in Term Rewriting (JE, HG, HZ), pp. 255–270.

CSL-2009-GaboardiP #bound #semantics #using

Upper Bounds on Stream I/O Using Semantic Interpretations (MG, RP), pp. 271–286.

CSL-2009-GheerbrantC #linear

Craig Interpolation for Linear Temporal Languages (AG, BtC), pp. 287–301.

CSL-2009-GuoWXC #model checking #on the

On Model Checking Boolean BI (HG, HW, ZX, YC), pp. 302–316.

CSL-2009-HofmannR #analysis #performance

Efficient Type-Checking for Amortised Heap-Space Analysis (MH, DR), pp. 317–331.

CSL-2009-HorbachW #induction #query

Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries (MH, CW), pp. 332–347.

CSL-2009-Kreutzer #higher-order #logic #monad #on the

On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.

CSL-2009-KuskeL #automation #bound #revisited

Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.

CSL-2009-Laird #nondeterminism

Nondeterminism and Observable Sequentiality (JL), pp. 379–393.

CSL-2009-MontanariPS #decidability #logic

A Decidable Spatial Logic with Cone-Shaped Cardinal Directions (AM, GP, PS), pp. 394–408.

CSL-2009-Munch-Maccagnoni

Focalisation and Classical Realisability (GMM), pp. 409–423.

CSL-2009-Rabinovich #decidability #problem

Decidable Extensions of Church’s Problem (AR), pp. 424–439.

CSL-2009-SchwinghammerBRY #higher-order #hoare

Nested Hoare Triples and Frame Rules for Higher-Order Store (JS, LB, BR, HY), pp. 440–454.

CSL-2009-Sumii #equivalence #polymorphism #λ-calculus

A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (ES), pp. 455–469.

CSL-2009-Tatsuta #calculus #commutative #first-order

Non-Commutative First-Order Sequent Calculus (MT), pp. 470–484.

CSL-2009-To #model checking #process

Model Checking FO(R) over One-Counter Processes and beyond (AWT), pp. 485–499.

CSL-2009-Tranquilli #confluence #difference

Confluence of Pure Differential Nets with Promotion (PT), pp. 500–514.

CSL-2009-UmmelsW #game studies #nash #probability #problem

Decision Problems for Nash Equilibria in Stochastic Games (MU, DW), pp. 515–529.

CSL-2009-Weber #complexity #logic #on the

On the Complexity of Branching-Time Logics (VW), pp. 530–545.

CSL-2009-TurnerW #concurrent

Nominal Domain Theory for Concurrency (DT, GW), pp. 546–560.