Generation Of A Complete Set Of Properties

04/13/2020
by   Eugene Goldberg, et al.
0

One of the problems of formal verification is that it is not functionally complete. The fact that a set of properties of a specification holds for a design implementation, in general, does not mean that this implementation is bug-free. In testing, this issue is addressed by replacing functional completeness with structural one. The latter is achieved by generating a set of tests probing every piece of a design implementation. We show that a similar approach can be used in formal verification. The idea here is to generate a property of the implementation at hand that is not implied by specification properties. Finding such a property means that the specification is not complete. If this is an unwanted property, then the implementation is buggy. Otherwise, a new specification property needs to be added. Generation of implementation properties related to different parts of the design followed by adding new specification properties produces a structurally-complete specification. Implementation properties are built by partial quantifier elimination, a technique where only a part of the formula is taken out of the scope of quantifiers. An implementation property is generated by applying partial quantifier elimination to a formula defining the "truth table" of the implementation. We show how our approach works on specifications of combinational and sequential circuits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2020

On Verifying Designs With Incomplete Specification

Incompleteness of a specification 𝑆𝑝𝑒𝑐 creates two problems. First, an i...
research
03/24/2023

Partial Quantifier Elimination And Property Generation

We study partial quantifier elimination (PQE) for propositional CNF form...
research
03/13/2020

On Sufficient and Necessary Conditions in Bounded CTL

Computation Tree Logic (CTL) is one of the central formalisms in formal ...
research
06/09/2020

A Theoretical Framework for Symbolic Quick Error Detection

Symbolic quick error detection (SQED) is a formal pre-silicon verificati...
research
06/12/2019

Sionnx: Automatic Unit Test Generator for ONNX Conformance

Open Neural Network Exchange (ONNX) is an open format to represent AI mo...
research
06/14/2022

Specification sketching for Linear Temporal Logic

Virtually all verification and synthesis techniques assume that the form...
research
12/12/2017

Consistency of Property Specification Patterns with Boolean and Constrained Numerical Signals

Property Specification Patterns (PSPs) have been proposed to solve recur...

Please sign up or login with your details

Forgot password? Click here to reset