摘要
程序流程图(简称PFG)是对程序进行测试分析的基础。本文旨在给出一个算法PFGA(程序流程图算法),它对我们所定义的语言L所编写的任意程序通过静态分析方法将求出程序的PFG。算法PFGA适用于多种高级语言程序,运用本算法的概念不难开发出相应的程序测试的辅助工具,因此PFGA具有一定的实用价值。
A program tes ing is based on the program flow graph (PFG) . In this paper, an algorithm for program flow graph is proposed. If any program of language L is defined, then its PFG can be ob ained by the static analysis algorithm. The program flow graph algorithm is suitable for many kinds of the high-level language program. The conception of this algorithm is an assistant tool, and the corresponding program testing can be developed by using is So that it has the advan age in the aspect of appli-cation.
出处
《吉林大学学报(信息科学版)》
CAS
1990年第2期8-15,共8页
Journal of Jilin University(Information Science Edition)
关键词
计算数学
静态
分析/程序流程图算法
computaional mathematics
static-state, analysis
program flow graph algorithm
progpam language theory