Tractable flow analysis for anomaly detection in distributed programs

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

Volumn 717 LNCS, Issue , 1993, Pages 283-300

  Cheung, S C ^a   Kramer, J ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS; GRAPH STRUCTURES; GRAPHIC METHODS; SOFTWARE ENGINEERING;

COMMUNICATION PATTERN; CONTROL FLOWS; DIRECTED EDGES; DISTRIBUTED PROGRAM; MINING ENVIRONMENTS; PROGRAM STATEMENTS; QUADRATIC COMPLEXITY; SYNCHRONOUS COMMUNICATIONS;

ANOMALY DETECTION;

EID: 12344269223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57209-0_20     Document Type: Conference Paper

References (14)

1. G.S. Avrunin, U.A. Buy, J.C. Corbett, et al.: Automated Analysis of Concurrent Systems with the Constrained Expression Toolset. IEEE TOSE 17, 11, 1204-1222.
2. S.C. Cheung and J. Kramer: Tractable Flow Analysis for Anomaly Detection in Distributed Programs, Technical Report, DOC 1993/3, March 1993.
3. P.C. Kanellakis and S.A. Smolka: On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. In Proc. 4th ACM Symposium on Principles of Distributed Computing, Ontario, Canada, August 1985, pp. 23-38.
4. J. Kramer, J. Magee, M. Sloman, et al.: CONIC: an Integrated Approach to Distributed Computer Control Systems. IEE Proceedings, Part E130, 1 (January 1983), 1-10.
5. C.E. McDowell and D.P. Helmbold: Debugging Concurrent Programs. ACM Computing Surveys 21, 4, 593-623.
6. N. Mercouroff: An Algorithm for Analyzing Communicting Processes. In Proc. Mathematical Foundation of Programming Semantics '91, Pittsburgh, PA, March 1991, published in LNCS 598.
7. W. Peng and S. Purushothaman: Towards data flow analysis of communicating finite state machines. In Proc. 8th ACM Symposium on Principles of Distributed Computing, August 1989.
8. W. Peng and S. Purushothaman: Data Flow Analysis of Communicating Finite State Machines. ACM Transactions on Programming Languages and Systems 13, 3, 399-432.
9. J. Reif and S. Smolka: Data Flow Analysis of Distributed Communicating Processes. Internation Journal of Parallel Programming 19, 1 (1990), 1-30.
10. J.H. Reif: Dataflow Analysis of Communicating Processes. In Proc. 6th ACM Symposium on Principles of Programming Languages, June 1979, pp. 257-268.
11. K.C. Tai and C.Y. Din: Validation of Concurrency in Software Specification and Design. In Proc. 3rd International Workshop on Software Specification and Design, London, UK, August 1985, pp. 223-227.
12. R.N. Taylor: Complexity of Analyzing the Synchonization Structure of Concurrent Programs. Acta Informatica 19, 57-84.
13. R.D. Yang and C.G. Chung: The Analysis of Infeasible Concurrent Paths of Concurrent Ada Programs. In Proc. 14th Annual International Computer Software and Applications Conference (COMPSAC 90), Chicago, Illinois, October 1990, pp. 424-429.
14. M. Young and R.N. Taylor: Combining Static Concurrency Analysis with Symbolic Execution. IEEE Transactions on Software Engineering 14, 10, 1499-1511.