Theorem Proving Support for View Consistency Checking

Richard F. Paige; Jonathan S. Ostroff; Phillip J. Brooke

Theorem Proving Support for View Consistency Checking

Richard F. Paige, Jonathan S. Ostroff, Phillip J. Brooke

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented. The views, described in the BON modelling language, capture the static architecture of systems via contract-annotated class diagrams, and the dynamic view provided by collaboration diagrams. The constraints are specified as an extension of the BON metamodel, and are implemented in PVS. They ensure that the sequence of messages appearing in the dynamic view is legal, given the pre- and postconditions of methods appearing in the static view. An example of how the PVS theorem prover might be used to verify view consistency is described.

Original language	Undefined/Unknown
Pages (from-to)	115-134
Number of pages	20
Journal	L'OBJET
Volume	9
Issue number	4
Publication status	Published - 2003

Access to Document

http://objet.revuesonline.com/article.jsp?articleId=3633

Cite this

@article{8ce2ada6612e45b7a12fb02c61bd0282,

title = "Theorem Proving Support for View Consistency Checking",

abstract = "A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented. The views, described in the BON modelling language, capture the static architecture of systems via contract-annotated class diagrams, and the dynamic view provided by collaboration diagrams. The constraints are specified as an extension of the BON metamodel, and are implemented in PVS. They ensure that the sequence of messages appearing in the dynamic view is legal, given the pre- and postconditions of methods appearing in the static view. An example of how the PVS theorem prover might be used to verify view consistency is described. ",

author = "Paige, {Richard F.} and Ostroff, {Jonathan S.} and Brooke, {Phillip J.}",

year = "2003",

language = "Undefined/Unknown",

volume = "9",

pages = "115--134",

journal = "L'OBJET",

number = "4",

}

TY - JOUR

T1 - Theorem Proving Support for View Consistency Checking

AU - Paige, Richard F.

AU - Ostroff, Jonathan S.

AU - Brooke, Phillip J.

PY - 2003

Y1 - 2003

N2 - A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented. The views, described in the BON modelling language, capture the static architecture of systems via contract-annotated class diagrams, and the dynamic view provided by collaboration diagrams. The constraints are specified as an extension of the BON metamodel, and are implemented in PVS. They ensure that the sequence of messages appearing in the dynamic view is legal, given the pre- and postconditions of methods appearing in the static view. An example of how the PVS theorem prover might be used to verify view consistency is described.

AB - A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented. The views, described in the BON modelling language, capture the static architecture of systems via contract-annotated class diagrams, and the dynamic view provided by collaboration diagrams. The constraints are specified as an extension of the BON metamodel, and are implemented in PVS. They ensure that the sequence of messages appearing in the dynamic view is legal, given the pre- and postconditions of methods appearing in the static view. An example of how the PVS theorem prover might be used to verify view consistency is described.

M3 - Article

VL - 9

SP - 115

EP - 134

JO - L'OBJET

JF - L'OBJET

IS - 4

ER -