Towards design recovery from observations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3235, Issue , 2004, Pages 133-149

  Ural, Hasan ^a   Yenigiin, Hiisnii ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b SABANCI UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENT SYSTEMS; DESIGN RECOVERY; REALIZABILITY; SUBFUNCTIONS; SYNTHESIS TECHNIQUES;

ALGORITHMS;

EID: 33646525955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30232-2_9     Document Type: Article

References (19)

1. ITU-T Recommendation Z.120. Message Sequence Charts (MSC96) (1996)
2. Rudolph, E., Graubmann, P., Gabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems-SDL and MSC 28 (1996)
3. Alur, R., Holzmann, G. J., Peled, D.: An analyzer for message sequence charts. Software Concepts and Tools 17 (1996) 70-77
4. Ben-Abdallah, H., Leue, S.: Syntactic detection of progress divergence and nonlocal choice in message sequence charts. In: 2nd TACAS. (1997) 259-274
5. Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: 10th International Conference on Concurrency Theory, Springer Verlag (1999) 114-129
6. Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. In: 22nd International Conference on Software Engineering. (2000) 304-313
7. Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. IEEE Transactions on Software Engineering 29 (2003) 623-633
8. Alur, R., Etessami, K., Yannakakis, M.: Readability and verification of MSC graphs. In: Automata, Languages and Programming, 28th International Colloquium, ICALP, LNCS 2076. (2001)
9. Lohrey, M.: Safe realizability of high-level message sequence charts. In: 13th International Conference in Concurrency Theory, CONCUR 2002. (2002) 177192
10. Chikofsky, E., Cross, J.: Reverse engineering and design recovery. IEEE Software 7 (1990) 13-17
11. Lee, D., Sabnani, K.: Reverse engineering of communication protocols. (In: IEEE ICNP'93) 208-216
12. Koskimies, K., Makinen, E.: Automatic synthesis of state machines from trace diagrams. Software-Practice & Experience 24 (1994) 643-658
13. Rajagopal, M., Miller, R. E.: Synthesizing a protocol converter from executable protocol traces. IEEE Transactions on Computers 40 (1991) 487-499
14. Zafiropulo, P., West, C., Rudin, H., Cowan, D.D., Brand, D.: Towards analyzing and synthesizing protocols. IEEE Transactions on Communications 28 (1980) 651-660
15. Saleh, K., Boujarwah, A.: Communications software reverse engineering: A semiautomatic approach. Information & Software Technology 38 (1996) 379-390
16. Saleh, K., Probert, R. L., Manonmani, L: Recovery of communication protocol design from protocol execution traces. (In: IEEE ICECCS'96) 265-272
17. Chen, X. J., Ural, H.: Construction of deadlock-free designs of communication protocols from observations. The Computer Journal 45 (2002) 162-173
18. Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press (1994)
19. Muscholl, A., Peled, D., Su, Z.: Deciding properties of message sequence charts. In: Foundations of Software Science and Computation Structures. (1998)