Skip to main content
SpringerLink
Log in

Abstract State Machines - Theory and Applications

International Workshop, ASM 2000 Monte Verita, Switzerland, March 19-24, 2000 Proceedings

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Yuri Gurevich

    1. Microsoft Research, Redmond, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Philipp W. Kutter

    1. ETH Zürich, Institute TIK Gloriastr., Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Martin Odersky

    1. EPFL Lausanne, DI IN-Ecublens, Lausanne, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Lothar Thiele

    1. ETH Zürich, Institute TIK Gloriastr., Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1912)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Introduction

    1. Abstract State Machines at the Cusp of the Millenium

      • Egon Börger
      Pages 1-8

  3. Mathematical Foundations

    1. Abstract State Machines and Pure Mathematics

      • Andreas Blass
      Pages 9-21

    2. Abstract State Machines and Computationally Complete Query Languages

      • Andreas Blass, Yuri Gurevich, Jan Van den Bussche
      Pages 22-33

    3. On Verification of Refinements of Timed Distributed Algorithms

      • J. Cohen, A. Slissenko
      Pages 34-49

  4. Abstract State Machine Languages

    1. Objects + Views = Components?

      • Martin Odersky
      Pages 50-68

    2. XASM- An Extensible, Component-Based Abstract State Machines Language

      • Matthias Anlauff
      Pages 69-90

    3. Generic Facilities in Object-Oriented ASMs

      • A. V. Zamulin
      Pages 91-111

  5. Distribution and Concurrency

    1. Towards an ASM Thesis for Unconventional Algorithms

      • Wolfgang Reisig
      Pages 112-130

    2. Partially Ordered Runs: A Case Study

      • Yuri Gurevich, Dean Rosenzweig
      Pages 131-150

    3. nvestigating Java Concurrency Using Abstract State Machines

      • Yuri Gurevich, Wolfram Schulte, Charles Wallace
      Pages 151-176

  6. Compilers and Semantics

    1. Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations

      • Gerhard Goos, Wolf Zimmermann
      Pages 177-202

    2. An ASM Dynamic Semantics for Standard ML

      • Steven C. Cater, James K. Huggins
      Pages 203-222

    3. Modeling the Dynamics of UML State Machines

      • Egon Börger, Alessandra Cavarra, Elvinia Riccobene
      Pages 223-241

    4. On the Formal Semantics of SDL-2000:A Compilation Approach Based on an Abstract SDL Machine

      • Robert Eschbach, Uwe Glässer, Reinhard Gotzhein, Andreas Prinz
      Pages 242-265

    5. Description and Simulation of Microprocessor Instruction Sets Using ASMs

      • Jürgen Teich, Kutter Philipp W., Ralph Weper
      Pages 266-286

  7. Automatic Verication and Model Checking

    1. Symbolic Analysis of Transition Systems?

      • Natarajan Shankar
      Pages 287-302

    2. Encoding Abstract State Machines in PVS

      • Angelo Gargantini, Elvinia Riccobene
      Pages 303-322

    3. Model Checking Abstract State Machines and Beyond

      • Marc Spielmann
      Pages 323-340

    4. Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study

      • Kirsten Winter
      Pages 341-360
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Microsoft Research, Redmond, USA

    Yuri Gurevich

  • ETH Zürich, Institute TIK Gloriastr., Zürich, Switzerland

    Philipp W. Kutter, Lothar Thiele

  • EPFL Lausanne, DI IN-Ecublens, Lausanne, Switzerland

    Martin Odersky

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation