Issue No. 06 - June (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2215
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
strongly language disjoint checkers; sequential systems; totally self-checking; fault location; logic testing.
B. Courtois, I. Jansch, "Definition and Design of Strongly Language Disjoint Checkers", IEEE Transactions on Computers, vol. 37, no. , pp. 745-748, June 1988, doi:10.1109/12.2215