A Method for Measuring the Structure Complexity of Web Application

作     者：MAO Cheng-ying LU Yan-sheng 

作者机构：College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074Hubei China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2006年第11卷第1期

页      面：143-150页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Supported by the Defense Pre-Research Project ofthe 10th Five-Year Plan of China (413150902)  andthe Defense Pre-Research Project of the Navy Equipment Ministry (10104010201) 

主　　题：structure complexity measure DD graph,HTree tree WNG graph 

摘      要：The precise and effective measure results of Web applications not only facilitate good comprehension of them, but also benefit to the macro-management of software activities, such as testing, reverse engineering, reuse, etc. The paper exploits some researches on measuring the structure complexity of Web application. Through a deep analysis of the configuration and objects＇ interactions of Web system, two conclusions have been drawn：① A generic Web application consists of static web page, dynamic page, component and database object; ② The main interactions have only three styles, that is static link, dynamic link and call/return relation. Based on analysis and modeling of the content of a Web page （static or dynamic）, complexity measure methods of both control logic of script and nesting of HTML code are further discussed. In addition, two methods for measuring the complexity of inte〉page navigation are also addressed by modeling the inte〉page navigation behaviors of Web application via WNG graph.