Deriving conformance tests for telecommunication protocols using &amp;#x03BC;Java tool

Ermakov, Anton D.

doi:10.1109/edm.2014.6882499

Cited by 1 publication

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distinguishing sequences for two FSMs are constructed based on the product of these machines [11]; for EFSMs it is a bit more complex, since appropriate FSM abstractions are derived first [16,17,18]. Such abstractions can be derived in various ways, for example, we can simply delete all predicates, context variables, input and output parameters and updating functions.…”

Section: Preliminariesmentioning

confidence: 99%

“…We performed experiments with EFSMs which are used for describing protocols Simple Connection Protocol, Time, SMTP, POP3, TFTP, Audio CD player [11]. Almost in all cases, save for the simplest protocols, a transition tour needed to be augmented with distinguishing sequences obtained after using the µJava tool.…”

Section: Analyzing Performed Experiments For Simple Connection Protocolmentioning

confidence: 99%

“…If a mutant is not detected by the initial test suite then a corresponding fault is easily mapped into an EFSM fault and a distinguishing sequence is derived not for two software programs that is known to be a very complex task [5] but for two finite state models that is known to be much simpler [9,10]. First results have been published in [11]; in this paper, we extend a proposed approach to arbitrary EFSMs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Increasing the Fault Coverage of Tests Derived Against Extended Finite State Machines

Yevtushenko¹,

Ermakov²

2016

View full text Add to dashboard Cite

Abstract. Extended Finite State Machines (EFSMs) are widely used when deriving tests for checking whether a software implementation meets functional requirements. These tests usually are derived keeping in mind appropriate test purposes such as covering paths, variables, etc. of the specification EFSM. However, it is well known that such tests do not detect many functional faults in an EFSM implementation. In this paper, we propose an approach for increasing the fault coverage of test suites initially derived against the specification EFSM. For this reason, the behavior of the specification EFSM is implemented in Java using a template that is very close to the EFSM description. At the next step, the fault coverage of an initial test suite derived against the specification EFSM is calculated with respect to faults generated by µJava tool. Since the EFSM software implementation is template based, each undetected fault can be easily mapped into a mutant EFSM of the specification machine. Thus, a distinguishing sequence can be derived not for two programs that is very complex but for two machines and there are efficient methods for deriving such a distinguishing sequence for Finite State Machine (FSM) abstractions of EFSMs. As an FSM abstraction, an l-equivalent of an EFSM can be considered that in fact, is a subtree of the successor tree of height l that describes the EFSM behavior under input sequences of length up to l. Such l-equivalents are classical FSMs and if l is not large then a distinguishing sequence can be derived simply enough. The initial test suite augmented with such distinguishing sequences detects much more functional faults in software implementations of a system described by the specification EFSM.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Section: Analyzing Performed Experiments For Simple Connection Protocolmentioning

confidence: 99%