Fault Tolerant Design : An Introduction

Contents Acknowledgments xi 1. INTRODUCTION 1 1 Definition of fault tolerance 1 2 Fault tolerance and redundancy 2 3 Applications of fault-tolerance 2

[1]  Hannu Tenhunen,et al.  Computing attractors in dynamic networks , 2005, IADIS AC.

[2]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[3]  Hira Agrawal,et al.  Efficient coverage testing using global dominator graphs , 1999, PASTE '99.

[4]  Thomas Ball,et al.  What's in a region?: or computing control dependence regions in near-linear time for reducible control flow , 1993, LOPL.

[5]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[6]  G. Parisi,et al.  The modular structure of Kauffman networks , 1997, cond-mat/9708214.

[7]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8]  Arthur Henry Watson,et al.  Structured testing: analysis and extensions , 1996 .

[9]  Ijaz Ahmed.  Physics Review Letters , 2014 .

[10]  Edward S. Lowry,et al.  Object code optimization , 1969, CACM.

[11]  Simeon C. Ntafos,et al.  A Comparison of Some Structural Testing Strategies , 1988, IEEE Trans. Software Eng..

[12]  Maxim Teslenko,et al.  Compositional properties of random Boolean networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Sigrid Eldh.  Software Testing Techniques , 2007 .

[14]  Robert E. Tarjan,et al.  A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[15]  Robert E. Tarjan,et al.  Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[16]  Bernard Derrida,et al.  Distribution of local magnetisations in random networks of automata , 1987 .

[17]  L. Kadanoff,et al.  Boolean Dynamics with Random Couplings , 2002, nlin/0204062.

[18]  Antonia Bertolino,et al.  Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs , 1994, IEEE Trans. Software Eng..

[19]  Haim Kaplan,et al.  A new, simpler linear-time dominators algorithm , 1998, TOPL.

[20]  Pankaj Mudholkar,et al.  Software Testing , 2002, Computer.

[21]  Mikkel Thorup,et al.  Dominators in Linear Time , 1999, SIAM J. Comput..

[22]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[23]  Paul Walton Purdom,et al.  Immediate Predominators in a Directed Graph [H] (Algorithm 430) , 1972, Commun. ACM.

[24]  Elena Dubrova,et al.  Structural testing based on minimum kernels , 2005, Design, Automation and Test in Europe.

[25]  B. Derrida,et al.  Random networks of automata: a simple annealed approximation , 1986 .

[26]  Dov Harel,et al.  A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.

[27]  Hiralal Agrawal,et al.  Dominators, super blocks, and program coverage , 1994, POPL '94.