Sciweavers

Share
APSEC
2005
IEEE

Call-Ordering Constraints

9 years 26 days ago
Call-Ordering Constraints
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 callordering constraints as a unifying solution to these problems. These constraints are new classes of contracts in addition to traditional preconditions, postconditions 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. Callordering constraints are included in the BECON contract system, which has been implemented on the Common Language Infrastructure (CLI).
Nam Tran, David Abramson, Christine Mingins
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where APSEC
Authors Nam Tran, David Abramson, Christine Mingins
Comments (0)
books