Completeness set proof of precondition and post-condition types of activity in any EPM
作者： Qian Yu , Tong Li , JinZhuo Liu , Xuan Zhang , Yong Yu
DOI: 10.1117/12.2050039
关键词: Computer programming 、 Mathematics 、 Mathematical induction 、 Set (abstract data type) 、 Logic programming 、 Software evolution 、 Completeness (order theory) 、 Precondition 、 Execution model 、 Theoretical computer science
摘要: Software evolution process model (EPM) is created in terms of a formal meta-model (EPMM) and semi-formal approach to modeling based on EPMM [1]. In order better manage control the software make best existing technology, method transform any EPM its execution logic programming has been proposed. Completeness conversion depends completeness rules, that is, all expressions original are found correspondence target model. Since transformation rules proposed precondition or post-condition types activities anyone EPM, this need prove activity type set set. To end, classified analyzing EPMs semantics execution. Type activity’s presented. Lastly we by mathematical induction.
harvard.edu
sci-hub.se 参考文章(6)
Stanley M. Sutton, From Process Programming to Process Engineering Springer, Berlin, Heidelberg. pp. 291- 309 ,(2011) , 10.1007/978-3-642-19823-6_15
Tong Li, An Approach to Modelling Software Evolution Processes ,(2008)
S. Bandinelli, A. Fuggetta, C. Ghezzi, S. Grigolli, Process Enactment in SPADE european workshop on software process technology. pp. 67- 83 ,(1992) , 10.1007/BFB0017505
Michael Huth, Mark Ryan, Logic in Computer Science Cambridge University Press. ,(2004) , 10.1017/CBO9780511810275
P. Jamart, A. van Lamsweerde, A reflective approach to process model customization, enactment and evolution Proceedings of the Third International Conference on the Software Process. Applying the Software Process. pp. 21- 32 ,(1994) , 10.1109/SPCON.1994.344427
Bill Curtis, Marc I. Kellner, Jim Over, Process modeling Communications of the ACM. ,vol. 35, pp. 75- 90 ,(1992) , 10.1145/130994.130998