摘要：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.
其他关键词：Finite state transition system, grammatical evolution, sequential programs, verification framework.
