Proceedings of the ACM Workshop on Frontiers in Computer Communications Technology 1987
DOI: 10.1145/55482.55496
|View full text |Cite
|
Sign up to set email alerts
|

Protocol verification using reachability analysis: the state space explosion problem and relief strategies

Abstract: Reachabilityanalysis has proved to be one of the

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
1

Year Published

1990
1990
2014
2014

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 49 publications
(15 citation statements)
references
References 10 publications
0
14
1
Order By: Relevance
“…With it, we were also able to verify flooding based protocols, which, in general, become a problem for other techniques because the state space explosion [16]. The topology abstraction, channel and information modeling showed to be an effective and reliable form to build verification models for routing algorithms.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…With it, we were also able to verify flooding based protocols, which, in general, become a problem for other techniques because the state space explosion [16]. The topology abstraction, channel and information modeling showed to be an effective and reliable form to build verification models for routing algorithms.…”
Section: Discussionmentioning
confidence: 99%
“…Second, it presents a way to make the verification topology independent, avoiding a proof based on a particular scenario. Third, the method presents a way to safely model flooding based protocols, avoiding the combinatorial state space explosion problem [16]. Fourth, to decrease the protocol verification complexity, the method proposes divide the verification into internal and external protocol behavior.…”
Section: Introductionmentioning
confidence: 99%
“…Early approaches to directed model checking 17,24] propose the use of bestrst search algorithms in order to accelerate the search for error states. Further approaches 8,7,6,4] propose the full spectrum of classical heuristic search strategies for the veri cation process in order to accelerate error detection and to provide optimal or near-to-optimal trails.…”
Section: Directed Model Checkingmentioning
confidence: 99%
“…We will establish a hierarchy of relaxation of the cycle condition for partial order reduction known as C3, and we will classify the relaxations with respect to their applicability to di erent classes of heuristic search algorithms. To the best of our knowledge, at the time of writing no publication addressing heuristic search in model checking 7,8,6,12,4,17,24] has analyzed how t o c o m bine guided search with partial order reduction.…”
Section: Introductionmentioning
confidence: 99%
“…Compared with the development of state space reduction techniques that preserve a given equivalence, design for verifiability is a rather novel concept because the validity of the reduction is in the hand of the designer. The best we could find is , but it primarily addresses improvements in verification technology, too. A recent plea similar to ours is , where it is argued that systems must be programmed such that analysis of those systems becomes much simpler.…”
Section: Introductionmentioning
confidence: 99%