Remarks on Turbo ASMs for Functional Equations and Recursion Schemes

The ASM Method for System Design and Analysis. A Tutorial Introduction

“…In the same way one can de ne a general ASM submachine concept that ts the synchronous parallel view of ASMs and supports the two abstraction levels de ned by the black-box and the white-box view of submachines (see [21]). It also supports the traditional understanding of recursive machine calls (see [12] The Initialize submachine o ers the possibility that the designer works with a black-box view|of an atomic operation that pushes all initialization methods in the right order onto the frame stack, followed by calling the Java interpreter to execute them (in the inverse order)|whereas the programmer and the veri er work with the re ned white-box view, which provides the necessary details to implement the machine and to analyze its global properties of interest (see [22]). …”

Abstract State Processes

“…We therefore advice to use asynchronous ASMs only where really appropriate. See in this context also [8]. Table 1.…”

“…That characterization also covers our usage of fresh local variables x , avoiding to introduce a new inference rule into the semantical description of ASPs. One can use a similar expedient to the one introduced in [8] to separate the 'logical' (read-only) variables from the variables for locations (write-variables). It suffices to write varIncar (x ) instead of x with a monadic function varIncar which takes variable incarnations as arguments; to guarantee that different incarnations of x are stored in different locations it suffices to pass to varIncar different arguments x , x .…”

“…Since stepping through the program of an ASP becomes part of the overall system evolution, the single steps of a sequential execution, of an iteration and of a submachine execution become visible. This white-box view differs from the black-box view of these concepts which has been realized by turbo ASMs in [9] for an integration of standard programming constructs, including recursion [8], into the synchronous parallelism of basic ASMs, and has been successfully applied in [21] for modelling and analysing the semantics of Java and its implementation on the Java Virtual Machine. The white-box view we define here naturally leads to equip ASPs with two more constructs:…”

Modeling Workflow Patterns from First Principles

“…If more than one branch gets activated, possibly concurrently, the activity following the merge is started for every activation of every incoming branch." 4 To capture the two Thread Merge variants it suffices to instantiate Activity to the set of execution threads in the considered single branch of a process and to declare MergeNo as static respectively dynamic. It is unclear whether there is a difference worth the two namings between the Synchronizer and the ThreadMerge pattern besides considering in the latter only the "execution threads in a single branch of the same process instance".…”