Zoltán Ésik
Proceedings of the 15th EACSL Annual Conference / 20th International Workshop on Computer Science Logic
CSL, 2006.

@proceedings{CSL-2006,
	address       = "Szeged, Hungary",
	editor        = "Zoltán Ésik",
	isbn          = "3-540-45458-6",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 15th EACSL Annual Conference / 20th International Workshop on Computer Science Logic}",
	volume        = 4207,
	year          = 2006,
}

Contents (40 items)

11 ×#logic
4 ×#game studies
4 ×#infinity
3 ×#automaton
3 ×#linear
2 ×#algebra
2 ×#bisimulation
2 ×#calculus
2 ×#finite
2 ×#higher-order

CSL-2006-Mellies #diagrams #string

Functorial Boxes in String Diagrams (PAM), pp. 1–30.

CSL-2006-Ong #approach #infinity #semantics #verification

Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (CHLO), pp. 31–40.

CSL-2006-Segoufin #automaton #infinity #logic #word

Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.

CSL-2006-Truszczynski #algebra #logic

Nonmonotonic Logics and Their Algebraic Foundations (MT), pp. 58–71.

CSL-2006-Abel #termination

Semi-continuous Sized Types and Termination (AA0), pp. 72–88.

CSL-2006-Srba #automaton #bisimulation #equivalence #simulation

Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.

CSL-2006-Aehlig #automaton #finite #infinity #semantics

A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.

CSL-2006-AlvesFFM #linear #power of

The Power of Linear Functions (SA, MF, MF, IM), pp. 119–134.

CSL-2006-ArtemovK #complexity #logic #proving

Logical Omniscience Via Proof Complexity (SNA, RK), pp. 135–149.

CSL-2006-AtassiBT #logic #system f #verification

Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic (VA, PB, KT), pp. 150–166.

CSL-2006-Bagan #linear #query

MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay (GB), pp. 167–181.

CSL-2006-Benton

Abstracting Allocation (NB), pp. 182–196.

CSL-2006-BodirskyC #constraints #quantifier

Collapsibility in Infinite-Domain Quantified Constraint Satisfaction (MB, HC), pp. 197–211.

CSL-2006-BonfanteKMO #towards

Towards an Implicit Characterization of NCk (GB, RK, JYM, IO), pp. 212–224.

CSL-2006-CarayolM #on the

On Rational Trees (AC, CM), pp. 225–239.

CSL-2006-ChadhaMS #probability #reasoning #source code

Reasoning About States of Probabilistic Sequential Programs (RC, PM, AS), pp. 240–255.

CSL-2006-Chatterjee #concurrent #game studies

Concurrent Games with Tail Objectives (KC), pp. 256–270.

CSL-2006-Chatterjee06a #equilibrium #nash

Nash Equilibrium for Upward-Closed Objectives (KC), pp. 271–286.

CSL-2006-ChatterjeeDHR #algorithm #game studies

Algorithms for ω-Regular Games with Imperfect Information (KC, LD, TAH, JFR), pp. 287–302.

CSL-2006-CortierRZ #standard

Relating Two Standard Notions of Secrecy (VC, MR, EZ), pp. 303–318.

CSL-2006-GiamberardinoF #parallel #proving

Jump from Parallel to Sequential Proofs: Multiplicatives (PDG, CF), pp. 319–333.

CSL-2006-DurandO #first-order #query

First-Order Queries over One Unary Function (AD, FO), pp. 334–348.

CSL-2006-GollerL #infinity #logic #model checking

Infinite State Model-Checking of Propositional Dynamic Logics (SG, ML), pp. 349–364.

CSL-2006-HarwoodMS #bisimulation

Weak Bisimulation Approximants (WH, FM, AS), pp. 365–379.

CSL-2006-HellaT #higher-order #logic #problem

Complete Problems for Higher Order Logics (LH, JMTT), pp. 380–394.

CSL-2006-HenzingerP #game studies

Solving Games Without Determinization (TAH, NP), pp. 395–410.

CSL-2006-Kaiser #automation #game studies #model checking #quantifier

Game Quantification on Automatic Structures and Hierarchical Model Checking Games (LK), pp. 411–425.

CSL-2006-LautemannTT #algebra

An Algebraic Point of View on the Crane Beach Property (CL, PT, DT), pp. 426–440.

CSL-2006-LengrandDM #calculus #type system

A Sequent Calculus for Type Theory (SL, RD, JM), pp. 441–455.

CSL-2006-LowS #modelling

Universality Results for Models in Locally Boolean Domains (TL, TS), pp. 456–470.

CSL-2006-Madelaine #logic

Universal Structures and the Logic of Forbidden Patterns (FRM), pp. 471–485.

CSL-2006-Marcinkowski #graph #logic #on the #power of

On the Expressive Power of Graph Logic (JM), pp. 486–500.

CSL-2006-MartinMO #hoare #logic

Hoare Logic in the Abstract (UM, EAM, PO), pp. 501–515.

CSL-2006-Moczydlowski #normalisation

Normalization of IZF with Replacement (WM), pp. 516–530.

CSL-2006-Pagani #exponential #linear #logic #multi

Acyclicity and Coherence in Multiplicative Exponential Linear Logic (MP), pp. 531–545.

CSL-2006-Rabinovich #parametricity #problem #synthesis

Church Synthesis Problem with Parameters (AMR), pp. 546–561.

CSL-2006-RabinovichT #decidability

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (AMR, WT), pp. 562–574.

CSL-2006-ReusS #higher-order #logic

Separation Logic for Higher-Order Store (BR, JS), pp. 575–590.

CSL-2006-ScheweF #calculus #finite #satisfiability #μ-calculus

Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (SS, BF), pp. 591–605.

CSL-2006-Schopp #interactive

Space-Efficient Computation by Interaction (US), pp. 606–621.