Dynamic protocol recovery

Proceedings - Working Conference on Reverse Engineering, WCRE

Volumn , Issue , 2007, Pages 219-228

  Quante, Jochen ^a   Koschke, Rainer ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; GRAPH THEORY; REENGINEERING; REVERSE ENGINEERING; ROBOTS; TRANSLATION (LANGUAGES);

LEARNING APPROACHES; PROTOCOL RECOVERY;

AUTOMATA THEORY;

EID: 51149108945     PISSN: 10951350     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCRE.2007.24     Document Type: Conference Paper

References (21)

1. G. Ammons, R. Bodik, and J. R. Larus. Mining specifications. In Proc. 29th Symp. on Principles of Prog. Languages (POPL), pages 4-16, 2002.
2. D. Angluin. Inference of reversible languages. Journal of the ACM, 29(3):741-765, 1982.
3. A. W. Biermann and J. A. Feldman. On the synthesis of finite-state machines from samples of their behaviour. IEEE Trans. on Comp., 21:591-597, 1972.
4. T. Eisenbarth, R. Koschke, and G. Vogel. Static object trace extraction for programs with pointers. Journal of Systems and Software, 77(3):263-284, Sep 2005.
5. D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific, programmerwritten compiler extensions. In Proc. 4th Symp. on Operating System Design and Impl., pages 1-16, 2000.
6. D. Haak. Werkzeuggestützte Herleitung von Protokollen. Diploma thesis, Univ. Stuttgart, CS, 2004.
7. T. Heiber. Semi-automatic protocol recovery. Diploma thesis, Univ. Stuttgart, Computer Science, 2000.
8. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, second edition, 2001.
9. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707-710, Feb. 1966.
10. D. Lo and S.-C. Khoo. QUARK: Empirical assessment of automaton-based specification miners. In Proc. of 13th WCRE, pages 51-60, 2006.
11. D. Lo and S.-C. Khoo. SMArTIC: towards building an accurate, robust and scalable specification miner. In Proc. of 14th FSE, pages 265-275, 2006.
12. K. M. Olender and L. J. Osterweil. Interprocedural static analysis of sequencing constraints. ACM Transactions on Software Engineering and Methodology, 1(1):21-52, Jan. 1992.
13. J. Quante and R. Koschke. Dynamic object process graphs. In Proc. of 10th CSMR, pages 81-90, 2006.
14. J. Quante and R. Koschke. Dynamic object process graphs. Journal of Systems and Software, 2007. Accepted for publication.
15. A. Raman and J. Patrick. The sk-strings method for inferring PFSA. In Proc. Workshop Automata Induction, Gramm. Inference and Lang. Acquisition, 1997.
16. S. P. Reiss and M. Renieris. Encoding program executions. In Proc. of 23rd ICSE, pages 221-230, 2001.
17. M. Richetin and F. Vernadet. Regular inference for syntactic pattern recognition: A case study. In Proc. 7th Intl. Conf. on Pattern Rec., pages 1370-1372, 1984.
18. M. Salah, T. Denton, S. Mancoridis, A. Shokoufandeh, and F. I. Vokolos. Scenariographer: A tool for reverse engineering class usage scenarios from method invocation sequences. In Proc. of ICSM, pages 155-164, 2005.
19. R. Sekar, M. Bendre, D. Dhurjati, and P. Bollineni. A fast automaton-based method for detecting anomalous program behaviors. In SP '01: Proc. of Symposium on Security and Privacy, pages 144-155, 2001.
20. J. Whaley, M. C. Martin, and M. S. Lam. Automatic extraction of object-oriented component interfaces. In Proc. of Symposium on Software Testing and Analysis, pages 218-228, 2002.
21. T. Xie and D. Notkin. Automatic extraction of sliced object state machines for component interfaces. In Proc. 3rd Workshop on Specification and Verification of Component-Based Systems, pages 39-46, 2004.