Skip to main content
SpringerLink
Log in
Book cover

Foundations of Software Science and Computation Structures

17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Anca Muscholl

    1. LaBRI, Universiy of Bordeaux, France

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

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

Included in the following conference series:

Conference proceedings info: FoSSaCS 2014.

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 (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Equivalences of Pushdown Systems Are Hard

    • Petr Jančar
    Pages 1-28

  3. Probabilistic Systems

    1. Active Diagnosis for Probabilistic Systems

      • Nathalie Bertrand, Éric Fabre, Stefan Haar, Serge Haddad, Loïc Hélouët
      Pages 29-42

    2. Analysis of Probabilistic Basic Parallel Processes

      • Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin
      Pages 43-57

    3. Limit Synchronization in Markov Decision Processes

      • Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
      Pages 58-72

    4. Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes

      • Hongfei Fu
      Pages 73-87

  4. Semantics of Programming Languages

    1. Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types

      • Luca Padovani
      Pages 88-102

    2. A Semantical and Operational Account of Call-by-Value Solvability

      • Alberto Carraro, Giulio Guerrieri
      Pages 103-118

  5. Networks

    1. Network-Formation Games with Regular Objectives

      • Guy Avni, Orna Kupferman, Tami Tamir
      Pages 119-133

    2. Playing with Probabilities in Reconfigurable Broadcast Networks

      • Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier
      Pages 134-148

  6. Program Analysis

    1. Unsafe Order-2 Tree Languages Are Context-Sensitive

      • Naoki Kobayashi, Kazuhiro Inaba, Takeshi Tsukada
      Pages 149-163

    2. Game Semantics for Nominal Exceptions

      • Andrzej S. Murawski, Nikos Tzevelekos
      Pages 164-179

    3. Complexity of Model-Checking Call-by-Value Programs

      • Takeshi Tsukada, Naoki Kobayashi
      Pages 180-194

  7. Games and Synthesis

    1. Resource Reachability Games on Pushdown Graphs

      • Martin Lang
      Pages 195-209

    2. Perfect-Information Stochastic Mean-Payoff Parity Games

      • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj
      Pages 210-225

    3. Latticed-LTL Synthesis in the Presence of Noisy Inputs

      • Shaull Almagor, Orna Kupferman
      Pages 226-241

    4. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies

      • Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi
      Pages 242-257

  8. Compositional Reasoning

    1. On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations

      • Javier Esparza, Jörg Desel
      Pages 258-273

    2. On Asymmetric Unification and the Combination Problem in Disjoint Theories

      • Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen
      Pages 274-288

  9. Bisimulation

    1. Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules

      • Pedro R. D’Argenio, Daniel Gebler, Matias David Lee
      Pages 289-303
Back to top

Other volumes

  1. Foundations of Software Science and Computation Structures

Keywords

About this book

This book constitutes the proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2014, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. The 28 papers included in this book, together with one invited talk, were selected from 106 full-paper submissions. The following topical areas are covered: probabilistic systems, semantics of programming languages, networks, program analysis, games and synthesis, compositional reasoning, bisimulation, categorical and algebraic models and logics of programming.

Editors and Affiliations

  • LaBRI, Universiy of Bordeaux, France

    Anca Muscholl

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation