Results 1 - 10 of 5,454

Table 5. Statistics from different stages of the translation to a propositional formula for the experiments on modeling the Data Memory with a regular memory and a translation box.

in Superscalar Processor verification using efficient reductions of the logic of equality with uninterpreted functions to propositional logic
by Miroslav N. Velev, Randal E. Bryant 1999
Cited by 73

Table 5. Statistics from different stages of the translation to a propositional formula for the experiments on modeling the Data Memory with a regular memory and a translation box.

in Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
by Al Log Ic

Table 5. Statistics from different stages of the translation to a propositional formula for the experiments on modeling the Data Memory with a regular memory and a translation box.

in Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
by Miroslav N. Velev, Randal E. Bryant

TABLE II Propositional rules for signed #0B-formulae, #0C-formulae, and literals #28p is an atomic formula#29.

in Deduction by Combining Semantic Tableaux and Integer Programming
by Bernhard Beckert, Reiner Hähnle

Table 2. Variable statistics during the translation of the EUFM DAG to a propositional formula. The final p-function domain variable set Vp and the final g-function domain variable set Vg were obtained after eliminating the reads and the UFs from the EUFM DAG.

in Superscalar Processor verification using efficient reductions of the logic of equality with uninterpreted functions to propositional logic
by Miroslav N. Velev, Randal E. Bryant 1999
Cited by 73

Table 2. Variable statistics during the translation of the EUFM DAG to a propositional formula. The final p-function domain variable set Vp and the final g-function domain variable set Vg were obtained after eliminating the reads and the UFs from the EUFM DAG.

in Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
by Al Log Ic

Table 2. Variable statistics during the translation of the EUFM DAG to a propositional formula. The final p-function domain variable set Vp and the final g-function domain variable set Vg were obtained after eliminating the reads and the UFs from the EUFM DAG.

in Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
by Miroslav N. Velev, Randal E. Bryant

Table 2: Complexity results for propositional DDBs (with integrity clauses) Semantics Inference of literal Inference of formula 9 model

in Complexity Aspects of Various Semantics for Disjunctive Databases
by Thomas Eiter, Georg Gottlob 1993
Cited by 31

Table 1. Statistics for the number of domain variables and the resources needed for the BDD evaluation of the final propositional formula. The memory and CPU time are reported for the sequence of symbolic simulation, translation of the EUFM formula to a propositional one, and the evaluation of the latter by BDDs. Vp designates the set of p-term domain variables, while Vg the set of g-term domain variables. Src Regs stands for source registers, while Dest Regs for destination registers. The category Other of the final Vg consists of the predicted and actual targets of branch and jump instructions.

in Formal Verification of Superscalar Microprocessors with Multicycle Functional Units, Exceptions, and Branch Prediction
by Miroslav N. Velev, Randal E. Bryant 2000
"... In PAGE 5: ... All processors were modeled in the style described in [21]. The results are presented in Table1 . The experiments were performed on a 336 MHz Sun4 with 1.... In PAGE 6: ... Second, these designs require more Boolean variables as either part of the initial state of their pipeline latches or as outputs of the UPs, indicating that a certain type of exception has been raised for a particular instruc- tion in flight. Indeed, if we compare the category of Other BDD Variables in Table1 for the -EX models vs. their correspond- ing base model, and for the -MC-EX models vs.... ..."
Cited by 44

Table 1. Statistics for the number of domain variables and the resources needed for the BDD evaluation of the final propositional formula. The memory and CPU time are reported for the sequence of symbolic simulation, translation of the EUFM formula to a propositional one, and the evaluation of the latter by BDDs. Vp designates the set of p-term domain variables, while Vg the set of g-term domain variables. Src Regs stands for source registers, while Dest Regs for destination registers. The category Other of the final Vg consists of the predicted and actual targets of branch and jump instructions.

in Formal Verification of Superscalar Microprocessors with Multicycle Functional Units, Exceptions, and Branch Prediction
by Miroslav N. Velev, Randal E. Bryant 2000
"... In PAGE 5: ... All processors were modeled in the style described in [21]. The results are presented in Table1 . The experiments were performed on a 336 MHz Sun4 with 1.... In PAGE 6: ... Second, these designs require more Boolean variables as either part of the initial state of their pipeline latches or as outputs of the UPs, indicating that a certain type of exception has been raised for a particular instruc- tion in flight. Indeed, if we compare the category of Other BDD Variables in Table1 for the -EX models vs. their correspond- ing base model, and for the -MC-EX models vs.... ..."
Cited by 44
Results 1 - 10 of 5,454