Recovery of CFSM-based protocol and service design from protocol execution traces

Information and Software Technology

Volumn 41, Issue 11, 1999, Pages 839-852

  Saleh, K ^a   Probert, R ^b   Al Saqabi, K ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONCURRENCY CONTROL; NETWORK PROTOCOLS; REVERSE ENGINEERING; SYSTEMS ANALYSIS; TELECOMMUNICATION SERVICES;

COMMUNICATING FINITE STATE MACHINES; DESIGN RECOVERY; TIMING BEHAVIOUR;

FINITE AUTOMATA;

EID: 0032599426     PISSN: 09505849     EISSN: None     Source Type: None    
DOI: 10.1016/S0950-5849(99)00041-5     Document Type: Article

References (16)

1. K. Saleh, Protocol Engineering, Editorial, Computer Communications (Special Issue on Protocol Engineering) 19 (14) (1996) 1131-1133.
2. K. Saleh, A. Boujarwah, Communications software reverse engineering. A semi-automatic approach, Journal of Information and Software Technology 38 (1996) 379-390.
3. E. Chikofsky, J. Cross, Reverse engineering and design recovery: a taxonomy, IEEE Software, Special issue on Reverse Engineering, January 1990, pp. 13-17.
4. K. Koskimies, E. Makinen, Automatic synthesis of state machines from trace diagrams, Software-Practice and Experience 24 (7) (1994) 643-658.
5. K. Koskimies, T. Systä, J. Tuomi, Automated support for modeling OO software, IEEE Software 15 (1) (1998).
6. T.Y. Choi, A sequence method for protocol construction, Proceedings of the Sixth IFIP International Workshop on Protocol Specification, Testing and Verification, June 1986, pp. 9/1-9/18.
7. R. McNaughton, Y. Yamada, Regular expressions and state graphs for automata, IRE Transactions on Electronic Computers March (1960) 39-47.
8. S. Some, R. Dssouli, J. Vaucher, From scenarios to timed automata: building specifications from users requirements, in Proceedings of the Second Asia Pacific Software Engineering Conference (APSEC'95), December 1995.
9. K. Saleh, R. Probert, I. Manonmani, Recovery of communications protocol design from protocol execution traces, Proceedings of the second 2nd IEEE International Conference on Engineering Complex Computer Systems (ICECCS'96), , October 1996, pp. 265-272.
10. F. Mattern, Virtual time and global states of distributed systems, Proceedings of the Parallel and Distributed Algorithms, North-Holland, Amsterdam, 1988, pp. 215-226.
11. K. Saleh, I. Ahmed, K. Al-Saqabi, A. Agarwal, Dynamic checkpointing procedure for the design of stabilizing protocols, Journal of Information and Software Technology 35 (8) (1993) 479-485.
12. R.L. Probert, K. Saleh, Synthesis of communications protocols: survey and assessment, IEEE Transactions on Computers 40 (4) (1991) 468-476.
13. Z. Kohavi, Switching and Finite Automata Theory, MacGraw-Hill, New York, 1978.
14. K. Saleh, I. Ahmed, K. Al-Saqabi, A. Agarwal, recovery approach to the design of stabilizing communication protocols, Computer Communications. 18 (4) (1995) 276-287.
15. W. Llyold, P. Kearns, Using tracing to direct our reasoning about distributed programs, Proceedings of the IEEE Parallel and Distributed Computing Systems, 1991, pp. 552-559.
16. K. Saleh, K. Al-Saqabi, Error detection and diagnosis for fault tolerance in distributed systems, Journal of Information and Software Technology 39 (14/15) (1998) 975-983.