Normal view MARC view ISBD view

Abstract State Machines 2004. Advances in Theory and Practice [electronic resource] : 11th International Workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24-28, 2004. Proceedings / edited by Wolf Zimmermann, Bernhard Thalheim.

By: Zimmermann, Wolf [editor.].
Contributor(s): Thalheim, Bernhard [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 3052Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004Description: XII, 240 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540247739.Subject(s): Computer science | Software engineering | Logic design | Database management | Computer Science | Logics and Meanings of Programs | Software Engineering | Mathematical Logic and Formal Languages | Programming Languages, Compilers, Interpreters | Database ManagementDDC classification: 005.1015113 Online resources: Click here to access online
Contents:
Invited 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.
In: Springer eBooksSummary: Abstract 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Invited 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.

Abstract 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.

There are no comments for this item.

Log in to your account to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha