Testing Non-Testable Programs using Association Rules скачать в хорошем качестве

Testing Non-Testable Programs using Association Rules

We propose a novel scalable approach for testing non-testable programs denoted as ARMED testing. The approach leverages efficient Association Rules Mining algorithms to determine relevant implication relations among features and actions observed while the system is in operation. These relations are used as the specification of positive and negative tests, allowing for identifying plausible or suspicious behaviors: for those cases when oracles are inherently unknownable, such as in social testing, ARMED testing introduces the novel concept of testing for plausibility. To illustrate the approach we walk-through an application example. Emilio Cruciani (Universität Salzburg), Roberto Verdecchia (Vrije Universiteit Amsterdam), Created with Midspace: https://midspace.app/