The sweep-line state space method allows states to be deleted from memory during state exploration, thus alleviating state explosion. Properties of the system (such as the absence of deadlocks) can then be verified on-the-fly. This paper presents an extension to the sweepline method that allows on-the-fly checking of language inclusion, which is useful for protocol verification. This has been implemented in a prototype Sweep-line library for Design/CPN. We evaluate the prototype by applying it to the connection management procedures of the Datagram Congestion Control Protocol, a new Internet transport protocol
Growth of the computability power in the last years enabled practical use of model checking of softw...
A typical problem formal verification faces is the size of the model of a system being verified. Eve...
The most common use of formal verification methods so far has been in identifying whether livelock a...
Abstract. State space explosion is a key problem in the analysis of finite state systems. The sweep-...
AbstractThe sweep-line method exploits intrinsic progress in concurrent systems to alleviate the sta...
Explicit-state model checking is a formal software verification technique that differs from peer rev...
Model checking is a powerful approach to verification of distributed systems. The sweep-line method ...
Rapid developments in networking technologies is resulting in an increasing number of new communicat...
The sweep-line method is a state space reduction technique formemory-efficient on-the-fly verificati...
In this thesis, a new Petri net based model called CSP nets is proposed to specify the control state...
Abstract. The state space explosion problem is the most burning problem of formal verification metho...
It is important to reason about a number of desirable protocol properties to ensure correctness of a...
The Wireless Transaction Protocol (WTP) is part of the Wireless Application Protocol (WAP) architect...
The verification of network protocols is a challenging problem. Traditional model checking requires ...
This paper is concerned with a memory-efficient representation of reachability graphs. We describe a...
Growth of the computability power in the last years enabled practical use of model checking of softw...
A typical problem formal verification faces is the size of the model of a system being verified. Eve...
The most common use of formal verification methods so far has been in identifying whether livelock a...
Abstract. State space explosion is a key problem in the analysis of finite state systems. The sweep-...
AbstractThe sweep-line method exploits intrinsic progress in concurrent systems to alleviate the sta...
Explicit-state model checking is a formal software verification technique that differs from peer rev...
Model checking is a powerful approach to verification of distributed systems. The sweep-line method ...
Rapid developments in networking technologies is resulting in an increasing number of new communicat...
The sweep-line method is a state space reduction technique formemory-efficient on-the-fly verificati...
In this thesis, a new Petri net based model called CSP nets is proposed to specify the control state...
Abstract. The state space explosion problem is the most burning problem of formal verification metho...
It is important to reason about a number of desirable protocol properties to ensure correctness of a...
The Wireless Transaction Protocol (WTP) is part of the Wireless Application Protocol (WAP) architect...
The verification of network protocols is a challenging problem. Traditional model checking requires ...
This paper is concerned with a memory-efficient representation of reachability graphs. We describe a...
Growth of the computability power in the last years enabled practical use of model checking of softw...
A typical problem formal verification faces is the size of the model of a system being verified. Eve...
The most common use of formal verification methods so far has been in identifying whether livelock a...