On modelling recursive calls and callbacks with two variants of Unified Modelling Language state diagrams-Reference-Cited by-同舟云学术

On modelling recursive calls and callbacks with two variants of Unified Modelling Language state diagrams

Published:2006-12 Issue:4 Volume:18 Page:397-420
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Tenzer Jennifer¹,Stevens Perdita¹

Affiliation:

1. Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, JCMB, King’s Buildings, Mayfield Road, EH9 3JZ, Edinburgh, UK

Abstract

Abstract An important use of the Unified Modelling Language (UML) is modelling synchronous object-oriented software systems. State diagrams are used to model interesting object behaviour, including method invocation. However, almost all previous work formalising state diagrams has assumed asynchronous communication. We show that UML’s “run to completion” semantics leads to anomalous behaviour in the synchronous case, and in particular that it is not possible to model recursive calls, in which an object receives a second synchronous message whilst still in the process of reacting to the first. We propose a solution using state diagrams in two complementary ways.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-006-0003-6.pdf

Reference23 articles.

1. Alur R Etessami K Yannakakis M (2001) Analysis of recursive state machines. In: Proceedings of computer aided verification CAV’01. LNCS; vol 2102. Springer; Berlin Heidelberg New York pp 207–220

2. The Argo UML Project. Website at http://argouml.tigris.org/

3. Börger E Cavarra A Riccobene E (2002) A precise semantics of UML state machines: making semantic variation points and ambiguities explicit. In: Proceedings of semantic foundations of engineering design languages SFEDL Satellite workshop of ETAPS’02

4. Benedikt M Godefroid P Reps TW (2001) Model checking of unrestricted hierarchical state machines. In: Proceedings of automata languages and programming ICALP’01. LNCS; vol 2076; Springer; Berlin Heidelberg New York pp 652–666

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the synthesis of protocol state machines from contracts;Proceedings of the ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems;2016-10-02

2. VERA: A Flexible Model-Based Vulnerability Testing Tool;2013 IEEE Sixth International Conference on Software Testing, Verification and Validation;2013-03

3. Non-interference on UML State-Charts;Objects, Models, Components, Patterns;2012

4. A language-driven approach for the design of interactive applications;Interacting with Computers;2008-01