Volltext-Downloads (blau) und Frontdoor-Views (grau)
  • search hit 1 of 1
Back to Result List

Formal verification made easy

  • Formal verification (FV) is considered by many to 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 toFormal verification (FV) is considered by many to 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 returned; our method switches to random simulation after one hour without results, and no effort is lost. We have compared FV against random simulation with respect to development time, and our results indicate that FV is at least as fast as random simulation. FV is superior in terms of verification quality, however, because it is exhaustive.show moreshow less

Export metadata

Additional Services

Search Google Scholar

Statistics

frontdoor_oas
Metadaten
Document Type:Article (reviewed)
Zitierlink: https://opus.hs-offenburg.de/3461
Bibliografische Angaben
Title (English):Formal verification made easy
Author:Thomas Schlipf, Thomas Buechner, Rolf Fritz, Markus Helms, Jürgen Koehl
Year of Publication:1997
Publisher:IBM
First Page:567
Last Page:576
Parent Title (English):IBM Journal of Research and Development
Volume:41
Issue:4/5
ISSN:0018-8646
DOI:https://doi.org/10.1147/rd.414.0567
URL:https://www.researchgate.net/publication/224103324
Language:English
Inhaltliche Informationen
Institutes:Fakultät Elektrotechnik und Informationstechnik (E+I) (bis 03/2019)
Institutes:Bibliografie
GND Keyword:Nachweis; Verfahren
Formale Angaben
Open Access: Open Access 
Licence (German):License LogoUrheberrechtlich geschützt