Model-based testing from input output symbolic transition systems enriched by program calls and contracts

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An Input Output Symbolic Transition System (IOSTS) specifies all expected sequences of input and output messages of a reactive system. Symbolic execution over this IOSTS then allows to generate a set of test cases that can exercise the various possible behaviors of the system it represents. In this paper, we extend the IOSTS framework with explicit program calls, possibly equipped with contracts specifying what the program is supposed to do. This approach bridges the gap between a model-based approach in which user-defined programs are abstracted away and a code-based approach in which small pieces of code are separately considered regardless of the way they are combined. First, we extend symbolic execution techniques for IOSTS with programs, in order to re-use classical test case generation algorithms. Second, we explore how constraints coming from IOSTS symbolic execution can be used to infer contracts for programs used in the IOSTS.

Cite

CITATION STYLE

APA

Boudhiba, I., Gaston, C., Gall, P. L., & Prevosto, V. (2015). Model-based testing from input output symbolic transition systems enriched by program calls and contracts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9447, pp. 35–51). Springer Verlag. https://doi.org/10.1007/978-3-319-25945-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free