Algebraic Methodology and Software Technology: 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings / Edition 1by Michael Johnson, Varmo Vene
Pub. Date: 07/28/2006
Publisher: Springer Berlin Heidelberg
This is the refereed proceedings of the 11th International Conference on Algebraic Methodology and Software Technology. The book collects 24 revised full papers together with 3 system demonstrations and 3 invited talks. Coverage includes current issues in formal methods related to algebraic approaches and to software engineering including abstract data types,
This is the refereed proceedings of the 11th International Conference on Algebraic Methodology and Software Technology. The book collects 24 revised full papers together with 3 system demonstrations and 3 invited talks. Coverage includes 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.
- Springer Berlin Heidelberg
- Publication date:
- Lecture Notes in Computer Science / Programming and Software Engineering Series , #4019
- Edition description:
- Product dimensions:
- 0.84(w) x 6.14(h) x 9.21(d)
Table of ContentsInvited Talks.- Incremental Software Construction with Refinement Diagrams.- Recursive Program Schemes: Past, Present, and Future.- Monad-Based Logics for Computational Effects.- Contributed Papers.- State Space Representation for Verification of Open Systems.- Data Movement Optimisation in Point-Free Form.- Measuring the Speed of Information Leakage in Mobile Processes.- Formal Islands.- Some Programming Languages for Logspace and Ptime.- Opaque Predicates Detection by Abstract Interpretation.- DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications.- Model Transformations Incorporating Multiple Views.- Hyperfinite Approximations to Labeled Markov Transition Systems.- State Space Reduction of Rewrite Theories Using Invisible Transitions.- The Essence of Multitasking.- The Substitution Vanishes.- Decomposing Interactions.- Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues.- Assessing the Expressivity of Formal Specification Languages.- Fork Algebras as a Sufficiently Rich Universal Institution.- Realizability Criteria for Compositional MSC.- Quantales and Temporal Logics.- Fractional Semantics.- Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic.- Testing Semantics: Connecting Processes and Process Logics.- Tableaux for Lattices.- Accelerated Modal Abstractions of Labelled Transition Systems.- A Compositional Semantics of Plan Revision in Intelligent Agents.- System Descriptions.- ITP/OCL: A Rewriting-Based Validation Tool for UML+OCL Static Class Diagrams.- A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker.- Using Category Theory as a Basis for a Heterogeneous Data Source Search Meta-engine: The Prométhée Framework.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >