This is the proceedings of the 11th edition of the Algebraic Methodology and Software Technology (AMAST) conference series. The ?rst conference was held in the USA in 1989, and since then AMAST conferences have been held on (or near) ?ve di?erent continents and have been hosted by many of the most prominent people and organizations in the ?eld. The AMAST initiative has always sought to have practical e?ects by dev- oping the science of software and basing it on a ?rm mathematical foundation. AMAST hasinterpretedsoftwaretechnologybroadly,andhas, for example, held AMAST workshops in areas as diverse as real-time systems and (natural) l- guage processing. Similarly, algebraic methodology is interpreted broadly and includes abstract algebra, category theory, logic, and a range of other ma- ematical subdisciplines. The truly distinguishing feature of AMAST is that it seeks rigorous mathematical developments, but always strives to link them to real technological applications. Our meetings frequently include industry-based participants and are a rare opportunity for mathematicians and mathema- callymindedacademicstointeracttechnicallywithindustry-basedtechnologists. Over the years AMAST has included industrial participants from organizations specializing in safety-critical (including medical) systems, transport (including aerospace), and security-critical systems, amongst others.
Author(s): Ralph-Johan Back (auth.), Michael Johnson, Varmo Vene (eds.)
Series: Lecture Notes in Computer Science 4019 : Programming and Software Engineering
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 392
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Software Engineering; Programming Techniques; Symbolic and Algebraic Manipulation; Artificial Intelligence (incl. Robotics)
Front Matter....Pages -
Incremental Software Construction with Refinement Diagrams....Pages 1-1
Recursive Program Schemes: Past, Present, and Future....Pages 2-2
Monad-Based Logics for Computational Effects....Pages 3-4
State Space Representation for Verification of Open Systems....Pages 5-20
Data Movement Optimisation in Point-Free Form....Pages 21-35
Measuring the Speed of Information Leakage in Mobile Processes....Pages 36-50
Formal Islands....Pages 51-65
Some Programming Languages for Logspace and Ptime ....Pages 66-80
Opaque Predicates Detection by Abstract Interpretation....Pages 81-95
DO- Casl: An Observer-Based Casl Extension for Dynamic Specifications....Pages 96-110
Model Transformations Incorporating Multiple Views....Pages 111-126
Hyperfinite Approximations to Labeled Markov Transition Systems....Pages 127-141
State Space Reduction of Rewrite Theories Using Invisible Transitions....Pages 142-157
The Essence of Multitasking....Pages 158-172
The Substitution Vanishes....Pages 173-188
Decomposing Interactions....Pages 189-203
Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues....Pages 204-219
Assessing the Expressivity of Formal Specification Languages....Pages 220-234
Fork Algebras as a Sufficiently Rich Universal Institution....Pages 235-247
Realizability Criteria for Compositional MSC....Pages 248-262
Quantales and Temporal Logics....Pages 263-277
Fractional Semantics....Pages 278-292
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic....Pages 293-307
Testing Semantics: Connecting Processes and Process Logics....Pages 308-322
Tableaux for Lattices....Pages 323-337
Accelerated Modal Abstractions of Labelled Transition Systems....Pages 338-352
A Compositional Semantics of Plan Revision in Intelligent Agents....Pages 353-367
ITP/OCL: A Rewriting-Based Validation Tool for UML+OCL Static Class Diagrams....Pages 368-373
A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker....Pages 374-380
Using Category Theory as a Basis for a Heterogeneous Data Source Search Meta-engine: The Prométhée Framework....Pages 381-387
Back Matter....Pages -
