Skip to main content
  • Conference proceedings
  • © 2007

Foundations of Software Science and Computational Structures

10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings

Editors:

Conference proceedings info: FoSSaCS 2007.

Buy it now

Buying options

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

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

Table of contents (26 papers)

  1. Front Matter

  2. Invited Talk

    1. Formal Foundations for Aspects

      • Radha Jagadeesan
      Pages 1-1
  3. Contributed Papers

    1. Sampled Universality of Timed Automata

      • Parosh Aziz Abdulla, Pavel Krcal, Wang Yi
      Pages 2-16
    2. Iterator Types

      • Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie
      Pages 17-31
    3. Types and Effects for Resource Usage Analysis

      • Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino
      Pages 32-47
    4. The Complexity of Generalized Satisfiability for Linear Temporal Logic

      • Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
      Pages 48-62
    5. Formalising the π-Calculus Using Nominal Logic

      • Jesper Bengtson, Joachim Parrow
      Pages 63-77
    6. The Rewriting Calculus as a Combinatory Reduction System

      • Clara Bertolissi, Claude Kirchner
      Pages 78-92
    7. Relational Parametricity and Separation Logic

      • Lars Birkedal, Hongseok Yang
      Pages 93-107
    8. Model-Checking One-Clock Priced Timed Automata

      • Patricia Bouyer, Kim G. Larsen, Nicolas Markey
      Pages 108-122
    9. Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems

      • Franck van Breugel, Babita Sharma, James Worrell
      Pages 123-137
    10. Optimal Strategy Synthesis in Stochastic Müller Games

      • Krishnendu Chatterjee
      Pages 138-152
    11. Generalized Parity Games

      • Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman
      Pages 153-167
    12. Tree Automata with Memory, Visibility and Structural Constraints

      • Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
      Pages 168-182
    13. Enriched μ-Calculi Module Checking

      • Alessandro Ferrante, Aniello Murano
      Pages 183-197
    14. PDL with Intersection and Converse Is 2EXP-Complete

      • Stefan Göller, Markus Lohrey, Carsten Lutz
      Pages 198-212
    15. On the Expressiveness and Complexity of ATL

      • François Laroussinie, Nicolas Markey, Ghassan Oreiby
      Pages 243-257
    16. Polynomial Constraints for Sets with Cardinality Bounds

      • Bruno Marnette, Viktor Kuncak, Martin Rinard
      Pages 258-273

Other Volumes

  1. Foundations of Software Science and Computational Structures

Bibliographic Information

Buy it now

Buying options

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