Algebraic Methodology And Software Technology

by Johnson, Michael; Vene, Varmo

• ISBN13: 9783540356332
• ISBN10: 3540356339
• Format: Paperback
• Copyright: 2006-07-15
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes the refereed proceedings of the 11th International Conference on Algebraic Methodology and Software Technology, AMAST 2006, held in Kuressaare, Estonia in July 2006, co-located with MPC 2006, the 8th International Conference on Mathematics of Program Construction.The 24 revised full papers presented together with 3 system demonstrations and 3 invited talks were carefully reviewed and selected from 55 submissions. Among the topics covered are all current issues in formal methods related to algebraic approaches and to software engineering including abstract data types, process algebras, algebraic specification, model checking, abstraction, refinement, mu-calculus, state machines, rewriting, Kleene algebra, programming logic, and formal software development.

Table of Contents

Incremental software construction with refinement diagrams	p. 1
Recursive program schemes : past, present, and future	p. 2
Monad-based logics for computational effects	p. 3
State space representation for verification of open systems	p. 5
Data movement optimisation in point-free form	p. 21
Measuring the speed of information leakage in mobile processes	p. 36
Formal islands	p. 51
Some programming languages for Logspace and Ptime	p. 66
Opaque predicates detection by abstract interpretation	p. 81
DO-casl : an observer-based casl extension for dynamic specifications	p. 96
Model transformations incorporating multiple views	p. 111
Hyperfinite approximations to labeled Markov transition systems	p. 127
State space reduction of rewrite theories using invisible transitions	p. 142
The essence of multitasking	p. 158
The substitution vanishes	p. 173
Decomposing interactions	p. 189
Verification of communication protocols using abstract interpretation of FIFO queues	p. 204
Assessing the expressivity of formal specification languages	p. 220
Fork algebras as a sufficiently rich universal institution	p. 235
Realizability criteria for compositional MSC	p. 248
Quantales and temporal logics	p. 263
Fractional semantics	p. 278
Reasoning about data-parallel pointer programs in a modal extension of separation logic	p. 293
Testing semantics : connecting processes and process logics	p. 308
Tableaux for lattices	p. 323
Accelerated modal abstractions of labelled transition systems	p. 338
A compositional semantics of plan revision in intelligent agents	p. 353
ITP/OCL : a rewriting-based validation tool for UML+OCL static class diagrams	p. 368
A computational group theoretic symmetry reduction package for the Spin model checker	p. 374
Using category theory as a basis for a heterogeneous data source search meta-engine : the Promethee framework	p. 381
Table of Contents provided by Blackwell. All Rights Reserved.