Jacques Duparc, Thomas A. Henzinger
Proceedings of the 16th EACSL Annual Conference / 21st International Workshop on Computer Science Logic
CSL, 2007.

@proceedings{CSL-2007,
	address       = "Lausanne, Switzerland",
	editor        = "Jacques Duparc and Thomas A. Henzinger",
	isbn          = "978-3-540-74914-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 16th EACSL Annual Conference / 21st International Workshop on Computer Science Logic}",
	volume        = 4646,
	year          = 2007,
}

Contents (42 items)

8 ×#logic
6 ×#calculus
5 ×#proving
4 ×#game studies
3 ×#complexity
3 ×#linear
2 ×#automaton
2 ×#invariant
2 ×#on the
2 ×#power of

CSL-2007-Abramsky #geometry #interactive #proving

Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (SA), pp. 1–2.

CSL-2007-Alfaro #approach #game studies

The Symbolic Approach to Repeated Games (LdA), p. 3.

CSL-2007-Beckmann #complexity #proving #source code

Proofs, Programs and Abstract Complexity (AB), pp. 4–5.

CSL-2007-Dawar #automaton #first-order #locality #logic #model checking

Model-Checking First-Order Logic: Automata and Locality (AD), p. 6.

CSL-2007-Kupferman #automaton

Tightening the Exchange Rates Between Automata (OK), pp. 7–22.

CSL-2007-GawlitzaS #invariant #precise #relational

Precise Relational Invariants Through Strategy Iteration (TG, HS), pp. 23–40.

CSL-2007-Kopczynski

ω-Regular Half-Positional Winning Conditions (EK), pp. 41–53.

CSL-2007-Obdrzalek #clique #game studies

Clique-Width and Parity Games (JO), pp. 54–68.

CSL-2007-RabinovichT #logic #problem

Logical Refinements of Church’s Problem (AR, WT), pp. 69–83.

CSL-2007-DawarR #finite #logic #power of #strict

The Power of Counting Logics on Restricted Classes of Finite Structures (AD, DR), pp. 84–98.

CSL-2007-AbdullaDB #power of

Comparing the Expressive Power of Well-Structured Transition Systems (PAA, GD, LVB), pp. 99–114.

CSL-2007-FinkelL #rank

There Exist Some ω-Powers of Any Borel Rank (OF, DL), pp. 115–129.

CSL-2007-FiliotTT #logic #satisfiability

Satisfiability of a Spatial Logic with Tree Variables (EF, JMT, ST), pp. 130–145.

CSL-2007-Bojanczyk

Forest Expressions (MB), pp. 146–160.

CSL-2007-CarayolL #infinity #order

MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.

CSL-2007-FournierGGZ #logic

Classical and Intuitionistic Logic Are Asymptotically Identical (HF, DG, AG, MZ), pp. 177–193.

CSL-2007-BodirskyC #reasoning #revisited

Qualitative Temporal and Spatial Reasoning Revisited (MB, HC), pp. 194–207.

CSL-2007-BaganDG #constant #on the #query

On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.

CSL-2007-KorovinV #calculus #linear

Integrating Linear Arithmetic into Superposition Calculus (KK, AV), pp. 223–237.

CSL-2007-Kesner #calculus #formal method #revisited

The Theory of Calculi with Explicit Substitutions Revisited (DK), pp. 238–252.

CSL-2007-GaboardiR #calculus

A Soft Type Assignment System for λ -Calculus (MG, SRDR), pp. 253–267.

CSL-2007-BerlineMS #effectiveness #modelling

λ Theories of Effective λ Models (CB, GM, AS), pp. 268–282.

CSL-2007-LassenL #bisimulation #normalisation

Typed Normal Form Bisimulation (SBL, PBL), pp. 283–297.

CSL-2007-BucciarelliEM

Not Enough Points Is Enough (AB, TE, GM), pp. 298–312.

CSL-2007-Miquel #calculus

Classical Program Extraction in the Calculus of Constructions (AM), pp. 313–327.

CSL-2007-BlanquiJS #calculus #induction

Building Decision Procedures in the Calculus of Inductive Constructions (FB, JPJ, PYS), pp. 328–342.

CSL-2007-WeisI #strict #theorem #word

Structure Theorem and Strict Alternation Hierarchy for FO2 on Words (PW, NI), pp. 343–357.

CSL-2007-Goller #complexity #on the #policy #reasoning

On the Complexity of Reasoning About Dynamic Policies (SG), pp. 358–373.

CSL-2007-AehligCN #complexity

Relativizing Small Complexity Classes and Their Theories (KA, SAC, PN), pp. 374–388.

CSL-2007-ChenF #parametricity

Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping (YC, JF), pp. 389–404.

CSL-2007-MillerS #composition #linear #logic #proving

From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic (DM, AS), pp. 405–419.

CSL-2007-Hoshino #linear

Linear Realizability (NH), pp. 420–434.

CSL-2007-NauroisM #correctness #exponential #multi #proving

Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete (PJdN, VM), pp. 435–450.

CSL-2007-LiangM #logic

Focusing and Polarization in Intuitionistic Logic (CL, DM), pp. 451–465.

CSL-2007-MillerN #proving

Incorporating Tables into Proofs (DM, VN), pp. 466–480.

CSL-2007-GaintzarainHLNO #calculus #invariant

A Cut-Free and Invariant-Free Sequent Calculus for PLTL (JG, MH, PL, MN, FO), pp. 481–495.

CSL-2007-Burel #bound #deduction

Unbounded Proof-Length Speed-Up in Deduction Modulo (GB), pp. 496–511.

CSL-2007-AehligB #logic

Propositional Logic for Circuit Classes (KA, AB), pp. 512–526.

CSL-2007-HertelU #game studies

Game Characterizations and the PSPACE-Completeness of Tree Resolution Space (AH, AU), pp. 527–541.

CSL-2007-Goubault-Larrecq

Continuous Previsions (JGL), pp. 542–557.

CSL-2007-Murawski

Bad Variables Under Control (ASM), pp. 558–572.

CSL-2007-McCuskerP #game studies

A Games Model of Bunched Implications (GM, DJP), pp. 573–588.