关键词: March算法, 故障原语, 测试原语

Abstract: As an efficient class of memory test algorithms, March algorithms have been extensively and thoroughly studied in academia, and have achieved excellent results. However, the current fault modeling methods centered on fault primitives cannot be directly applied to the analysis of March algorithms. A new test primitive is proposed as a bridge between the fault primitives and March algorithms in order to simplify the test algorithm analysis and generation. The test primitive describes the common features those March algorithms must have to detect corresponding faults, forming a highly flexible and extensible unit of analysis for March algorithms. According to fault primitives, corresponding test primitives are generated, which are proved to be characterized by completeness, uniqueness and conciseness through theoretical analysis.

Key words: March algorithm, fault primitive, test primitive