(A) study on the software complexity measures based on data flow information = 데이타 흐름 정보에 기반을 둔 소프트웨어 복잡도에 관한 연구

Software complexity measure is believed to be the most objective and quantitative measure for the control of a software project. In this thesis, we propose a new approach for representing the software complexity. The complexity measure based on data flow information is defined as the maximum number of definition-use chains potentially contained in a program control graph. We investigate some characteristics of thus defined measure and compare its properties with those of existing measures, through experiments and statistical analysis with sample programs in order to show that this new measure has several advantages over the others. We also develop a tool a given program.
Advisors
Kwon, Yong-Raeresearcher권용래researcher
Publisher
한국과학기술원
Issue Date
1986
Identifier
65174/325007 / 000841221
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 1986.8, [ 1책(면수복잡) ]

URI
http://hdl.handle.net/10203/33704
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=65174&flag=t
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.
  • Hit : 124
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0