Algebraic Semantics-Based Verification for EPDL at Task Level

Abstract:

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.

• Periodical: Advanced Materials Research (Volumes 756-759)
• Pages: 2311-2315
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.756-759.2311
• Online since: September 2013
• Authors: Jin Zhuo Liu, Li Xia Wang, Wei Wang, Xuan Zhang, Ye Qian, Rui Zhu
• Keywords: Activity, Algebraic Semantics, EPDL, Software Evolution Processes, Task

References

[1] T. Li, An Approach to Modelling Software Evolution Processes, Springer-Verlag, Berlin, (2008).

[2] L.J. Osterweil, Understanding process and the quest for deeper questions in software engineering research, ACM SIGSOFT Software Engineering Notes 8: 6-14.

DOI: 10.1145/949952.940073

[3] R.Q. Lu, Formal semantics of computer language, Science press, Peking, (1992).

[4] A. Fuggetta, Software process: a roadmap, Proceedings of the conference on the future of software engineering, ACM Press, New York, pp.25-34.