Skip to main content
SpringerLink
Log in

Computer Science Logic

22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Michael Kaminski
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Simone Martini
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5213)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CSL 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. The Computability Path Ordering: The End of a Quest

      • Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
      Pages 1-14

    2. The Joy of String Diagrams

      • Pierre-Louis Curien
      Pages 15-22

    3. Model Transformations in Decidability Proofs for Monadic Theories

      • Wolfgang Thomas
      Pages 23-31

    4. Molecules as Automata

      • Luca Cardelli
      Pages 32-32

  3. Contributed Papers

    1. An Infinite Automaton Characterization of Double Exponential Time

      • Salvatore La Torre, P. Madhusudan, Gennaro Parlato
      Pages 33-48

    2. Recursion Schemata for NCk

      • Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
      Pages 49-63

    3. Extensional Uniformity for Boolean Circuits

      • Pierre McKenzie, Michael Thomas, Heribert Vollmer
      Pages 64-78

    4. Pure Pointer Programs with Iteration

      • Martin Hofmann, Ulrich Schöpp
      Pages 79-93

    5. Quantified Positive Temporal Constraints

      • Witold Charatonik, MichaÅ‚ Wrona
      Pages 94-108

    6. Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint

      • Nadia Creignou, Henning Schnoor, Ilka Schnoor
      Pages 109-123

    7. Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars

      • Ruzica Piskac, Viktor Kuncak
      Pages 124-138

    8. Continuous Fragment of the mu-Calculus

      • Gaëlle Fontaine
      Pages 139-153

    9. On the Relations between the Syntactic Theories of λμ-Calculi

      • Alexis Saurin
      Pages 154-168

    10. A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms

      • Olivier Hermant, James Lipton
      Pages 169-183

    11. Proving Infinitude of Prime Numbers Using Binomial Coefficients

      • Phuong Nguyen
      Pages 184-198

    12. A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

      • Olaf Beyersdorff, Sebastian Müller
      Pages 199-214

    13. A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)

      • Stefano Berardi, Ugo de’Liguoro
      Pages 215-229

    14. Quantitative Game Semantics for Linear Logic

      • Ugo Dal Lago, Olivier Laurent
      Pages 230-245

    15. A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic

      • Paolo Tranquilli
      Pages 246-261
Back to top

Other volumes

  1. Computer Science Logic

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation