Skip to main content
SpringerLink
Log in
Book cover

Computer Science Logic

20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Zoltán Ésik

    1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    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 4207)

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

Included in the following conference series:

Conference proceedings info: CSL 2006.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
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 (41 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributions

    1. Semi-continuous Sized Types and Termination

      • Andreas Abel
      Pages 72-88

    2. Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation

      • Jiří Srba
      Pages 89-103

    3. A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata

      • Klaus Aehlig
      Pages 104-118

    4. The Power of Linear Functions

      • Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie
      Pages 119-134

    5. Logical Omniscience Via Proof Complexity

      • Sergei Artemov, Roman Kuznets
      Pages 135-149

    6. Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic

      • Vincent Atassi, Patrick Baillot, Kazushige Terui
      Pages 150-166

    7. MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay

      • Guillaume Bagan
      Pages 167-181

    8. Abstracting Allocation

      • Nick Benton
      Pages 182-196

    9. Collapsibility in Infinite-Domain Quantified Constraint Satisfaction

      • Manuel Bodirsky, Hubie Chen
      Pages 197-211

    10. Towards an Implicit Characterization of NC k

      • G. Bonfante, R. Kahle, J. -Y. Marion, I. Oitavem
      Pages 212-224

    11. On Rational Trees

      • Arnaud Carayol, Christophe Morvan
      Pages 225-239

    12. Reasoning About States of Probabilistic Sequential Programs

      • R. Chadha, P. Mateus, A. Sernadas
      Pages 240-255

    13. Concurrent Games with Tail Objectives

      • Krishnendu Chatterjee
      Pages 256-270

    14. Nash Equilibrium for Upward-Closed Objectives

      • Krishnendu Chatterjee
      Pages 271-286

    15. Algorithms for Omega-Regular Games with Imperfect Information

      • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
      Pages 287-302
Back to top

Other volumes

  1. Computer Science Logic

Keywords

Editors and Affiliations

  • Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Zoltán Ésik

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation