Automating the verification of memory tests
A.J. van de Goor, Bram de Smit · 2002
Verification, consisting of completeness and irredundancy proofs for memory tests, can be quite complicated. This paper presents a method to automatically verify march tests for any type of fault. This method can be adapted for any other (non march) memory test. It presents a way of, mathematically, modeling faults and describes how the verification process has been automated.>