Abstract
Before getting into the more concrete and interesting stuff of good practices for building a reliable and maintainable test automation, let me set the stage by discussing the goal that many people aim for: reaching full coverage.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Dijkstra (1970). “Notes On Structured Programming” (EWD249), Section 3 (“On the Reliability of Mechanisms”).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Arnon Axelrod
About this chapter
Cite this chapter
Axelrod, A. (2018). Reaching Full Coverage. In: Complete Guide to Test Automation. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3832-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3832-5_4
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3831-8
Online ISBN: 978-1-4842-3832-5
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books