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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
