1997
DOI: 10.1147/rd.414.0567
|View full text |Cite
|
Sign up to set email alerts
|

Formal verification made easy

Abstract: Formal verification (FV) is considered by manyto be complicated and to require considerable mathematical knowledge for successful application. We have developed a methodology in which we have added formal verification to the verification process without requiring any knowledge of formal verification languages. We use only finite-state machine notation, which is familiar and intuitive to designers. Another problem associated with formal verification is state-space explosion. If that occurs, no result is returne… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2000
2000
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…The linear framework is simply more natural for verification engineers, who tend to think linearly, e.g., timing diagrams [37] and message-sequence charts [64], rather than "branchingly". IBM's experience with the RuleBase system has been that "nontrivial CTL equations are hard to understand and prone to error" [90] and "CTL is difficult to use for most users and requires a new way of thinking about hardware" [7]. Indeed, IBM has been trying to "linearize" CTL in their RuleBase system [7].…”
Section: Expressivenessmentioning
confidence: 99%
“…The linear framework is simply more natural for verification engineers, who tend to think linearly, e.g., timing diagrams [37] and message-sequence charts [64], rather than "branchingly". IBM's experience with the RuleBase system has been that "nontrivial CTL equations are hard to understand and prone to error" [90] and "CTL is difficult to use for most users and requires a new way of thinking about hardware" [7]. Indeed, IBM has been trying to "linearize" CTL in their RuleBase system [7].…”
Section: Expressivenessmentioning
confidence: 99%
“…Model checking is a widely accepted technique for the design phases that deal with circuits at the register transfer level and the gate level. Industrial experiments have provided evidence that model checking is no worse than random simulation in terms of time spent and that it is clearly superior in terms of coverage [25].…”
Section: History and Perspectivementioning
confidence: 99%
“…Many RuleBase innovations involve methods that address the model size problem of BDD-based model checking. As a result, RuleBase was successfully applied to designs [27] like bus bridges, cache controllers, bus interface units, and functional units of microprocessors, and pushed this new technology into the mainstream verification process.…”
Section: ) Test Program Generationmentioning
confidence: 99%