Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving

Timo, Omer Nguena; Petrenko, Alexandre; Ramesh, S.

doi:10.1007/978-3-030-02508-3_19

Cited by 7 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work in [13,15] represents the fault domain for a DFSM specification with a NFSM. Each DFSM in the domain represents a version of the specification seeded with faults.…”

Section: Resultsmentioning

confidence: 99%

“…Each DFSM in the domain represents a version of the specification seeded with faults. The work addresses the problem of generating a test set [15] or a single test [13] for distinguishing a the specification from the other DFSMs. In this paper we address a different concern, which is selecting a yet unknown oracle (specification) from a set of candidate oracles.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Mining Precise Test Oracle Modelled by FSM

Timo¹

2022

Preprint

View full text Add to dashboard Cite

Precise test oracles for reactive systems such as critical control systems and communication protocols can be modelled with deterministic finite state machines (FSMs). Among other roles, they serve in evaluating the correctness of systems under test. A great number of candidate precise oracles (shortly, candidates) can be produced at the system design phase due to uncertainties, e.g., when interpreting their requirements expressed in ambiguous natural languages. Selecting the proper candidate becomes challenging for an expert. We propose a test-driven approach to assist experts in this selection task. The approach uses a non deterministic FSM to represent the candidates, includes the partitioning of the candidates into subsets of candidates via Boolean encodings and requires the intervention of experts to select subsets. We perform an empirical evaluation of the applicability of the proposed approach.

show abstract

“…The work in [13,15] represents the fault domain for a DFSM specification with a NFSM. Each DFSM in the domain represents a version of the specification seeded with faults.…”

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Mining Precise Test Oracle Modelled by FSM

Timo¹

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…, I k }⟩ ? We conjecture the following: noninitialized implementations can be hard to test as in the checking sequence a transfer to a known state of the implementation, is implicitly used or even explicitly included during its derivation (see some related works on the checking sequence derivation, for example in [1,2,5,6]). We therefore propose the following: before the application of the sequence α or its shorter preamble α ′ , one can apply a synchronizing sequence SS with further verification that the sequence SS.α ′ is P -probably checking for F M 1 .…”

Section: Minimizing a Checking Sequence With A Level Of P -Exhaustive...mentioning

confidence: 99%

Probabilistic Approach for Minimizing Checking Sequences for Non-deterministic FSMs

Kushik,

Yevtushenko,

López

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The paper is devoted to model based testing against probabilistic FSMs. Differently from our prior work in 2021, we consider checking sequences and possibilities of test suite minimization through reducing the length of the resulting checking sequence. Given a level of certainty P , we define a P -probably checking sequence under a white box testing assumption and discuss how a suffix of an input sequence can be omitted, such that the resulting sub-sequence is P -probably checking. The specification and possible implementations are non-initialized, i.e., the assumption of 'no reset' is supported.

show abstract

“…A mutation machine for a specication machine; s 1 is the initial stateThe set Mut(M) of all mutants in mutation machine M is called a fault domain for S. If M is deterministic and complete then M includes only the specication and Mut(M) is empty. A general fault model is the tuple S, , Mut(M) following[22,18]. The conformance relation partitions the set Mut(M) into conforming mutants and nonconforming ones which we need to detect.…”

mentioning

confidence: 99%

Multiple Mutation Testing for Timed Finite State Machine with Timed Guards and Timeouts

Timo

Prestat

Rollet

2019

Testing Software and Systems

Self Cite

View full text Add to dashboard Cite

The problem of generating tests detecting all logical and timing faults which can occur in real-time systems is challenging; this is because the number of (timing) faults is potentially too big or innite. As a result, it might be time consuming to generate an important number of adequate tests. The traditional model based testing approach considers a fault domain as the universe of all machines with a given number of states and input-output alphabet while mutation based approaches dene a list of mutants to kill with a test suite. In this paper, we combine the two approaches by developing a mutation testing technique for realtime systems represented with deterministic timed nite state machines with timed guards and timeouts(TFSM-TG). In this approach, fault domains consisting of fault-seeded versions of the specication (mutants) are represented with non-deterministic TFSM-TG. The test generation avoids the one-by-one enumeration of the mutants and is based on constraint solving. We present the results of an empirical proof-of-concept implementation of the proposed approach.

show abstract

Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving

Cited by 7 publications

References 26 publications

Mining Precise Test Oracle Modelled by FSM

Mining Precise Test Oracle Modelled by FSM

Probabilistic Approach for Minimizing Checking Sequences for Non-deterministic FSMs

Multiple Mutation Testing for Timed Finite State Machine with Timed Guards and Timeouts

Contact Info

Product

Resources

About