Model inference of Mobile Applications with dynamic state abstraction - Archive ouverte HAL Access content directly
Book Sections Year : 2016

Model inference of Mobile Applications with dynamic state abstraction

(1) , (2) ,
1
2

Abstract

We propose an automatic testing method of mobile applications, which also learns formal models expressing navigational paths and application states. We focus on the quality of the models to later perform analysis (verification or test case generation). In this context, our algorithm infers formal and exact models that capture the events applied while testing, the content of the observed screens and the application environment changes. A key feature of the algorithm is that it avoids the state space explosion problem by dynamically constructing state equivalence classes to slice the state space domain of an application in a finite manner and to explore these equivalence classes. We implemented this algorithm on the tool MCrawlT that was used for experimentations. The results show that MCrawlT achieves significantly better code coverage than several available tools in a given time budget.
Fichier principal
Vignette du fichier
sera.pdf (425.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02019290 , version 1 (14-02-2019)

Identifiers

  • HAL Id : hal-02019290 , version 1

Cite

Sébastien Salva, Patrice Laurencot, Stassia R Zafimiharisoa. Model inference of Mobile Applications with dynamic state abstraction. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015, 612, 2016, Studies in Computational Intelligence (SCI). ⟨hal-02019290⟩
44 View
153 Download

Share

Gmail Facebook Twitter LinkedIn More