The FITTEST Tool Suite for Testing Future Internet Applications

Vos, Tanja E. J.; Tonella, Paolo; Prasetya, I. S. W. B.; Kruse, Peter; Shehory, Onn; Bagnato, Alessandra; Harman, Mark

doi:10.1007/978-3-319-07785-7_1

Cited by 3 publications

(1 citation statement)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fortunately, there are ways to at least mitigate the problem, e.g. by using a theorem prover like Z3 [12] to solve the constraint, or, as in [16,39], by employing a search algorithm [24].…”

Section: Related Workmentioning

confidence: 99%

Modeling and Testing Implementations of Protocols with Complex Messages

Tervoort,

Prasetya

2018

Preprint

View full text Add to dashboard Cite

This paper presents a new language called APSL for formally describing protocols to facilitate automated testing. Many real world communication protocols exchange messages whose structures are not trivial, e.g. they may consist of multiple and nested fields, some could be optional, and some may have values that depend on other fields. To properly test implementations of such a protocol, it is not sufficient to only explore different orders of sending and receiving messages. We also need to investigate if the implementation indeed produces correctly formatted messages, and if it responds correctly when it receives different variations of every message type. APSL's main contribution is its sublanguage that is expressive enough to describe complex message formats, both text-based and binary. As an example, this paper also presents a case study where APSL is used to model and test a subset of Courier IMAP email server.

show abstract

“…Fortunately, there are ways to at least mitigate the problem, e.g. by using a theorem prover like Z3 [12] to solve the constraint, or, as in [16,39], by employing a search algorithm [24].…”

Section: Related Workmentioning

confidence: 99%