¹School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China
²Key Laboratory of High Confidence Software Technologies (Peking University), Ministry of Education, Beijing 100871, China.
³School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410114, China.

---

Abstract—Hoare’s logic helps with program state descriptions, but is difficult to manipulate. Model checking emerged as a new trend in program verifications is best applied to system designs rather than implementations. This paper is committed to establish a component-based verification framework that combines both of them. The method applied consists of two steps: regarding predicates as states and connecting them with functional components in light of their relationships. Once a framework is set up, both program generation and verification can be automatically carried out. The principle presented here is not only applicable to sequential programs, but also to other types of program structures and paradigm such as iteration, branch structure and grammatical evolution, etc.

Index Terms—Finite state transition system, grammatical evolution, sequential programs, verification framework.

[PDF]

Cite: Pei He, Achun Hu, Dongqing Xie, Zhiping Fan, "Component-Based Verification Model of Sequential Programs," Journal of Software vol. 10, no. 11, pp. 1319-1326, 2015.