A mechanised proof of an adaptive state counting algorithm

Sachtleben, R., Hierons, R. orcid.org/0000-0002-4771-1446, Huang, W.-L. et al. (1 more author) (2019) A mechanised proof of an adaptive state counting algorithm. In: Gaston, C., Kosmatov, N. and Le Gall, P., (eds.) ICTSS 2019 : Testing Software and Systems. The 31st IFIP International Conference on Testing Software and Systems (IFIP-ICTSS 2019), 15-17 Oct 2019, Paris, France. Lecture Notes in Computer Science (11812). Springer , pp. 176-193. ISBN 9783030312794



Copyright, Publisher and Additional Information: © 2019 IFIP International Federation for Information Processing. This is an author-produced version of a paper subsequently published in ICTSS 2019 Proceedings. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Complete test methods; Finite State Machines; Reduction; Proof Assistants; Isabelle/HOL; Mechanised Proofs
  • Accepted: 11 July 2019
  • Published (online): 8 October 2019
  • Published: 8 October 2019
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 12 Aug 2019 14:04
Last Modified: 08 Oct 2020 00:38
Published Version: http://ictss2019.centralesupelec.fr/
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Refereed: Yes
Identification Number: https://doi.org/10.1007/978-3-030-31280-0_11

Share / Export