Matthias Baaz, Johann A. Makowsky
Proceedings of the 12th EACSL Annual Conference / 17th International Workshop on Computer Science Logic
CSL, 2003.

@proceedings{CSL-2003,
	address       = "Vienna, Austria",
	editor        = "Matthias Baaz and Johann A. Makowsky",
	isbn          = "3-540-40801-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th EACSL Annual Conference / 17th International Workshop on Computer Science Logic}",
	volume        = 2803,
	year          = 2003,
}

Contents (48 items)

9 ×#logic
7 ×#complexity
5 ×#game studies
4 ×#calculus
4 ×#tutorial
3 ×#on the
3 ×#query
2 ×#constraints
2 ×#effectiveness
2 ×#infinity

CSL-2003-AbdullaBd #game studies

Deciding Monotonic Games (PAA, AB, Jd), pp. 1–14.

CSL-2003-Aichernig

The Commuting V-Diagram (BKA), pp. 15–28.

CSL-2003-AndreoliM #concurrent

Concurrent Construction of Proof-Nets (JMA, LM), pp. 29–42.

CSL-2003-Artemov #logic

Back to the Future: Explicit Logic for Computer Science (SNA), p. 43.

CSL-2003-BodirskyN #constraints

Constraint Satisfaction with Countable Homogeneous Templates (MB, JN), pp. 44–57.

CSL-2003-BornerBJK #algorithm #complexity #constraints #quantifier

Quantified Constraints: Algorithms and Complexity (FB, AAB, PJ, AAK), pp. 58–70.

CSL-2003-Bouajjani #infinity #verification

Verification of Infinite State Systems (AB), p. 71.

CSL-2003-Bradfield #independence

Parity of Imperfection of Fixing Independence (JCB), pp. 72–85.

CSL-2003-Brunnler #logic

Atomic Cut Elimination for classical Logic (KB), pp. 86–97.

CSL-2003-Buchberger #logic #symbolic computation

Computational Mathematics, Computational Logic, and Symbolic Computation (BB), pp. 98–99.

CSL-2003-ChatterjeeJH #game studies #probability

Simple Stochastic Parity Games (KC, MJ, TAH), pp. 100–113.

CSL-2003-ChenF

Machine Characterization of the Classes of the W-Hierarchy (YC, JF), pp. 114–127.

CSL-2003-ChevalierKRTV #bound

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions (YC, RK, MR, MT, LV), pp. 128–141.

CSL-2003-DantchevR #complexity #on the

On Relativisation and Complexity Gap (SSD, SR), pp. 142–154.

CSL-2003-DavidG #normalisation #λ-calculus

Strong Normalization of the Typed λws-Calculus (RD, BG), pp. 155–168.

CSL-2003-DawarR #fixpoint #logic #symmetry

A Fixed-Point Logic with Symmetric Choice (AD, DR), pp. 169–182.

CSL-2003-Duparc #game studies #persistent

Positive Games and Persistent Strategies (JD), pp. 183–196.

CSL-2003-EiterM #abduction #generative #query

Generating All Abductive Explanations for Queries on Propositional Horn Theories (TE, KM), pp. 197–211.

CSL-2003-Gerhardy #analysis #complexity

Refined Complexity Analysis of Cut Elimination (PG), pp. 212–225.

CSL-2003-GroheS #finite #monad #query

Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.

CSL-2003-HitchcockLT #complexity

The Arithmetical Complexity of Dimension and Randomness (JMH, JHL, ST), pp. 241–254.

CSL-2003-Iemhoff #proving #towards

Towards a Proof System for Admissibility (RI), pp. 255–270.

CSL-2003-KahlerW #complexity #ltl #model checking

Program Complexity of Dynamic LTL Model Checking (DK, TW), pp. 271–284.

CSL-2003-KanovichV #problem

Coping Polynomially with Numerous but Identical Elements within Planning Problems (MIK, JV), pp. 285–298.

CSL-2003-Khoussainov #algebra #data type #on the #specification

On Algebraic Specifications of Abstract Data Types (BK), pp. 299–313.

CSL-2003-KolaitisP #complexity #game studies #on the

On the Complexity of Existential Pebble Games (PGK, JP), pp. 314–329.

CSL-2003-Korovina #aspect-oriented #similarity

Computational Aspects of σ-Definability over the Real Numbers without the Equality Test (MVK), pp. 330–344.

CSL-2003-KristiansenV #power of #source code #strict

The Surprising Power of Restricted Programs and Gödel’s Functionals (LK, PJV), pp. 345–358.

CSL-2003-Krzeszczakowski #game studies

Pebble Games on Trees (LK), pp. 359–371.

CSL-2003-Laird #named

Bistability: An Extensional Characterization of Sequentiality (JL), pp. 372–383.

CSL-2003-LeissR #automaton #string

Automata on Lempel-ziv Compressed Strings (HL, MdR), pp. 384–396.

CSL-2003-MaksimovaV #calculus #complexity #problem

Complexity of Some Problems in Modal and Intuitionistic Calculi (LM, AV), pp. 397–412.

CSL-2003-MetcalfeOG #logic

Goal-Directed Calculli for Gödel-Dummett Logics (GM, NO, DMG), pp. 413–426.

CSL-2003-MeydenP #logic #probability #quantum

A Logic for Probability in Quantum Systems (RvdM, MP), pp. 427–440.

CSL-2003-Miquel #normalisation #set

A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory (AM), pp. 441–454.

CSL-2003-MoserZ #calculus

The Epsilon Calculus (GM, RZ), p. 455.

CSL-2003-Reus #composition #logic #semantics

Modular Semantics and Logics of Classes (BR), pp. 456–469.

CSL-2003-SamerV #query #revisited

Validity of CTL Queries Revisited (MS, HV), pp. 470–483.

CSL-2003-SatoSKI #calculus

Calculi of Meta-variables (MS, TS, YK, AI), pp. 484–497.

CSL-2003-Schroder #calculus #modelling

Henkin Models of the Partial σ-Calculus (LS), pp. 498–512.

CSL-2003-UrbanPG

Nominal Unificaiton (CU, AMP, MG), pp. 513–527.

CSL-2003-Veith #community #verification

Friends or Foes? Communities in Software Verification (HV), pp. 528–529.

CSL-2003-Vermeulen #first-order #logic #semantics

More Computation Power for a Denotational Semantics for First Order Logic (KFMV), pp. 530–543.

CSL-2003-Vorobjov #effectiveness #formal method #strict

Effective Model Completeness of the Theory of Restricted Pfaffian Functions (NV), p. 544.

CSL-2003-Vorobjov03a #effectiveness #quantifier

Effective Quantifier Elimination over Real Closed Fields (NV), p. 545.

CSL-2003-RybinaV #infinity #model checking #performance

Fast Infinite-State Model Checking in Integer-Based Systems (TR, AV), pp. 546–573.

CSL-2003-Walukiewicz #synthesis

Winning Strategies and Synthesis of Controllers (IW), p. 574.

CSL-2003-ZhangN #logic

Logical Relations for Dynamic Name Creation (YZ, DN), pp. 575–588.