Symbolized model detection method

Abstract

This symbol model detection method is a method to make the model testing practical; the main principle is to use Boolean formula quantitative determination to instead of the CTL model testing. Their method: 1.) extract state machine M of the tested system and the attributes of the tested tree temporal logic description; 2.) taking border k as the form parameters, describe k sector semantics of the attributes f; 3.) taking border k as the form parameters, convert the k sector semantic of attribute f to quantify Boolean formula [M, f] k: 4.) progressive determine whether the system M meets the reliable attribute f: the approach integrates the advantages of symbol model testing based on binary decision diagram and bounded model checking based proposition equitation meeting judgment, also overcomes their shortcomings, which are not dependent on the sort of Boolean variables, or dependent on the property to verify the full name attribute.

Description

technical field

[0001] The invention is a solution for symbolization technology applied to hardware reliability verification, which is mainly used to solve the reliability problem of large-scale integrated circuits, and belongs to the cross-technical field of integrated circuits and reliable systems. Background technique

[0002] With the increasing complexity of computer software and hardware systems, how to ensure their correctness and reliability has become an increasingly urgent problem. For concurrent systems, this problem is even more difficult due to their inherent non-determinism. In the past few decades, researchers from various countries have made great efforts to solve this problem and made important progress. Among the many theories and methods proposed for this purpose, model checking stands out for its simplicity and high degree of automation.

[0003] The research on model checking began in the early 1980s, when Clarke, Emerson and others proposed the comput...

Images