Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Foundations of Software Science and Computational Structures

13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010, Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Luke Ong

    1. Oxford University Computing Laboratory, Oxford, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • State of the art papers
  • Up to date research

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

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

Included in the following conference series:

Conference proceedings info: FoSSaCS 2010.

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

  1. Front Matter

    Download chapter PDF

  2. FoSSaCS 2010 Invited Talk

    1. Introduction to Decidability of Higher-Order Matching

      • Colin Stirling
      Pages 1-1

  3. Semantics of Programming Languages

    1. A Semantic Foundation for Hidden State

      • Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus
      Pages 2-17

    2. Linearly-Used Continuations in the Enriched Effect Calculus

      • Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson
      Pages 18-32

    3. Block Structure vs. Scope Extrusion: Between Innocence and Omniscience

      • Andrzej S. Murawski, Nikos Tzevelekos
      Pages 33-47

    4. Completeness for Algebraic Theories of Local State

      • Sam Staton
      Pages 48-63

  4. Probabilistic and Randomised Computation

    1. Fair Adversaries and Randomization in Two-Player Games

      • Eugene Asarin, Raphaël Chane-Yack-Fa, Daniele Varacca
      Pages 64-78

    2. Retaining the Probabilities in Probabilistic Testing Theory

      • Sonja Georgievska, Suzana Andova
      Pages 79-93

  5. Concurrency and Process Theory

    1. Forward Analysis of Depth-Bounded Processes

      • Thomas Wies, Damien Zufferey, Thomas A. Henzinger
      Pages 94-108

    2. Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization

      • Andrei Popescu, Elsa L. Gunter
      Pages 109-127

    3. Parameterised Multiparty Session Types

      • Nobuko Yoshida, Pierre-Malo Deniélou, Andi Bejleri, Raymond Hu
      Pages 128-145

    4. On the Relationship between Spatial Logics and Behavioral Simulations

      • Lucia Acciai, Michele Boreale, Gianluigi Zavattaro
      Pages 146-160

  6. Modal and Temporal Logics

    1. An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees

      • Balder ten Cate, Gaëlle Fontaine
      Pages 161-175

    2. When Model-Checking Freeze LTL over Counter Machines Becomes Decidable

      • Stéphane Demri, Arnaud Sangnier
      Pages 176-190

    3. Model Checking Is Static Analysis of Modal Logic

      • Flemming Nielson, Hanne Riis Nielson
      Pages 191-205

    4. Counting CTL

      • François Laroussinie, Antoine Meyer, Eudes Petonnet
      Pages 206-220

    5. Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems

      • Anthony Widjaja To, Leonid Libkin
      Pages 221-236

  7. Verification

    1. Toward a Compositional Theory of Leftist Grammars and Transformations

      • Pierre Chambart, Philippe Schnoebelen
      Pages 237-251

    2. Degrees of Lookahead in Regular Infinite Games

      • Michael Holtmann, Łukasz Kaiser, Wolfgang Thomas
      Pages 252-266

    3. Reachability Analysis of Communicating Pushdown Systems

      • Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre
      Pages 267-281
Back to top

Other volumes

  1. Foundations of Software Science and Computational Structures

Keywords

Editors and Affiliations

  • Oxford University Computing Laboratory, Oxford, UK

    Luke Ong

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation