The foundation of hardware verification is that an implementation satisfies its specification. The specification described by a natural language may be ambiguous and inconsistence. The Acclellera Property Specification Language (PSL) is developed for the formal specification of hardware. It provides a standard means of specifying design properties using a concise syntax with clearly-defined formal semantics, particularly it offers an input method for dynamic (simulation) and static (formal verification method, such as model checking) verification tools. This paper proposes how to use model checking to verify a property with "X" value, and gives a model checking algorithm based on 3-valued (true, false, X) logic formula of PSL. This algorithm has the same time complexity as 2-valued logic model checking. Finally, we present how to separate CTL formula from a PSL verification unit, and verify these properties from PSL under the given model.
[1]
Tiziano Villa,et al.
VIS: A System for Verification and Synthesis
,
1996,
CAV.
[2]
Radha Jagadeesan,et al.
Model checking partial state spaces with 3-valued temporal logics
,
2001
.
[3]
Radha Jagadeesan,et al.
On the Expressiveness of 3-Valued Models
,
2002,
VMCAI.
[4]
S. C. Kleene,et al.
Introduction to Metamathematics
,
1952
.
[5]
Edmund M. Clarke,et al.
Model Checking
,
1999,
Handbook of Automated Reasoning.
[6]
Edmund M. Clarke.
Automatic Verification of Finite-state Concurrent Systems
,
1994,
Application and Theory of Petri Nets.
[7]
Marco Pistore,et al.
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
,
2002,
CAV.
[8]
Radha Jagadeesan,et al.
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
,
2001,
ESOP.