Algebraic Semantics-based Verification for EPDL at Task Level
The algebraic semantics has been applied to describe and verify semantics for a long period of time.In this paper,the algebraic semantics of EPDL oftnsk level is studied.The paper is divided into two parts.In the first part,the initial algebraic semantics of EPDL (AS-EPDL) of task level is given.As a consequence of the practical purpose,we give the expansion type,which can help the modularization of programming.However,there are two key problems we should concern about when the expansion type is built-hierarchy-consistency and sufficient-completeness.Therefore,we give the verification of these two properties in the second part of the paper.
Software Evolution Processes Task Activity EPDL algebraic semantics
Jinzhuo Liu Lixia Wang Wei Wang Xuan Zhang Ye Qian Rui Zhu
School of Software,Yunnan University Kunming, 650091, China School of Economics, Yunnan University Kunming, 650091, China School of Software, Yunnan University Key Laboratory in Software Engineering of Yunnan Province, Kun
国际会议
太原
英文
360-363
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）