[1] Y. Liu and K.S. Trivedi, “Survivability Quantification: The Analytical Modeling Approach,” International Journal of Performability Engineering 2, No. 1 (Jan. 2006): 29–44.

[2] R. J. Ellison, D. A. Fisher, R. C. Linger, H. F. Lipson, T. Longstaff, and N. R. Mead, “Survivable Network Systems: An Emerging Discipline,” Technical Report CMU/SEI-97-TR-013, Nov. 1997, Revised May 1999.

[3] N. R. Mead, R. J. Ellison, R. C. Linger, T. Longstaff, and J. McHugh, “Survivable Network Analysis Method,” Technical Report CMU/SEI-2000-TR-013, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA, 2000.

[4] P. G. Neumann, “Practical Architectures for Survivable Systems and Networks (Phase-Two Final Report),” SRI International, June 2000, at http://www.csl.sri.com/users/neumann/arl-one.html.

[5] M. S. Deutsch and R. R. Willis Software Quality Engineering: A Total Technical and Management Approach (Englewood Cliffs, NJ: Prentice Hall, 1988).

[6] J. C. Knight, E. A. Strunk, and K. J. Sullivan, “Towards a Rigorous Definition of Information System Survivability,” DISCEX 2003, Washington, DC, April 2003, pp. 78–89.

[7] J. C. Knight and K. J. Sullivan, “On the Definition of Survivability,” Technical Report CS-TR-33-00, Dept. of Computer Science, University of Virginia, Charlottesville, 2000.

[8] J. C. Laprie (Ed.), Dependability: Basic Concepts and Terminology (New York: Springer-Verlag, 1992).

[9] A. Avizienis, J. Laprie, and B. Randell, “Fundamental Concepts of Dependability,” Information Survivability Workshop (ISW2000), Boston, Oct. 24–26, 2000.

[10] F. B. Schneider, “Byzantine Generals in Action: Implementing Fail-Stop Processors,” ACM Transactions on Computer Systems 2, No. 2 (May 1984): 145–154.

[11] L. Lamport, M. Pease, R. Shostak, “The Byzantine Generals Problem,” ACM Transactions on Programming Languages and Systems 4, No. 3 (July 1982): 382–401.

[12] M. H. Azadmanesh and R.M. Kieckhafer, “Exploiting Omissive Faults in Synchronous Approximate Agreement,” IEEE Trans. Computers 49, No. 10 (Oct. 2000): 1031–1042.

[13] P. Thambidurai and Y.-K. Park, “Interactive Consistency with Multiple Failure Modes,” Proceedings of the 7th Symposium on Reliable Distributed Systems, Columbus, OH, Oct. 1988, pp. 93–100.

[14] F. J. Meyer and D. K. Pradhan, “Consensus with Dual Failure Modes,” IEEE Transactions on Parallel and Distributed Systems 2, No. 2 (April 1991): 214–222.

[15] B. W. Johnson, Design and Analysis of Fault-Tolerant Systems (Reading, MA: Addison Wesley, 1989).

[16] V. D. Agraval and S. C. Seth (Eds.), Tutorial: Test Generation for VLSI Chips (IEEE Computer Society Press, Los Alamitos, CA, Sept. 1988).

[17] H. Fujiwara, Logic Testing and Design for Testability (Boston: MIT Press, 1985).

[18] K.-T. Cheng and V. D. Agrawal, Unified Methods for VLSI Simulation and Test Generation (Kluwer Academic Publishers, Norwell, MA, 1989).

[19] K. Imamura, J. Foster, and A. Krings, “The Test Vector Problem and Limitations to Evolving Digital Circuits,” Proceedings of the 2nd NASA/DoD Workshop on Evolvable Hardware, (IEEE Press, Palo Alto, CA, July 13–15, 2000, pp. 75–80).

[20] Y. C. Yeh, “Triple-Triple Redundant 777 Primary Flight Computer,” 1996 IEEE Aerospace Applications Conference, Aspen, CO, 3–10 Feb. 1996, pp. 293–307.

[21] O. Babaoglu and R. Drummond, “Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts,” IEEE Transactions on Software Engineering SE-11, No. 6 (June 1985): 546–554.

[22] A. Krings and Z. Ma, “Fault-Models in Wireless Communication: Towards Survivable Ad Hoc Networks,” MILCOM 2006, Military Communications Conference, Washington, D.C., Oct. 23–25, 2006.

[23] C. Germain and N. Playez, “Result Checking in Global Computing Systems,” Proceedings of the 17th Annual ACM International Conference on Supercomputing (ICS 03), San Francisco, CA, June 23–26, 2003.

[24] A. Krings, J.-L. Roch, and S. Jafar, “Certification of Large Distributed Computations with Task Dependencies in Hostile Environments,” IEEE Electro/Information Technology Conference, (EIT 2005), Lincoln, NE, May 22–25, 2005.

[25] A. Krings, J.-L. Roch, S. Jafar, and S. Varrette, “A Probabilistic Approach for Task and Result Certification of Large-Scale Distributed Applications in Hostile Environments,” Proceedings of the European Grid Conference (EGC2005), in LNCS 3470 (Amsterdam: Springer Verlag, Feb. 14–16, 2005).

[26] R. Maxion, “CMU,” Keynote Speech of the Information Survivability Workshop, International Conference on Dependable Systems and Networks, DSN-2001, Goteborg, Sweden, 2001.

[27] J. Allen, A. Christie, W. Fithen, J. McHugh, J. Pickel and E. Stoner, “State of the Practice of Intrusion Detection Technologies,” Technical Report, CMU/SEI-99-TR-028, ESC-99-028, Jan. 2000.

[28] A. Krings and M. McQueen, “A Byzantine Resilient Approach to Network Security,” Proceedings of the 29th International Symposium on Fault-Tolerant Computing, Digest of FastAbstracts: FTCS-29, Madison, WI, June 15–18, 1999, pp. 13–14.

[29] A. Avizienis, “The N-Version Approach to Fault-Tolerant Software,” IEEE Transactions of Software Engineering SE-11, No. 12 (Dec. 1985): 1491–1501.

[30] M. R. Lyu (Ed.), Software Fault Tolerance (Chichester, England: John Wiley and Sons, Inc., 1995).

[31] J. C. Knight and N. G. Leveson, “An Experimental Evaluation of the Assumption of Independence in Multi-version Programming,” IEEE Transactions on Software Engineering SE-12, No. 1 (Jan. 1986): 96–109.

[32] J. J. Wylie, M. Bakkaloglu, V. Pandurangan, M. W. Bigrigg, S. Oguz, K. Tew, C. Williams, G. R. Ganger and P. K. Khosla, “Selecting the Right Data Distribution Scheme for a Survivable Storage System,” Technical Report, CMU-CS-01-120, Carnegie Mellon University, Pittsburgh, PA, May 2001.

[33] E. N. (Mootaz) Elnozahy, L. Alvisi, Y.-M. Wang and D. B. Johnson, “A Survey of Rollback-Recovery Protocols in Message-Passing Systems,” ACM Computing Survey 34, No. 3 (2002): 375–408.

[34] S. Jafar, A. Krings, T. Gautier, and J.-L. Roch, “Theft-Induced Checkpointing for Reconfigurable Dataflow Applications,” IEEE Electro/Information Technology Conference (EIT 2005), Lincoln, NE, May 22–25, 2005.

[35] G. Stellner, “CoCheck: Checkpointing and Process Migration for MPI,” Proceedings of the 10th International Parallel Processing Symposium (IPPS’96), 15–19 April, Honolulu, HI, April 15–19,. 1996, pp. 526–531.

[36] A. Bouteiller, P. Lemarinier, K. Krawezik, and F. Capello, “Coordinated Checkpoint versus Message Log for Fault Tolerant MPI,” Proceedings of the 2003 IEEE International Conference on Cluster Computing, Honk Hong, 2003, p. 242.

[37] M. Litzkow, T. Tannenbaum, J. Basney, and M. Livny, “Checkpoint and Migration of UNIX Processes in the Condor Distributed Processing System,” Tech. Report CS-TR-97-1346, University of Wisconsin, Madison, 1997.

[38] L. Gao and G. Malewicz, “Internet Computing of Tasks with Dependencies Using Unreliable Workers,” 8th International Conference on Principles of Distributed Systems (OPODIS’04), in LNCS 2004 (Amsterdam: Springer Verlag, Dec. 15–17, 2004).

[39] L. F. G. Sarmenta, “Sabotage-Tolerance Mechanisms for Volunteer Computing Systems,” Future Generation Computer Systems 4, No. 18 (2002).

[40] V. Strumpen, “Portable and Fault-Tolerant Software Systems,” IEEE Micro 18, No. 5 (Sept. 1998): 22–32.

[41] A. Krings, “Agent Survivability: An Application for Strong and Weak Chain Constrained Scheduling,” 37th Hawaii International Conference on System Sciences, (HICSS-37), Minitrack on Security and Survivability in Mobile Agent Based Distributed Systems, paper STSSM01, Jan. 2004.

[42] J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes (Berlin; New York: Springer-Verlag, 1996).

[43] P. Brucker, Scheduling Algorithms, 4th ed. (Berlin; New York: Springer-Verlag, 2004).

[44] E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, Sequencing and Scheduling: Algorithms and complexity, Vol. 4 of Handbook in Operations Research and Management Science (Amsterdam: North-Holland, 1993).

[45] A. Krings, W. S. Harrison, N. Hanebutte, C. Taylor, and M. McQueen, “A Two-Layer Approach to Survivability of Networked Computing Systems,” Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet, L’Aquila, Italy, Aug. 6–12, 2001, pp. 1–12.

[46] F. B. Schneider, “Towards Fault-Tolerant and Secure Agentry,” Proceedings of the 11th International Workshop on Distributed Algorithms, Saarbrücken, Germany, Sept. 1997.

[47] D. Johansen, R. van Renesse and F. B. Schneider, “Operating System Support for Mobile Agents,” Proceedings of the 5th IEEE Workshop on Hot Topics in Operating Systems, Washington, DC, May 4–5, 1995, pp. 42–45.

[48] D. Johansen, K. Marzullo, F. B. Schneider, K. Jacobsen, and D. Zagorodnov, “NAP: Practical Fault-Tolerance for Itinerant Computations,” Technical Report TR98-1716, Department of Computer Science, Cornell University, Ithaca, NY, Nov. 1998.

[49] K. Rothermel and M. Strasser, “A Fault-Tolerant Protocol for Providing the Exactly-Once Property of Mobile Agents,” Proceedings of the IEEE Symposium on Reliable Distributed Systems (SRDS’98), West Lafayette, Indiana, Oct. 1998, pp. 100–108.

[50] F.M.A. Silva, “A Transaction Model Based on Mobile Agents,” Ph.D. Thesis, Technical University, Berlin, Germany, 1999.

[51] M. Dror, W. Kubiak, and P. Dell’Olmo, “‘Strong’–‘Weak’ Chain Constrained Scheduling,” Ricerca Operativa 27 (1998): 35–49.

[52] J. Blazewicz, P. W. Dell’Olmo, M. Drozdowski, and M. G. Speranza, “Scheduling Multiprocessor Tasks on Three Dedicated Processors: Corrigendum,” Information Processing Letters 49 (1994): 269–270.

[53] J. Blazewicz, P. W. Dell’Olmo, M. Drozdowski, and M. G. Speranza, “Scheduling Multiprocessor Tasks on Three Dedicated Processors,” Information Processing Letters 41 (1992): 275–280.