Computer Science Logic

This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Science Logic, CSL 2008, held as the 17th Annual Conference of the EACSL in Bertinoro, Italy, in September 2008.

The 31 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 102 submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year's Ackermann award.

Inhalt

Invited Talks.- The Computability Path Ordering: The End of a Quest.- The Joy of String Diagrams.- Model Transformations in Decidability Proofs for Monadic Theories.- Molecules as Automata.- Contributed Papers.- An Infinite Automaton Characterization of Double Exponential Time.- Recursion Schemata for NC k .- Extensional Uniformity for Boolean Circuits.- Pure Pointer Programs with Iteration.- Quantified Positive Temporal Constraints.- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars.- Continuous Fragment of the mu-Calculus.- On the Relations between the Syntactic Theories of ??-Calculi.- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.- Proving Infinitude of Prime Numbers Using Binomial Coefficients.- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract).- Quantitative Game Semantics for Linear Logic.- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic.- An Indexed System for Multiplicative Additive Polarized Linear Logic.- A Characterisation of Lambda Definability with Sums Via ???-Closure Operators.- Superposition for Fixed Domains.- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T.- On the Almighty Wand.- On Counting Generalized Colorings.- The Descriptive Complexity of Parity Games.- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.- Quantitative Languages.- Characterization of Logics over Ranked Tree Languages.- The Nesting-Depth of Disjunctive ?-Calculus for Tree Languages and the Limitedness Problem.- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract).- Syntactic Metatheory of Higher-Order Subtyping.- On Isomorphisms of Intersection Types.- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.- Type-Based Termination with Sized Products.- The Ackermann Session.- The Ackermann Award 2008.