Share Email Print

Proceedings Paper

Completeness set proof of precondition and post-condition types of activity in any EPM
Author(s): Qian Yu; Tong Li; JinZhuo Liu; Xuan Zhang; Yong Yu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Software evolution process model (EPM) is created in terms of a formal evolution process meta-model (EPMM) and semi-formal approach to modeling based on EPMM [1]. In order to better manage and control the software evolution process and make the best of existing software technology, the method to transform any EPM to its execution model based logic programming has been proposed. Completeness of conversion depends on completeness of the rules, that is, all the expressions of the original model are found the correspondence in the target model. Since transformation rules are proposed based on precondition or post-condition types of activities in anyone EPM, this need to prove that activity type set in anyone EPM is completeness set. To this end, the precondition and post-condition of activities in EPM are classified based on analyzing all expressions in EPMs and the semantics of the activity execution. Type completeness set of activity’s precondition and its post-condition is presented. Lastly we prove that the activity type set in anyone EPM is completeness set by mathematical induction.

Paper Details

Date Published: 24 December 2013
PDF: 7 pages
Proc. SPIE 9067, Sixth International Conference on Machine Vision (ICMV 2013), 90671Z (24 December 2013); doi: 10.1117/12.2050039
Show Author Affiliations
Qian Yu, YunNan Univ. (China)
Tong Li, Yunnan Univ. (China)
JinZhuo Liu, Yunnan Univ. (China)
Xuan Zhang, Yunnan Univ. (China)
Yong Yu, Yunnan Univ. (China)

Published in SPIE Proceedings Vol. 9067:
Sixth International Conference on Machine Vision (ICMV 2013)
Branislav Vuksanovic; Antanas Verikas; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top