UTILIZING AN UNSAT PROOF FOR MODEL CHECKING
First Claim
Patent Images
1. A computerized system comprising:
- a processor;
an interface for receiving a proof of a conclusion associated with a CNF formula;
the CNF formula representing a model and a specification property in a predetermined number of cycles;
the proof comprising an initial axiom clause, a transition axiom clause and a deduction clause; and
an invariant extractor module for identifying an invariant in the proof;
the invariant is a portion of the proof;
said invariant extractor module utilizes said processor for identifying the invariant.
6 Assignments
0 Petitions
Accused Products
Abstract
A proof of unsatisfiability associated with a bounded model may be extended to apply to another bounded model having a larger bound. In some exemplary embodiments, an unbounded model may be proved using one or more such extensions. A proof may be reordered in order to decrease its size and increase the productivity of systems that utilize it. The proof may be reorder by a natural temporal order of cycles.
15 Citations
22 Claims
-
1. A computerized system comprising:
-
a processor; an interface for receiving a proof of a conclusion associated with a CNF formula; the CNF formula representing a model and a specification property in a predetermined number of cycles;
the proof comprising an initial axiom clause, a transition axiom clause and a deduction clause; andan invariant extractor module for identifying an invariant in the proof;
the invariant is a portion of the proof;
said invariant extractor module utilizes said processor for identifying the invariant. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method comprising:
-
obtaining a proof of a conclusion associated with a CNF formula;
the CNF formula representing a model and a specification property in a first predetermined number of cycles;
the proof comprising an initial axiom clause, a transition axiom clause and a deduction clause;identifying an invariant in the proof;
said identifying an invariant in the proof is performed by a processor; anddetermining the specification property holds for the model in a second predetermined number of cycles based on the invariant; whereby the proof of the conclusion associated with the CNF formula is transformed to provide a proof of the conclusion associated with an extended CNF formula representing the model and the specification property in the second predetermined number of cycles. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. A computer program product comprising:
-
a computer readable medium; first program instruction for obtaining a proof of a conclusion associated with a CNF formula;
the CNF formula representing a model and a specification property in a first predetermined number of cycles;
the proof comprising an initial axiom clause, a transition axiom clause and a deduction clause;second program instruction for identifying an invariant in the proof;
said identifying an invariant in the proof is performed by a processor; andthird program instruction for determining the specification property holds for the model in a second predetermined number of cycles based on the invariant wherein said first, second, and third program instructions are stored on said computer readable media.
-
Specification