E. Borger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Gurevich Festschrift). Proc. 14th International Workshop CSL, number 1862 in LNCS, pages 41--60. Springer-Verlag, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Abstract State Machine Primer - Huggins, Wallace (2002) (Correct)
....do in order to preserve your parallel block rule. A: If you nd that sequentiality is really necessary to your algorithm, and that the techniques we ve described above obscure the algorithm rather than illuminate it, there are language constructs for ASMs that add explicit sequential composition [11]. But those constructs can all be de ned in terms of the rules we presented. Q: Have we seen all the basic rule types A: There are a few others; we ll introduce them later, when we have a need for them. The rule types we have shown are sucient for all sequential algorithms [23] Q: It ....
E. Borger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000.
The Formal Definition of Anlauff's eXtensible Abstract State.. - Kutter (2002) (1 citation) (Correct)
....of the call is returned as value allowing for functional composition, and finally the effects of the called machine are returned at once, maintaining the referential transparency property of non hierarchical ASMs. Borger and Schmidt give a formal definition of a special case of the XASM call [8] where sequentiality, iteration, and parameterized, recursive ASM calls are supported. Unfortunately they are excluding the essential feature of both Anlauff s and May s original call to allow returning not only update sets, but as well a value. This restriction makes their call useless for the ....
E. Borger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editor, Gurevich Festschrift CSL 2000.
The ABCs of Specification: AsmL, Behavior, and Components - Barnett, Schulte (2001) (1 citation) (Correct)
....S i 1 by executing the updates of P at S i 1 . The updates generated in a particular step are called the update set for the step. To deal with industrial applications, we have extended ASMs with submachines, objects, exception handling [23] and a very powerful type system (as have others, see [2, 8, 10]) AsmL is freely available for non commercial research or teaching purposes from our web site [16] It is currently used within Microsoft for modeling, rapid prototyping, analyzing and checking of APIs, devices and protocols. We introduce AsmL at the same time as we develop the examples. Only a ....
E. Borger and J. Schmid. Composition and Submachine Concepts for Sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL
An ASM Semantics for UML Activity Diagrams - Börger, Cavarra, Riccobene (17 citations) (Correct)
....= dynMult then forall L i 2 dynArgs A(L i ) active : out For action nodes without dynamic arguments standard ASMs guarantee A to be an atomic (indivisible) action. In the presence of dynamic arguments a concept of parameterized ASMs with atomic interpretation is needed as provided in [4] for structuring large machines. 4 The initialization could also be described by a rule which res only in the initial state to perform the entry action of the main diagram D Main and to set the control of the unique running agent on the arc outgoing from the initial node. If the control is ....
....subdiagram structure: exitFromTo(D1 ; D2 ) loop through T 2 chainDgm(D1 ; D2 ) exit(T ) exited(T) true The macro deactivate(a) mode(a) suspended stops an agent s (sub)computation temporarily or permanently. The de nition of sequential composition and of iteration of ASMs provided in [4] guarantees that the machine exitDiagrams starts in the state in which an event triggers the application of the Event Handling rule and terminates its execution before the next event may take e ect, thus preventing nesting of calls of the exitDiagrams machine. Semantics of concurrent nodes. When ....
[Article contains additional citation context not shown here]
E. Borger, J. Schmid, Composition and Submachine Concepts for Sequential ASMs. Gurevich Festschrift, Proc. CSL'2000 (to appear).
A High-Level Modular Definition of the Semantics of C# - Börger, Fruja, Gervasi, Stärk (2004) Self-citation (Borger) (Correct)
No context found.
E. Borger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000.
A High-Level Modular Definition of the Semantics of C# - Börger, Fruja, Gervasi, Stärk (2003) (2 citations) Self-citation (Borger) (Correct)
No context found.
E. Borger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000.
A Proposal for an Abstract Neural Machine - Sona (2002) (Correct)
No context found.
E. Borger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Gurevich Festschrift). Proc. 14th International Workshop CSL, number 1862 in LNCS, pages 41--60. Springer-Verlag, 2000.
A Unified Formal Specification and Analysis of the New Java Memory .. - Awhad (2002) (2 citations) (Correct)
No context found.
Borger, E. and Schmid, J.: Composition and Submachine Concepts for Sequential ASMs In: Clote, P., Schwichtenberg, H. (eds.): Computer Science Logic (Proceedings of CSL 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC