Algebraic Semantics-based Verification for EPDL at Task Level
Jinzhuo Liu, Lixia Wang, Wei Wang, Xuan Zhang, Ye Qian
Available Online May 2014.
- https://doi.org/10.2991/iccia.2012.87How to use a DOI?
- Software Evolution Processes, Task, Activity, EPDL, algebraic semantics.
- 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 of task 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Jinzhuo Liu AU - Lixia Wang AU - Wei Wang AU - Xuan Zhang AU - Ye Qian PY - 2014/05 DA - 2014/05 TI - Algebraic Semantics-based Verification for EPDL at Task Level BT - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012) PB - Atlantis Press SP - 360 EP - 363 SN - 1951-6851 UR - https://doi.org/10.2991/iccia.2012.87 DO - https://doi.org/10.2991/iccia.2012.87 ID - Liu2014/05 ER -