Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Call-Ordering Constraints Nam Tran, David Abramson, Christine Mingins
 

Summary: 1
Call-Ordering Constraints
Nam Tran, David Abramson, Christine Mingins
Faculty of Information Technology, Monash University
{nam.tran, david.abramson, christine.mingins}@infotech.monash.edu.au
Abstract
Several kinds of call-ordering problems have been
identified, all of which present subtle difficulties in
ensuring the correctness of a sequential program. They
include object protocols, synchronisation patterns and
re-entrance restrictions. This paper presents call-
ordering constraints as a unifying solution to these
problems. These constraints are new classes of con-
tracts in addition to traditional preconditions, post-
conditions and invariants. They extend the traditional
notion of behavioural subtyping. The paper shows how
constraint inheritance can almost ensure behavioural
subtyping conformance. The paper also shows how
these constraints may be monitored at run time. Call-
ordering constraints are included in the BECON con-

  

Source: Abramson, David - Caulfield School of Information Technology, Monash University

 

Collections: Computer Technologies and Information Sciences