LEADER 06375nam 22008055 450 001 9910143618703321 005 20200701061649.0 010 $a3-540-44518-8 024 7 $a10.1007/3-540-44518-8 035 $a(CKB)1000000000211315 035 $a(SSID)ssj0000320767 035 $a(PQKBManifestationID)11937802 035 $a(PQKBTitleCode)TC0000320767 035 $a(PQKBWorkID)10249626 035 $a(PQKB)10506679 035 $a(DE-He213)978-3-540-44518-0 035 $a(MiAaPQ)EBC3072360 035 $a(PPN)155228471 035 $a(EXLCZ)991000000000211315 100 $a20100301d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAbstract State Machines - Theory and Applications $eInternational Workshop, ASM 2000 Monte Verita, Switzerland, March 19-24, 2000 Proceedings /$fedited by Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 386 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1912 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67959-6 320 $aIncludes bibliographical references and index. 327 $aAbstract State Machines at the Cusp of the Millenium -- Mathematical Foundations -- Abstract State Machines and Pure Mathematics -- Abstract State Machines and Computationally Complete Query Languages -- On Verification of Refinements of Timed Distributed Algorithms -- Abstract State Machine Languages -- Objects + Views = Components? -- XASM- An Extensible, Component-Based Abstract State Machines Language -- Generic Facilities in Object-Oriented ASMs -- Distribution and Concurrency -- Towards an ASM Thesis for Unconventional Algorithms -- Partially Ordered Runs: A Case Study -- Investigating Java Concurrency Using Abstract State Machines -- Compilers and Semantics -- Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations -- An ASM Dynamic Semantics for Standard ML -- Modeling the Dynamics of UML State Machines -- On the Formal Semantics of SDL-2000:A Compilation Approach Based on an Abstract SDL Machine -- Description and Simulation of Microprocessor Instruction Sets Using ASMs -- Automatic Verication and Model Checking -- Symbolic Analysis of Transition Systems? -- Encoding Abstract State Machines in PVS -- Model Checking Abstract State Machines and Beyond -- Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study -- Industrial Applications -- Report on a Practical Application of ASMs in Software Design -- Using Abstract State Machines at Microsoft: A Case Study. 330 $aThe ASM 2000 workshop was held in the conference center of the Swiss Federal Institute of Technology (ETH) at Monte Verit a, Canton Ticino, March 19-24, 2000. The ASM formalism was proposed together with the thesis that it is suitable to model arbitrary computer systems on arbitrary abstraction levels. ASMs have been successfully used to analyze and specify various hardware and software systems including numerous computer languages. The aim of the workshop was to bring together domain-experts, using ASMs as a practical speci cation method, and theorists working with ASMs and related methods. In addition the workshop served as a forum on theoretical and practical topics that relate to ASMs in a broad sense. Three tutorials including hands-on experience with tools were organized by U. Gl¨asser and G. del Castillo (on the topic \Specifying Concurrent Systems with ASMs"), H. Russ ¨ and N. Shankar (on the topic \A Tutorial Introduction to PVS"), M. Anlau , P.W. Kutter, and A. Pierantonio (on the topic \Developing Domain Speci c Languages"). In response to the organization committee?s call for papers, 30 papers were submitted, each of which was independently reviewed by four members of the program committee. This volume presents a selection of 12 of the refereed papers and two reports on industrial ASM application at Siemens AG and Microsoft Research, together with contributions based on the invited talks given by A. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1912 606 $aComputer logic 606 $aSoftware engineering 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aDatabase management 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 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 $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024 615 0$aComputer logic. 615 0$aSoftware engineering. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 0$aDatabase management. 615 14$aLogics and Meanings of Programs. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aSoftware Engineering. 615 24$aMathematical Logic and Formal Languages. 615 24$aDatabase Management. 676 $a511.3 702 $aGurevich$b Yuri$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKutter$b Philipp W$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOdersky$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aThiele$b Lothar$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143618703321 996 $aAbstract State Machines - Theory and Applications$91945095 997 $aUNINA