Completeness Analysis
ConceptCompleteness analysis is a formal-verification technique for determining whether a property suite covers every possible input scenario of a design and uniquely predicts states and outputs over time. In the cited processor-verification context, a complete property suite can serve as a model of the verified design, enabling uses such as generating an executable simulator.
WIKI
Definition
Completeness analysis determines whether every possible input scenario of a design—described as a transaction sequence—can be covered by a chain of properties that predicts the values of states and outputs at every point in time. A property suite that passes this analysis is considered complete in the sense that any two designs satisfying all properties in the suite are formally equivalent. [C1]
Core checks
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →