Proceedings of the 33rd Annual Conference on Design Automation Conference - DAC '96 1996
DOI: 10.1145/240518.240640
|View full text |Cite
|
Sign up to set email alerts
|

Word level model checking---avoiding the Pentium FDIV error

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1996
1996
2003
2003

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Other encoding policies can be more appropriate for variables of different kind. For example, word level encodings are useful for the analysis of data paths [25]. Moreover, the constraint of grouping the boolean variables together can be relaxed.…”
Section: çèémentioning
confidence: 99%
See 1 more Smart Citation
“…Other encoding policies can be more appropriate for variables of different kind. For example, word level encodings are useful for the analysis of data paths [25]. Moreover, the constraint of grouping the boolean variables together can be relaxed.…”
Section: çèémentioning
confidence: 99%
“…Having this module as a separate one makes it possible to have different encoding policies that can be more appropriate for different kinds of variables. Currently only the standard CMU SMV encoding is possible, but there are plans to integrate into this architecture other forms of encoding, e.g., those used in Word-Level SMV [25].…”
Section: System Architecturementioning
confidence: 99%
“…It is tempting to adapt BDDs to handle multiplication. Word-level model checking is one such technique [21]. There, control is represented using BDDs and operations on integers are represented using binary moment diagrams [13], which can concisely represent the product of two integers.…”
Section: Nonlinear Arithmeticmentioning
confidence: 99%
“…There, control is represented using BDDs and operations on integers are represented using binary moment diagrams [13], which can concisely represent the product of two integers. The algorithm in Clarke et al [21] allows multiplication in the temporal logic formula, but not multiplicative predicates in the guarding conditions. It is unclear how this method can be adapted to solve our problem.…”
Section: Nonlinear Arithmeticmentioning
confidence: 99%
“…For instance, the floating point multiplier was divided into the circuits for the mantissa multiplication, the exponent addition, and the rounding in [6]. The verification of these three subcircuits was performed automatically by word-level SMV [8], but the correctness of the entire multiplier must be proved by users from the verified specifications of these three sub-circuits. To avoid partitioning floating point arithmetic circuits for verification, it is necessary to have decision diagrams that represent and manipulate floating point functions efficiently.…”
Section: Introductionmentioning
confidence: 99%