ASM 2005: Paris, France

Introduction

• Danièle Beauquier, Egon Börger, Anatol Slissenko:
  Introduction. 5-10
  

Invited Papers

• Serge Abiteboul, Susan B. Davidson, Tova Milo:
  Active XML and Data Activation. 11-16
  
• Jean-Raymond Abrial:
  Refinement, Decomposition and Instantiation of Discrete Models. 17-40
  
• Richard Banach, Michael Poppleton, Czeslaw Jeske, Susan Stepney:
  Retrenchment and the Mondex Electronic Purse. 41-48
  
• Egon Börger:
  The ASM Method: a Cornerstone in Computer Science Education. 49-56
  
• Michael J. Butler, Michael Leuschel, Colin F. Snook:
  Tools for System Validation with B Abstract Machines. 57-69
  
• Hubert Comon-Lundh:
  Normal Attacks on Security Protocols. 70
  
• Byron Cook:
  Finding Bugs in Device Drivers with Static Driver Verifier. 71
  
• Yuri Gurevich:
  Behavioral Computation Theory 2005. 72
  
• K. Rustan M. Leino:
  Program Verification and Programming Methodology. 73
  
• Gerhard Schellhorn:
  ASMs and Refinement of State-based Systems. 74-75
  
• Jim Woodcock:
  Unifying Program Refinement Calculi. 76
  

Submitted Papers

• Philippe Andary, Bruno Patrou, Pierre Valarcher:
  About Implementation of Primitive Recursive Algorithms. 77-90
  
• Egon Börger:
  Design Pattern Abstractions and Abstract State Machines. 91-100
  
• P. L. Brantingham, Uwe Glässer, B. Kinney, K. Singh, Mona Vajihollahi:
  Modeling Urban Crime Patterns: Viewing Multi-Agent Systems as Abstract State Machines. 101-118
  
• Colin Campbell, Margus Veanes:
  State Exploration with Multiple State Groupings. 119-130
  
• Dirk Fahland, Wolfgang Reisig:
  ASM-based Semantics for BPEL: The Negative Control Flow. 131-152
  
• Roozbeh Farahbod, Vincenzo Gervasi, Uwe Glässer:
  CoreASM: An Extensible ASM Execution Engine. 153-166
  
• Vladimir Filatov, Rostislav Yavorskiy:
  Scenario based Analysis of Linear Computations. 167-174
  
• Nicu G. Fruja:
  A Modular Design for the Common Language Runtime (CLR) Architecture. 175-200
  
• Amjad Gawanmeh, Ali Habibi, Sofiène Tahar:
  Embedding and Verification of PSL using AsmL. 201-216
  
• Susanne Graf, Andreas Prinz:
  Time in State Machines. 217-232
  
• Ali Habibi, Sofiène Tahar:
  AsmL Semantics in Fixpoint. 233-246
  
• Dominik Haneberg, Holger Grandy, Wolfgang Reif, Gerhard Schellhorn:
  Verifying Security Protocols: An ASM Approach. 247-262
  
• Horatiu Jula:
  ASM Semantics for C++ 2.0. 263-274
  
• Horatiu Jula, Nicu G. Fruja:
  An Executable Specification of C++. 275-288
  
• Martin Kardos:
  An Approach to Model Checking AsmL Specifications. 289-304
  
• Andrey Novikov, Rostislav Yavorskiy:
  Applying Formal Semantics of an Object-oriented Language to Program Invariant Checking. 305-312
  
• Antje Nowack:
  A Polynomial-Time Slicing Algorithm. 313-328
  
• Ana Paiva, Nikolai Tillmann, João C. P. Faria, Raul F. A. M. Vidal:
  Modeling and Testing Hierarchical GUIs. 329-344
  
• Patrizia Scandurra, Angelo Gargantini, Claudia Genovese, Tiziana Genovese, Elvinia Riccobene:
  A Concrete Syntax Derived From the Abstract State Machine Metamodel. 345-368
  
• Klaus-Dieter Schewe, Jane Zhao:
  ASM Ground Model and Refinement for Data Warehouses. 369-376
  
• Seshadhri Comandur, Anil Seth, Somenath Biswas:
  RAM Simulation of BGS Model of Abstract State Machines. 377-386
  
• Anatol Slissenko, Joëlle Cohen:
  On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays. 387-396
  
• Calvin Kai Fan Tang, Eugenia Ternovska:
  Model Checking Abstract State Machines with Answer Set Programming. 397-416
  
• Alexander Bienemann, Zalan Kramer, Peggy Schmidt, Bernhard Thalheim:
  ASM Support for Validation of Specifications: Lessons Learned from an eGovernment Project. 417-