Logo des Repositoriums
 

Enhancing BMC-based protocol verification using transition-by-transition FSM traversal

dc.contributor.authorNguyen, Minh D.
dc.contributor.authorStoffel, Dominik
dc.contributor.authorKunz, Wolfgang
dc.contributor.editorCremers, Armin B.
dc.contributor.editorManthey, Rainer
dc.contributor.editorMartini, Peter
dc.contributor.editorSteinhage, Volker
dc.date.accessioned2019-10-11T07:41:17Z
dc.date.available2019-10-11T07:41:17Z
dc.date.issued2005
dc.description.abstractWe present a technique to automatically derive reachability information from designs to enhance Bounded Model Checking style verification. The method is well suited for typical protocol applications where the operation is controlled by a main finite state machine (FSM) interacting with a hierarchy of sub-FSMs. The algorithm traverses the global state space of the design based on single transitions of the main finite state machine. This transition-by-transition decomposition of the state space distinguishes our approach from previous ones. The experimental results clearly show the value of the new method. In our experiments, false negatives could be completely avoided and the overall verification effort was drastically reduced.en
dc.identifier.isbn3-88579-396-2
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/28047
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofInformatk 2005. Informatik Live! Band 1
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-67
dc.titleEnhancing BMC-based protocol verification using transition-by-transition FSM traversalen
dc.typeText/Conference Paper
gi.citation.endPage305
gi.citation.publisherPlaceBonn
gi.citation.startPage303
gi.conference.date19.-22. September 2005
gi.conference.locationBonn
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
GI-Proceedings.67-68.pdf
Größe:
190.26 KB
Format:
Adobe Portable Document Format