%0 Conference Paper %1 Ratiu2010 %A Ratiu, D. %A Heinemann, L. %B 18th Int'l Conf. on Program Comprehension %D 2010 %I IEEE %K concept source natural_language identifier Java %P 94 -103 %R 10.1109/ICPC.2010.26 %T Utilizing Web Search Engines for Program Analysis %X Programming involves representing domain concepts by using programming abstractions. In object-oriented programs, concepts and relations of the business domain are represented as classes, attributes and methods. However, the concepts and relations that logically belong together are scattered across different modules, interleaved with technical concepts, and distorted due to implementation details. In this paper, we present an automatic method to identify logically related concepts and the relations among them. To achieve this, we systematically transform program identifiers into fragments of natural language sentences and check whether these sentence fragments are meaningful for humans. In order to automatically perform such checks, we use the World Wide Web as a knowledge base that contains a huge number of meaningful texts, and use the Google web search engine to validate the meaningfulness of these sentences. If the search engine returns a sufficient number of hits, we discovered a piece of knowledge in the code. By systematically applying this method, we obtain a condensed form of the knowledge embodied in the program which is an enabler for automatic analyses. We present our experience with several use-cases: (1) assessing the meaningfulness of identifiers, (2) extracting complex concepts from compound identifiers, (3) extracting a meaningful taxonomy from the class hierarchy, and (4) extracting complex conceptual relations from the code. We report on our observations during the analysis of real world Java code, discuss the limitations of our approach and sketch extension possibilities.

@inproceedings{Ratiu2010, abstract = {Programming involves representing domain concepts by using programming abstractions. In object-oriented programs, concepts and relations of the business domain are represented as classes, attributes and methods. However, the concepts and relations that logically belong together are scattered across different modules, interleaved with technical concepts, and distorted due to implementation details. In this paper, we present an automatic method to identify logically related concepts and the relations among them. To achieve this, we systematically transform program identifiers into fragments of natural language sentences and check whether these sentence fragments are meaningful for humans. In order to automatically perform such checks, we use the World Wide Web as a knowledge base that contains a huge number of meaningful texts, and use the Google web search engine to validate the meaningfulness of these sentences. If the search engine returns a sufficient number of hits, we discovered a piece of knowledge in the code. By systematically applying this method, we obtain a condensed form of the knowledge embodied in the program which is an enabler for automatic analyses. We present our experience with several use-cases: (1) assessing the meaningfulness of identifiers, (2) extracting complex concepts from compound identifiers, (3) extracting a meaningful taxonomy from the class hierarchy, and (4) extracting complex conceptual relations from the code. We report on our observations during the analysis of real world Java code, discuss the limitations of our approach and sketch extension possibilities.}, added-at = {2010-09-14T18:34:13.000+0200}, author = {Ra\c{t}iu, D. and Heinemann, L.}, biburl = {https://www.bibsonomy.org/bibtex/2d0b7c36e3cc37f13a1449e14c3f5ebe4/sjbutler}, booktitle = {18th Int'l Conf. on Program Comprehension}, doi = {10.1109/ICPC.2010.26}, interhash = {80fecee18194894ae1f887b16a1c0099}, intrahash = {d0b7c36e3cc37f13a1449e14c3f5ebe4}, keywords = {concept source natural_language identifier Java}, month = {jun.}, pages = {94 -103}, publisher = {IEEE}, timestamp = {2010-09-14T18:34:13.000+0200}, title = {Utilizing Web Search Engines for Program Analysis}, year = 2010 }