Complexity Measure Based on Program Slicing and Its Validation
For a long time people pay widely attention to the program complexity measure which is one of the important methods for software quality management.However most of the existing complexity measures only involve one of the factors which influence the program complexity,such as the length of the program,control flow,data flow and so on.Some researchers have proposed some hybrid measures embracing many influential factors related to program complexity by weight sum and two-tuples.Whereas these measures can”t reflect the potential interaction among programs.In this paper we propose a complexity measure based on program slicing (CMBPC) which includes many influential factors related to program complexity,for example the length of the program,control flow,data flow,data types of output variables and the interactive relation between programs.Therefore it can reflect the program complexity better.Only the measures that are validated can be accepted by people.The properties proposed by Weyuker to determine the effectiveness of the program complexity measures are widely used in the validation of the program complexity measure.In this paper we will validate CMBPC from the theory by proving that it complies with the property set proposed by Weyuker.
program slicing complexity measure Weyuker”s properties validation Citation
国内会议
湖北恩施
英文
1-7
2014-09-13（万方平台首次上网日期，不代表论文的发表时间）