default search action
ASM 2004: Lutherstadt Wittenberg, Germany
- Wolf Zimmermann, Bernhard Thalheim:
Abstract State Machines 2004. Advances in Theory and Practice, 11th International Workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24-28, 2004. Proceedings. Lecture Notes in Computer Science 3052, Springer 2004, ISBN 3-540-22094-1
Invited Papers
- Yuri Gurevich:
Intra-step Interaction. 1-5 - Hans-Michael Hanisch:
Closed-Loop Modeling and Related Problems of Embedded Control Systems in Engineering. 6-19 - Hans Langmaack:
An ALGOL-View on Turbo ASM. 20-37 - Robert F. Stärk, Egon Börger:
An ASM Specification of C# Threads and the .NET Memory Model. 38-60 - Jan Van den Bussche:
Finite Cursor Machines in Database Query Processing. 61
Research Papers
- Alessandra Cavarra, Juliana Küster Filipe:
Formalizing Liveness-Enriched Sequence Diagrams Using ASMs. 62-77 - Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi:
Specification and Validation of the Business Process Execution Language for Web Services. 78-94 - Michael Fisher, Alexei Lisitsa:
Monodic ASMs and Temporal Verification. 95-110 - Elvinia Riccobene, Patrizia Scandurra:
Towards an Interchange Language for ASMs. 111-126 - Nicu G. Fruja:
Specification and Implementation Problems for C#. 127-143 - Sabine Glesner:
An ASM Semantics for SSA Intermediate Representations. 144-160 - Yuri Gurevich, Rostislav Yavorskiy:
Observations on the Decidability of Transitions. 161-168 - Stanislas Nanchen, Robert F. Stärk:
A Security Logic for Abstract State Machines. 169-185 - Antje Nowack:
Slicing Abstract State Machines. 186-201 - Dean Rosenzweig, Davor Runje:
The Cryptographic Abstract Machine. 202-217 - Heinrich Rust:
Modeling Discretely Timed Systems Using Different Magnitudes of Non-standard Reals. 218-233
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.