메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 60-67

Discovering use cases from source code using the Branch-Reserving Call Graph

Author keywords

Branch reserving call graph; Program comprehension; Reverse engineering; Use case; Use case discovery

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; REVERSE ENGINEERING; SOFTWARE ENGINEERING;

EID: 84944682824     PISSN: 15301362     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSEC.2003.1254358     Document Type: Conference Paper
Times cited : (18)

References (10)
  • 1
    • 0242529352 scopus 로고    scopus 로고
    • Frequent sets, sequences, and taxonomies: New, efficient algorithmic proposals
    • Tech. Rep, Universitat Politècnica de Catalunya UPC, Spain
    • J. Baixeries, G. Casas, and J. Balcázar, "Frequent Sets, Sequences, and Taxonomies: New, Efficient Algorithmic Proposals", Tech. Rep. LSI-00-78-R, Universitat Politècnica de Catalunya (UPC), Spain, 2000.
    • (2000) LSI-00-78-R
    • Baixeries, J.1    Casas, G.2    Balcázar, J.3
  • 5
    • 0037328519 scopus 로고    scopus 로고
    • A scenario-driven approach to trace dependency analysis
    • February
    • A. Egyed, "A Scenario-Driven Approach to Trace Dependency Analysis", IEEE Transactions On Software Engineering, VOL. 29, NO. 2, pp. 116-132, February 2003.
    • (2003) IEEE Transactions on Software Engineering , vol.29 , Issue.2 , pp. 116-132
    • Egyed, A.1
  • 10
    • 0033362381 scopus 로고    scopus 로고
    • On the relationships between static and dynamic models in reverse engineering Java software
    • IEEE Computer Society Press
    • th Working Conf. On Reverse Engineering (WCRE'99), pp. 304-313, IEEE Computer Society Press, 1999.
    • (1999) th Working Conf. on Reverse Engineering (WCRE'99) , pp. 304-313
    • Systa, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.