A meaningful bound for branch testing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A meaningful bound for branch testing

Full text

Pdf (113 KB)

Source

International Symposium on Software Testing and Analysis archive
Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis table of contents

Seattle, Washington, United States

Page: 202

Year of Publication: 1994

ISBN:0-89791-683-2

Authors

Antonia Bertolino	Istituto di Elaborazione della Informazione, CNR, Pisa, Italy
Martina Marré	Dipartimento di Informatica, Università di Pisa, Italy and Universitad de Buenos Aires, Argentina

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 11, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/186258.187203 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T. J. McCabe, "A Complexity Measure", IEEE Trans. on Software Eng., Vol. SE 2(4), Dec. 1976, pp. 308- 320.
	2	Richard Bache , Monika Mullerburg, Measures of testability as a basis for quality assurance, Software Engineering Journal, v.5 n.2, p.86-92, Mar. 1990
	3	D. Yates , N. Malevris, Reducing the effects of infeasible paths in branch testing, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.48-54, Dec. 1989
	4	Antonia Bertolino, Unconstrained edges and their application to branch analysis and testing of programs, Journal of Systems and Software, v.20 n.2, p.125-133, Feb. 1993 [doi>10.1016/0164-1212(93)90004-H]