One of the most significant problems for existing program comprehension methods is its scalability. We introduce a new technique to make the scalability possible. In particular, we advocate the concept of ?simplicity? for program understanding. We first propose a simplified semantic network as domain knowledge representation; we then introduce a linear and domain-oriented program partitioning method which can partition a huge program into self-contained program modules so that the recovery of domain knowledge can be carried out within smaller program space. We also introduce a set of rules for recovering domain knowledge from C code followed by a theoretical analysis on these algorithms. A case study on programming style based program partitioning method is given. Finally, comparisons with other work are made and a conclusion is drawn
%0 Conference Paper
%1 Lia2001
%A Li, Yang
%A Yang, Honji
%D 2001
%I IEEE
%K program_comprehension programming style to_review
%P 98--107
%T Simplicity: a key engineering concept for program understanding
%X One of the most significant problems for existing program comprehension methods is its scalability. We introduce a new technique to make the scalability possible. In particular, we advocate the concept of ?simplicity? for program understanding. We first propose a simplified semantic network as domain knowledge representation; we then introduce a linear and domain-oriented program partitioning method which can partition a huge program into self-contained program modules so that the recovery of domain knowledge can be carried out within smaller program space. We also introduce a set of rules for recovering domain knowledge from C code followed by a theoretical analysis on these algorithms. A case study on programming style based program partitioning method is given. Finally, comparisons with other work are made and a conclusion is drawn
@inproceedings{Lia2001,
abstract = {One of the most significant problems for existing program comprehension methods is its scalability. We introduce a new technique to make the scalability possible. In particular, we advocate the concept of ?simplicity? for program understanding. We first propose a simplified semantic network as domain knowledge representation; we then introduce a linear and domain-oriented program partitioning method which can partition a huge program into self-contained program modules so that the recovery of domain knowledge can be carried out within smaller program space. We also introduce a set of rules for recovering domain knowledge from C code followed by a theoretical analysis on these algorithms. A case study on programming style based program partitioning method is given. Finally, comparisons with other work are made and a conclusion is drawn},
added-at = {2008-10-11T13:39:56.000+0200},
author = {Li, Yang and Yang, Honji},
biburl = {https://www.bibsonomy.org/bibtex/2bca87634c1679dadbdda95c78641d3e6/sjbutler},
interhash = {a9a11ca92e03d849fb02aac132f8203b},
intrahash = {bca87634c1679dadbdda95c78641d3e6},
keywords = {program_comprehension programming style to_review},
pages = {98--107},
publisher = {IEEE},
timestamp = {2008-10-11T13:39:56.000+0200},
title = {Simplicity: a key engineering concept for program understanding},
year = 2001
}