By Topic

A taxonomy of call ordering problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
N. Tran ; Dept. of Comput. Sci. & Software Eng., Monash Univ., Clayton, Vic., Australia ; D. Abramson ; C. Mingins

The order of method calls in a program can present subtle problems in ensuring the program's correctness. Some of the problems have been known under different names in the open literature. These include protocols, synchronisation, re-entrance, mandatory calls, and the indirect invariant effect. However, all these problems relate to the temporal ordering of method calls. In essence, the orderings constrain invocations of methods that share program state or otherwise need to cooperate. This paper proposes taxonomy of call ordering problems and their proposed solutions. The taxonomy classifies the problems by showing their common root and a few distinguishing properties. The paper also sketches the key features of a practical unifying solution to these call ordering problems.

Published in:

Software Engineering Conference, 2004. 11th Asia-Pacific

Date of Conference:

30 Nov.-3 Dec. 2004