Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics

We explore the problem of finding a minimal complete test suite for a refusal trace (or failure trace) semantics. Since complete test suites are typically infinite, we consider the setting with a bound ℓ on the length of refusal traces of interest. A test suite T is thus complete if it is failed by...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Gazda, Maciej, Hierons, Robert M.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Computer science Refining Semantics Test pattern generators Testing
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!