Removing redundant refusals: minimal complete test suites for failure trace semantics

Gazda, M. and Hierons, R.M. orcid.org/0000-0002-4771-1446 (2021) Removing redundant refusals: minimal complete test suites for failure trace semantics. In: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Proceedings of the 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 29 Jun - 02 Jul 2021, Rome, Italy. IEEE . ISBN 9781665448963

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Reproduced in accordance with the publisher's self-archiving policy.
Keywords: Computer science; Semantics; Refining; Test pattern generators; Testing
Dates:
  • Accepted: 4 May 2021
  • Published (online): 7 July 2021
  • Published: 7 July 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Funding Information:
FunderGrant number
Engineering and Physical Science Research CouncilEP/R025134/2
Depositing User: Symplectic Sheffield
Date Deposited: 07 May 2021 09:31
Last Modified: 07 Sep 2021 13:21
Status: Published
Publisher: IEEE
Refereed: Yes
Identification Number: https://doi.org/10.1109/LICS52264.2021.9470737
Related URLs:

Download

Accepted Version


Embargoed until: 7 July 2022

Filename: 2021083898.pdf

Request a copy

file not available

Share / Export

Statistics