๐ฎ
๐ฎ
The Ethereal
Automated Requirements-Based Testing of Black-Box Reactive Systems
May 14, 2020 ยท The Ethereal ยท ๐ NASA Formal Methods
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Massimo Narizzano, Luca Pulina, Armando Tacchella, Simone Vuotto
arXiv ID
2005.06750
Category
cs.LO: Logic in CS
Cross-listed
cs.SE
Citations
5
Venue
NASA Formal Methods
Last Checked
5 months ago
Abstract
We present a new approach to conformance testing of black-box reactive systems. We consider system specifications written as linear temporal logic formulas to generate tests as sequences of input/output pairs: inputs are extracted from the Buchi automata corresponding to the specifications, and outputs are obtained by feeding the inputs to the systems. Conformance is checked by comparing input/output sequences with automata traces to detect violations of the specifications. We consider several criteria for extracting tests and for stopping generation, and we compare them experimentally using both indicators of coverage and error-detection. The results show that our methodology can generate test suites with good system coverage and error-detection capability.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal