Showing papers by "Nicolae Goga published in 2003"

Founding FireWire bridges through Promela prototyping

Abstract: The standardisation procedure of the IEEE P1394.1 Draft Standard for High Performance Serial Bus Bridges is supported through the use of the state-of-the-art model checker Spin, which has been used to simulate the complex net update procedure of the standard, and the use of which will eventually be refined to obtain a solid model checking analysis of the standard. A concise description of net updates is formalised in terms of spanning trees, and it is shown how Spin was used to track down errors in the standard and to gather support for the solutions proposed.

A distributed spanning tree algorithm for topology-aware networks

Abstract: . A topology-aware network is a dynamic network in which the nodes can detect whether locally topology changes occur. Many modern networks, like IEEE 1394.1, are topology-aware networks. We present a distributed algorithm for computing and maintaining an arbitrary spanning tree in such a topology-aware network. Although usually minimal spanning trees are studied, in practice arbitrary spanning trees are often sufficient. Since our algorithm is not involved in the detection of topology changes, it performs better than the spanning tree algorithms in standards like IEEE 802.1. Because reasoning about distributed algorithms is rather tricky, we use a systematic approach to prove our algorithm.

An analysis of medical device communication standard IEEE 1073.2

Abstract: We analyze pre-standard ENV 13735 of the upcoming IEEE 1073.2 standard, which standardizes some communication protocols between dynamically interconnected medical devices. The latter standard is currently under development, which gives us an opportunity to influence its final contents using our results. The approach we use is to make formal models of the protocols, and to analyze them using the modelchecking tool Spin. Our analysis revealed several omissions, inconsistencies and other types of errors in the protocols and their descriptions. We discuss possible sources of these problems, and propose some fixes.

Implementing heuristic testing selection

Abstract: [1] elaborates an abstract theory for test selection. The link between the theory and the practice was not in the focus of that paper. The current paper fills this gap by presenting ways of implementing the abstract formulas of test selection. Several examples of useful distances are given. Key-Words: test selection, trace distances, public telephony systems, reactive systems, coverage

Experimenting with the probabilistic TorX

Abstract: In [4] we proposed a generalization of the TorX test derivation algorithm with probabilities. This paper extends the theoretical work from [4], by presenting experimental results obtained with the probabilistic TorX. The experiment with the Conference Protocol case study confirms that the extension of the algorithm with explicit probabilities leads to improvements in the tests generated with respect to the chances of finding errors in the implementation.