LEADER 05683nam 22008055 450 001 996466226603316 005 20200706115226.0 010 $a1-280-30768-4 010 $a9786610307685 010 $a3-540-24773-4 024 7 $a10.1007/b98118 035 $a(CKB)1000000000212413 035 $a(DE-He213)978-3-540-24773-9 035 $a(SSID)ssj0000096289 035 $a(PQKBManifestationID)11127840 035 $a(PQKBTitleCode)TC0000096289 035 $a(PQKBWorkID)10081562 035 $a(PQKB)10660374 035 $a(MiAaPQ)EBC3088502 035 $a(PPN)155163779 035 $a(EXLCZ)991000000000212413 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAbstract State Machines 2004. Advances in Theory and Practice$b[electronic resource] $e11th International Workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24-28, 2004. Proceedings /$fedited by Wolf Zimmermann, Bernhard Thalheim 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XII, 240 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3052 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22094-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- Intra-step Interaction -- Closed-Loop Modeling and Related Problems of Embedded Control Systems in Engineering -- An ALGOL-View on Turbo ASM -- An ASM Specification of C# Threads and the .NET Memory Model -- Finite Cursor Machines in Database Query Processing -- Research Papers -- Formalizing Liveness-Enriched Sequence Diagrams Using ASMs -- Specification and Validation of the Business Process Execution Language for Web Services -- Monodic ASMs and Temporal Verification -- Towards an Interchange Language for ASMs -- Specification and Implementation Problems for C# -- An ASM Semantics for SSA Intermediate Representations -- Observations on the Decidability of Transitions -- A Security Logic for Abstract State Machines -- Slicing Abstract State Machines -- The Cryptographic Abstract Machine -- Modeling Discretely Timed Systems Using Different Magnitudes of Non-standard Reals. 330 $aAbstract state machines (ASM) sharpen the Church-Turing thesis by the c- sideration of bounded resources for computing devices. They view computations as an evolution of a state. It has been shown that all known models of com- tation can be expressed through speci?c abstract state machines. These models can be given in a representation-independent way. That is one advantage of transferring these models to ASM. The main advantage is, however, to provide a unifying theory to all of these models. At the same time ASM can be re?ned to other ASMs. Stepwise re?nement supports separation of concern during so- ware development and will support component-based construction of systems thus providing a foundation of new computational paradigms such as industrial programming, programming-in-the-large, and programming-in-the-world. ASM 2004 continued the success story of the ASM workshops. Previous workshops were held in the following European cities: Taormina, Italy (2003); Dagstuhl, Germany (2002); Las Palmas de Gran Canaria, Spain (2001); Monte Verita, Switherland (2000); Toulouse, France (1999); Magdeburg, Germany (1998); Cannes, France (1998, 1997); Paderborn, Germany (1996); and H- burg, Germany (1994). The ASM workshops have had predecessors, e.g., the famous Lipari Summer School in 1993, whose in?uential outcome was the f- damental Lipari Guide. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3052 606 $aComputer logic 606 $aMathematical logic 606 $aComputers 606 $aSoftware engineering 606 $aProgramming languages (Electronic computers) 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aProgramming languages (Electronic computers). 615 14$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Foundations. 615 24$aTheory of Computation. 615 24$aSoftware Engineering. 615 24$aMathematical Logic and Formal Languages. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a511.3 702 $aZimmermann$b Wolf$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aThalheim$b Bernhard$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466226603316 996 $aAbstract State Machines 2004. Advances in Theory and Practice$92179801 997 $aUNISA