Survivability analysis of networked systems

Proceedings - International Conference on Software Engineering

Volumn 2001-May, Issue , 2001, Pages 307-317

  Jha, Somesh ^a   Wing, Jeannette M ^b  

^a University of Wisconsin Madison   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST-BENEFITS ANALYSIS; FAILURE EVENTS; GLOBAL ANALYSIS; INTRUSION EVENTS; NETWORKED SYSTEMS; RELIABILITY BENEFITS; SCENARIO GRAPHS; SURVIVABILITY ANALYSIS; SYSTEM MODELS; SYSTEMATIC METHOD; LATENCY ANALYSIS; SYSTEM SURVIVABILITY;

COST BENEFIT ANALYSIS; SOFTWARE ENGINEERING;

COMPUTER NETWORKS; COST BENEFIT ANALYSIS; FAULT TREE ANALYSIS; GRAPH THEORY; MATHEMATICAL MODELS; RELIABILITY;

EID: 0035001146     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2001.919104     Document Type: Conference Paper

References (19)

1. Nusmv: a new symbolic model checker. http://afrodite.itc.it:1024nusmv/.
2. E. Altman. Constrained Markov Decision Processes. Chapman and Hall, 1998.
3. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with faimess. Distributed Computing, 11:125-155, 1998.
4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEETrans. Comput., C-35(8):677-691, Aug. 1986.
5. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
6. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of ACM, 42(4):857-907, 1995.
7. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using mtbdds and the kronecker representation. In Proceedings of TACAS 2ooO: 6th lntemational Worskshop on Tools and Algorithms for the Construction and Analysis of Systems, 2000.
8. R. Ellison, D. Fisher, R. Linger, H. Lipson, T, Longstaff, and N. Mead. Survivable network systems: An emerging discpline. Technical Report CMU/SEI-97-153, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA 15213, November 1997.
9. R. Ellison, R. Linger, T. Longstaff, and N. Mead. Survivability network system analysis: A case study. IEEE Sofware, 16/4, July/August 1999.
10. D. Farmer and E, Spafford. The cops security checker system. In Proceedings Summer Usenix Conference, 1990.
11. In Proceedings of the Third Information Sunlivability Workshop, Boston, MA, October 24-26 2000.
12. In Information Sunhability Workshop, ISW, October 1998. http://www.cert.org/research/isw98.html.
13. J. Knight, M. Elder, J. Flinn, and P. Man. Summaries of three critical infrastructure applications. Technical Report CS-97-27, Department of Computer Science, University of Virginia, Charlottesville, VA 22903, December 1997.
14. N. Leveson. Safeware: System Safety and Computers. Addison-Wesley, 1995.
15. N. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings PODC, pages 314-323, 1994.
16. R. Ortalo, Y. Deswarte, and M. Kaaniche. Experimenting with quantitative evaluation tools for monitoring operational security. IEEE Transactionson Software Engineering, 25/5:633450, Sept/Oct 1999.
17. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
18. A. Pnueli. A temporal logic of concurrent programs. Theoretical Comput.Sci., 13:45-60, 1981.
19. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1998.