Offline formal verification of executable models
First Claim
Patent Images
1. A method for verifying an executable system against an assertion in a specification, the method comprising the steps of:
- generating a propositional formula representing an assertion in the specification using Boolean propositional symbols, each Boolean propositional symbol being associated with an atomic assertion in the assertion;
generating a set of traces representing a sequence of configurations of the system with respect to the assertion, wherein the traces include trace configuration data representing a configuration of the system in response to a particular trace;
converting the trace configuration data into truth assignments for a set of propositional symbols;
generating a trace of the system using the truth assignments for the propositional symbols; and
verifying the assertion using the trace of truth assignments for the propositional symbols and the propositional formula.
8 Assignments
0 Petitions
Accused Products
Abstract
A system and method for automatic formal verification of an executable system includes an assertion monitor configured to verify a system against an assertion in the specification. The assertion monitor includes a parser configured to generate a propositional formula representing an assertion in the specification using Boolean propositions, a filter configured to generate a trace of truth assignments for the propositional symbols and a trace verifier configured to verify the assertion using the trace of truth assignments for the propositional symbols and the propositional formula.
-
Citations
17 Claims
-
1. A method for verifying an executable system against an assertion in a specification, the method comprising the steps of:
-
generating a propositional formula representing an assertion in the specification using Boolean propositional symbols, each Boolean propositional symbol being associated with an atomic assertion in the assertion; generating a set of traces representing a sequence of configurations of the system with respect to the assertion, wherein the traces include trace configuration data representing a configuration of the system in response to a particular trace; converting the trace configuration data into truth assignments for a set of propositional symbols; generating a trace of the system using the truth assignments for the propositional symbols; and verifying the assertion using the trace of truth assignments for the propositional symbols and the propositional formula. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A computer-readable medium tangibly embodying computer-executable instructions for:
-
generating a propositional formula representing an assertion in the specification using Boolean propositional symbols, each Boolean propositional symbol associated with an atomic assertion in the assertion; generating a set of traces representing a sequence of configurations of the system with respect to the assertion, wherein the traces include trace configuration data representing a configuration of the system in response to a particular trace; converting the trace configuration data into truth assignments for a set of propositional symbols; generating a trace of the system using the truth assignments for the propositional symbols; and verifying the assertion using the trace of truth assignments for the propositional symbols and the propositional formula. - View Dependent Claims (8, 9, 10, 11)
-
-
12. An assertion monitor configured to verify an executable system against an assertion in a specification, the assertion monitor comprising:
-
a computer with a memory running an assertion monitor program that includes; a parser configured to generate a propositional formula representing an assertion in the specification using Boolean propositional symbols; a filter configured to generate a set of traces of truth assignments for the propositional symbols; a converter configured to convert the traces of the system to propositional symbols so that the propositional symbols hold data from the configuration data and from the traces of the system; and a trace verifier configured to verify the assertion using the trace of truth assignments for the propositional symbols and the propositional formula. - View Dependent Claims (13, 14, 15, 16, 17)
-
Specification