{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:29:32Z","timestamp":1725838172103},"publisher-location":"New Delhi","reference-count":31,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132226512"},{"type":"electronic","value":"9788132226536"}],"license":[{"start":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T00:00:00Z","timestamp":1447891200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-81-322-2653-6_7","type":"book-chapter","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T15:47:51Z","timestamp":1447861671000},"page":"93-106","source":"Crossref","is-referenced-by-count":2,"title":["An Investigation into Effective Test Coverage"],"prefix":"10.1007","author":[{"given":"Debashis","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Rajib","family":"Mall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,19]]},"reference":[{"key":"7_CR1","unstructured":"Mall, M.: Fundamentals of Software Engineering. PHI learning pvt. ltd., New York (2009)"},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/267580.267590","volume":"29","author":"H Zhu","year":"1997","unstructured":"Zhu, H., Hall, P.A.V., May, J.H.R.: Software unit test coverage and adequacy. ACM Comput. Surv. (CSUR) 29(4), 366\u2013427 (1997)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"9","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1109\/32.6178","volume":"14","author":"EJ Weyuker","year":"1988","unstructured":"Weyuker, E.J.: Evaluating software complexity measures. IEEE Trans. Softw. Eng. 14(9), 1357\u20131365 (1988)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR4","unstructured":"Rapps, S., Weyuker, E.J.: Data flow analysis techniques for test data selection. In: Proceedings of the Sixth International Conference of Software Engineering, Tokyo, Japan, pp. 272\u2013277 (1982)"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/32.295895","volume":"20","author":"SR Chidamber","year":"1994","unstructured":"Chidamber, S.R., Kernerer, C.F.: A metrics suite for object oriented design. IEEE Trans. Softw. Eng. 20(6), 476\u2013493 (1994)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"7_CR6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/42372.42379","volume":"31","author":"Brian A. Nejmeh","year":"1988","unstructured":"Nejmeh, B.A.: NPath: a measure of execution path complexity and its applications. Commun. ACM 188\u2013200 (1988)","journal-title":"Communications of the ACM"},{"issue":"4","key":"7_CR7","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TSE.1976.233837","volume":"SE-2","author":"T.J. McCabe","year":"1976","unstructured":"McCabe, T.J.: A complexity measure. IEEE Trans. Softw. Eng. 308\u2013319 (1976)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"7_CR8","unstructured":"Natofos, S.C.: On testing with required elements. In: Proceedings on COMPSAC\u201981, IEEE Computer Society, pp. 132\u2013139 (1981)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TSE.1983.236871","volume":"9","author":"JW Laski","year":"1983","unstructured":"Laski, J.W., Korel, B.: A data flow oriented program testing strategy. IEEE Trans. Softw. Eng. 9(3), 347\u2013354 (1983)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR10","unstructured":"Mukherjee, D.: Dependency cov. criterion is testing. Technical report, submitted to CSE Dept., IIT Kharagpur (2015)"},{"key":"7_CR11","unstructured":"Mitchell, T.: Machine learning. McGraw-Hill, New York (1997)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Jones, J.A., Harrold, M.J., Stasko, J.: Visualization of test information to assist fault localization. In: Proceedings of the 24th International Conference on Software Engineering, ICSE \u201902, pp. 467\u2013477. ACM, New York (2002)","DOI":"10.1145\/581339.581397"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-012088525-1\/50007-9","volume-title":"Fault-Tolerant Systems","author":"Israel Koren","year":"2007","unstructured":"Koren, I., Krishna, C.M.: Fault Tolerant Systems. Elsevier, San Francisco (2007)"},{"key":"7_CR14","unstructured":"Weiser, M.: Program slicing. In: Proceedings of the 5th International Conference on Software Engineering, ICSE\u201981, pp. 439\u2013449. IEEE Press, Piscataway (1981)"},{"issue":"6","key":"7_CR15","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/62959.62963","volume":"31","author":"E. J. Weyuker","year":"1988","unstructured":"Weyuker, E.J.: The evaluation of program-based software test data adequacy criteria. Commun. ACM 31(6) 1988","journal-title":"Communications of the ACM"},{"key":"7_CR16","volume-title":"Elements of software science","author":"MH Halstead","year":"1977","unstructured":"Halstead, M.H.: Elements of software science. Elsevier, North-Holland (1977)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/954627.954633","volume":"12","author":"G Myers","year":"1977","unstructured":"Myers, G.: An extension to the cyclomatic measure of program complexity. ACM SIGPLAN 12, 61\u201364 (1977)","journal-title":"ACM SIGPLAN"},{"issue":"3","key":"7_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/TSE.1978.231497","volume":"SE-4","author":"E.T. Chen","year":"1978","unstructured":"Chen, E.T.: Program complexity and programmer productivity. IEEE. Trans. Softw. Eng. 187\u2013194 (1978)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"6","key":"7_CR19","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/TSE.1980.230799","volume":"SE-6","author":"A.L. Baker","year":"1980","unstructured":"Baker, A., Zwehen, S.: A comparison of measures of control flow complexity. IEEE Trans. Softw. Eng. 506\u2013512 (1980)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"7_CR20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0164-1212(83)90037-7","volume":"3","author":"W.M. Evangelist","year":"1983","unstructured":"Evangelist, W.: Software complexity metric sensitivity to program structuring rules. J. Syst. Softw. 231\u2013243 (1983)","journal-title":"Journal of Systems and Software"},{"key":"7_CR21","volume-title":"The elements of programming style","author":"B Kernighan","year":"1978","unstructured":"Kernighan, B., Plauger, P.: The elements of programming style, 2nd edn. McGraw-Hill, New York (1978)","edition":"2"},{"key":"7_CR22","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling, vol. 1. Prentice-Hall, Englewood Cliffs (1972)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Beth McColl, R., McKim, J.C. Jr.: Evaluating and extending NPath as a software complexity measure. J. Syst. Softw. 17, 275\u2013279 (1992)","DOI":"10.1016\/0164-1212(92)90116-2"},{"issue":"12","key":"7_CR24","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/32.106989","volume":"17","author":"K.B. Lakshmanan","year":"1991","unstructured":"Lakshmanan, K.B., Jayaprakash, S., Sinha, P.K.: Properties of control-flow complexity measures. IEEE. Trans. Softw. Eng. 17(12) 1991","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"11","key":"7_CR25","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/32.41326","volume":"15","author":"LA Clarke","year":"1989","unstructured":"Clarke, L.A., Podgurski, A., Richardson, D.J., Zeil, S.J.: A formal evaluation of data flow path selection criteria. IEEE Trans. Softw. Eng. 15(11), 1318\u20131332 (1989)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0950-5849(03)00029-6","volume":"45","author":"GB Mund","year":"2003","unstructured":"Mund, G.B., Mall, R., Sarkar, S.: Computation of intraprocedural dynamic program slices. Inf. Softw. Technol. 45, 499\u2013512 (2003)","journal-title":"Inf. Softw. Technol."},{"key":"7_CR27","volume-title":"The Compiler Design Handbook","author":"G Mund","year":"2002","unstructured":"Mund, G.B., Mall, R.: Chapter 8: program slicing: the compiler design handbook: optimizations and machine code generation. CRC Press, Boca Raton (2003)"},{"issue":"1","key":"7_CR28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02243881","volume":"25","author":"J. Schwarze","year":"1980","unstructured":"Schwarze Braunschweig, J.: An algorithm for hierarchical reduction and decomposition of a directed graph. Computing Springer, 25, 47\u201347 (1980)","journal-title":"Computing"},{"issue":"2","key":"7_CR29","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.dam.2004.02.017","volume":"145","author":"Ross M. McConnell","year":"2005","unstructured":"McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. J. Discrete Appl. Math. Struct. decompos. width parameters graph label. 145(2) (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"7_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5381\/jot.2010.9.4.a1","volume":"9","author":"ESF Najumudheen","year":"2010","unstructured":"Najumudheen, E.S.F., Mall, R., Samanta, D.: A dependence representation for coverage testing of object oriented programs. J. Object Technol. 9(4), 1\u201323 (2010)","journal-title":"J. Object Technol."},{"key":"7_CR31","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Symposium of ACM special interest group on automata and computability theory special interest group on programming languages (1997)"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computing and Systems for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-2653-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:10:07Z","timestamp":1559319007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-81-322-2653-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,19]]},"ISBN":["9788132226512","9788132226536"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-2653-6_7","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,11,19]]}}}