Abstract State Machines - Theory and Applications: International Workshop, ASM 2000 Monte Verita, Switzerland, March 19-24, 2000 Proceedings
Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele
Springer Science & Business Media, Aug 23, 2000 - Computers - 386 pages
The 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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Abstract State Machines at the Cusp of the Millenium
Abstract State Machines and Pure Mathematics
Abstract State Machines and Computationally Complete Query Languages
On Verification of Refinements of Timed Distributed Algorithms
Objects + Views Components?
Xasm An Extensible ComponentBased Abstract State Machines Language
Generic Facilities in ObjectOriented ASMs
Towards an ASM Thesis for Unconventional Algorithms
Modeling the Dynamics of UML State Machines
A Compilation Approach Based on an Abstract SDL Machine
Description and Simulation of Microprocessor Instruction Sets Using ASMs
Symbolic Analysis of Transition Systems
Encoding Abstract State Machines in PVS
Model Checking Abstract State Machines and Beyond
Lessons Learned from the FLASH Case Study
Report on a Practical Application of ASMs in Software Design
Other editions - View all
abstract machine Abstract State Machines access message agents algorithm ASM model ASM’s assign action behavior boolean Börger compiler component Computer Science concurrent runs construct corresponding CurTerm.Value debugger defined definition denote dynamic functions editor Egon Börger elements encoding endif environment evaluation Evolving Algebras example execution expression FBTL finite formal formula given graph Gurevich implementation initial input interpretation iterator Java KEEPGOING LNCS load action lock logic macro main memory mapping method mode(me model checking module multiset notion object type object-oriented operational semantics operations processor programming language proof properties refinement require runtime semantics sequence sequential simulation specification Springer-Verlag Standard ML static store action structure symbol syntax temporal logic theorem thread transformation transition relation transition rules transition system undef University update verification vocabulary volatile variable whilenew Xasm Yuri Gurevich