Title :
Definition and design of strongly language disjoint checkers
Author :
Jansch, Ingrid ; Courtois, Bernard
Author_Institution :
Pos-Graduacao em Ciencia de Computacao, Univ. Fed. do Rio Grande do Sul, Porto Alegre, Brazil
fDate :
6/1/1988 12:00:00 AM
Abstract :
Strongly language-disjoint (SLD) checkers are to sequential systems what strongly code-disjoint checkers are to combinatorial systems. SLD checkers are the largest class of checkers with which a functional system can achieve the totally self-checking goal. Self-checking sequential systems are first addressed, and formal definitions of SLD checkers are given. The design of SLD checkers based on regular combinatorial self-checking components is then considered
Keywords :
fault location; logic testing; sequential systems; strongly language disjoint checkers; totally self-checking; Built-in self-test; Circuit faults; Fault tolerance; Hafnium; Proposals; Superluminescent diodes; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
