#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1979

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hans van der Schoot, Hasan Ural
- International Journal of Software Engineering and…
- 1997

In LOTOS, a system is specified as a behaviour expression describing the externally observable behaviour of the system in terms of possible sequences of interactions between the system and its environment. The desired control flow and data flow that must be established by a possible implementation of the system are specified in the behaviour expression as… (More)

State explosion is well-known to be the principle limitation in protocol verification. In this paper, we propose a verification technique called leaping reachability analysis (LRA) to tackle state explosion. We advocate LRA as a uniform and property-driven relief strategy for verifying general progress properties of protocols modeled as networks of… (More)

- Hans van der Schoot, Hasan Ural
- Computer Networks and ISDN Systems
- 1995

A data flow oriented test selection method for selectively generating abstract tests from a LOTOS specification is presented. This method is based on static data flow analysis to identify maximal IO-df-chains, which exhibit the associations between each specification output and those specification inputs that influence the output through definitions and… (More)

- Hans van der Schoot, Hasan Ural
- Softw. Test., Verif. Reliab.
- 1998

- Hans van der Schoot, Hasan Ural
- ICDCS
- 1998

In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL… (More)

- Hong Liu, Raymond E. Miller, Hans van der Schoot, Hasan Ural
- ICDCS
- 1996

In this paper, we generalize the technique of fair reachability analysis to multi-cyclic protocols modeled as networks of communicating nite state machines, where a number of cyclic protocols are interconnected in such a way that any two component cyclic protocols share at most one process and each channel in the protocol belongs to exactly one component… (More)

Partial-order reduction methods form a collection of state exploration techniques set to relieve the stateexplosion problem in concurrent program verification. One such method is implemented in the verification tool SPIN. Its use often reduces significantly the memory and time needed for verifying local and termination properties of concurrent programs and,… (More)

- Hans van der Schoot, Hasan Ural
- PODC
- 1995

Fair rwchability analysis is generalized to multi-cyclic protocols defined in the CFSM model as networks of n >2 processes with a multiple unidirectional ring topology and with arbitrary process structures. As a restdt, the deadlock detection problem is shown to be decidable for multi-cyclic protocols whose fair reachable global state space kfinite. A… (More)

A relief strategy called fair reachability analysis [5, 7, 11] is extended for the verification of daisy-chain protocols, which are defined in the communicating finite state machine model as networks of n ≥ 2 processes with a bidirectional, serial link structure. Fair reachability analysis is shown to decide the deadlock detection problem for daisy-chain… (More)