000 05443nam a22006015i 4500
001 978-3-540-35636-3
003 DE-He213
005 20240423130003.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540356363
_9978-3-540-35636-3
024 7 _a10.1007/11784180
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aAlgebraic Methodology and Software Technology
_h[electronic resource] :
_b11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings /
_cedited by Michael Johnson, Varmo Vene.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXII, 392 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4019
505 0 _aInvited 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.
520 _aThis 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.
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aComputer programming.
650 0 _aComputer science
_xMathematics.
650 1 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aProgramming Techniques.
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aJohnson, Michael.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aVene, Varmo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540356332
776 0 8 _iPrinted edition:
_z9783540825982
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4019
856 4 0 _uhttps://doi.org/10.1007/11784180
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183816
_d183816