Book Volume 4019 2006

Algebraic Methodology and Software Technology

11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006. Proceedings

Editors:

ISBN: 978-3-540-35633-2 (Print) 978-3-540-35636-3 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Chapter

      Pages 1-1

      Incremental Software Construction with Refinement Diagrams

    2. No Access

      Chapter

      Pages 2-2

      Recursive Program Schemes: Past, Present, and Future

    3. No Access

      Chapter

      Pages 3-4

      Monad-Based Logics for Computational Effects

  3. Contributed Papers

    1. No Access

      Chapter

      Pages 5-20

      State Space Representation for Verification of Open Systems

    2. No Access

      Chapter

      Pages 21-35

      Data Movement Optimisation in Point-Free Form

    3. No Access

      Chapter

      Pages 36-50

      Measuring the Speed of Information Leakage in Mobile Processes

    4. No Access

      Chapter

      Pages 51-65

      Formal Islands

    5. No Access

      Chapter

      Pages 66-80

      Some Programming Languages for Logspace and Ptime

    6. No Access

      Chapter

      Pages 81-95

      Opaque Predicates Detection by Abstract Interpretation

    7. No Access

      Chapter

      Pages 96-110

      DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications

    8. No Access

      Chapter

      Pages 111-126

      Model Transformations Incorporating Multiple Views

    9. No Access

      Chapter

      Pages 127-141

      Hyperfinite Approximations to Labeled Markov Transition Systems

    10. No Access

      Chapter

      Pages 142-157

      State Space Reduction of Rewrite Theories Using Invisible Transitions

    11. No Access

      Chapter

      Pages 158-172

      The Essence of Multitasking

    12. No Access

      Chapter

      Pages 173-188

      The Substitution Vanishes

    13. No Access

      Chapter

      Pages 189-203

      Decomposing Interactions

    14. No Access

      Chapter

      Pages 204-219

      Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

    15. No Access

      Chapter

      Pages 220-234

      Assessing the Expressivity of Formal Specification Languages

    16. No Access

      Chapter

      Pages 235-247

      Fork Algebras as a Sufficiently Rich Universal Institution

    17. No Access

      Chapter

      Pages 248-262

      Realizability Criteria for Compositional MSC

previous Page of 2