메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 155-164

Scenariographer: A tool for reverse engineering class usage scenarios from method invocation sequences

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE MAINTENANCE; LARGE SCALE SYSTEMS; OBJECT ORIENTED PROGRAMMING; PROGRAM DOCUMENTATION;

EID: 33646898215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2005.78     Document Type: Conference Paper
Times cited : (28)

References (27)
  • 4
    • 0035159313 scopus 로고    scopus 로고
    • A unified memory-based approach to cut, dissolve, key frame and scene analysis
    • Greece, October
    • A. Aner and J. R. Kender. A unified memory-based approach to cut, dissolve, key frame and scene analysis. In Proc. Inernational Conference on Image Processing, Greece, October 2001.
    • (2001) Proc. Inernational Conference on Image Processing
    • Aner, A.1    Kender, J.R.2
  • 5
    • 0020815483 scopus 로고
    • Inductive inference: Theory and methods
    • September
    • D. Angluin and C. Smith. Inductive inference: theory and methods. ACM Computing Surveys, 15(3):237-269, September 1983.
    • (1983) ACM Computing Surveys , vol.15 , Issue.3 , pp. 237-269
    • Angluin, D.1    Smith, C.2
  • 6
    • 0002139526 scopus 로고
    • The myriad virtues of subword trees
    • A. Apostolico and Z. Galil, editors. Springer-Verlag
    • A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial algorithms on words. Springer-Verlag, 1985.
    • (1985) Combinatorial Algorithms on Words
    • Apostolico, A.1
  • 7
    • 84938806379 scopus 로고
    • On the synthesis of finite-state machines from samples of their behavior
    • June
    • A. W. Biermann and J. A. Feldman. On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Computers, 21:592-597, June 1972.
    • (1972) IEEE Trans. Computers , vol.21 , pp. 592-597
    • Biermann, A.W.1    Feldman, J.A.2
  • 9
    • 84955609613 scopus 로고
    • Efficient algorithm for learning simple regular expressions from noisy examples
    • Algorithmic Learning Theory. Sringer-Verlag, New York, NY
    • A. Brazma. Efficient algorithm for learning simple regular expressions from noisy examples. In Algorithmic Learning Theory, volume 872 of Lecture Notes in Artificial Intelligence, pages 260-271. Sringer-Verlag, New York, NY, 1994.
    • (1994) Lecture Notes in Artificial Intelligence , vol.872 , pp. 260-271
    • Brazma, A.1
  • 14
    • 0000457427 scopus 로고    scopus 로고
    • Semidefinite programming in combinatorial optimization
    • M. X. Goemans. Semidefinite programming in combinatorial optimization. Mathematical. Programming, 79:143-161, 1997.
    • (1997) Mathematical. Programming , vol.79 , pp. 143-161
    • Goemans, M.X.1
  • 16
    • 49949150022 scopus 로고
    • Language identification in the limit
    • E. M. Gold. Language identification in the limit. Inf. Control, 10:447-474, 1967.
    • (1967) Inf. Control , vol.10 , pp. 447-474
    • Gold, E.M.1
  • 17
    • 0028466272 scopus 로고
    • Automatic synthesis of state machines from trace diagrams
    • July
    • K. Koskimies and E. Makinen. Automatic synthesis of state machines from trace diagrams. Software - Practice and Experience, 24(7):643-658, July 1994.
    • (1994) Software - Practice and Experience , vol.24 , Issue.7 , pp. 643-658
    • Koskimies, K.1    Makinen, E.2
  • 18
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Daklady, 10:707-710, 1966.
    • (1966) Soviet Physics Daklady , vol.10 , pp. 707-710
    • Levenshtein, V.1
  • 19
    • 0032620819 scopus 로고    scopus 로고
    • Derandomizing approximation algorithms based on semidefinite programming
    • S. Mahajan and H. Ramesh. Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing, 28(5): 1641-1663, 1999.
    • (1999) SIAM Journal on Computing , vol.28 , Issue.5 , pp. 1641-1663
    • Mahajan, S.1    Ramesh, H.2
  • 20
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • April
    • E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, April 1976.
    • (1976) Journal of the ACM , vol.23 , pp. 262-272
    • McCreight, E.M.1
  • 26
    • 84957596705 scopus 로고    scopus 로고
    • Extracting state diagrams from legacy systems
    • Lecture Notes in Computer Science (LNCS) 1357 Springer
    • T. Systa and K. Koskimies. Extracting state diagrams from legacy systems. In Proc. 1997 ECOOP Workshops, Lecture Notes in Computer Science (LNCS) 1357. Springer, 1997.
    • (1997) Proc. 1997 ECOOP Workshops
    • Systa, T.1    Koskimies, K.2
  • 27
    • 0003422462 scopus 로고    scopus 로고
    • Springer-Verlag, Berlin, Germany, second edition
    • V. V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, Germany, second edition, 2003.
    • (2003) Approximation Algorithms
    • Vazirani, V.V.1


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