Constraint-Based Testing

Gotlieb, Arnaud

doi:10.1016/bs.adcom.2015.05.002

Cited by 5 publications

References 83 publications

(113 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

RESTest: Black-Box Constraint-Based Testing of RESTful Web APIs

Martin-Lopez

Segura

Ruiz–Cortés

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Automated testing approaches for RESTful web APIs typically follow a black-box strategy, where test cases are derived from the API specification. These techniques show promising results, but they neglect constraints among input parameters (so-called inter-parameter dependencies), as these cannot be formally described in current API specification languages. As a result, black-box tools rely on brute force to generate valid test cases, i.e., those satisfying all the input constraints. This is not only extremely inefficient, but it is also unlikely to work for most real-world services, where inter-parameter dependencies are complex and pervasive. In this paper, we present RESTest, a framework for automated black-box testing of RESTful APIs. Among its key features, RESTest supports the specification and automated analysis of interparameter dependencies, enabling the use of constraint solvers for the automated generation of valid test cases. This allows to detect more faults, and faster, through a deeper evaluation of valid and invalid input parameters' combinations and the use of novel test oracles. Evaluation results on 6 commercial APIs show that RESTest can efficiently generate up to 99% more valid test cases than random testing techniques, 60% on average. More importantly, RESTest revealed 2K failures undetected by random testing, uncovering bugs in all the services under test.

show abstract

RESTest: Black-Box Constraint-Based Testing of RESTful Web APIs

Martin-Lopez

Segura

Ruiz–Cortés

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Constraint-Based Oracles for Timed Distributed Systems

Benharrat

Gaston

Hierons

et al. 2017

Testing Software and Systems

View full text Add to dashboard Cite

Part 5: Testing Timed and Distributed SystemsInternational audienceThis paper studies the situation in which the system under test and the system model are distributed and have the same structure; they have corresponding remote components that communicate asynchronously. In testing, a component with interface $$C_i$$ has its own local tester that interacts with $$C_i$$ and this local tester observes a local trace consisting of inputs, outputs and durations as perceived by $$C_i$$. An observation made in testing is thus a multi-trace: a tuple of (timed) local traces, one for each $$C_i$$. The conformance relation for such distributed systems combines a classical unitary conformance relation for localised components and the requirement that the communication policy was satisfied. By expressing the communication policy as a constraint satisfaction problem, we were able to implement the computation of test verdicts by orchestrating localised off-line testing algorithms and the verification of constraints defined by message passing between components. Lastly, we illustrate our approach on a telecommunications system

show abstract