{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:04:25Z","timestamp":1762272265204,"version":"3.41.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319929699"},{"type":"electronic","value":"9783319929705"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92970-5_1","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T12:54:12Z","timestamp":1527598452000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["We Need a Testability Transformation Semantics"],"prefix":"10.1007","author":[{"given":"Mark","family":"Harman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"KR Apt","year":"1981","unstructured":"Apt, K.R.: Ten years of Hoare\u2019s logic: a survey - part I. ACM Trans. Prog. Lang. Syst. 3(4), 431\u2013483 (1981)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S.K., Ustuner, A.: Thorough static analysis of device drivers. In: Proceedings of the First European Systems Conference (EuroSys 2006), pp. 73\u201385. Leuven, Belgium, April 2006","DOI":"10.1145\/1217935.1217943"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bardin, S., Delahaye, M., David, R., Kosmatov, N., Papadakis, M., Traon, Y.L., Marion, J.Y.: Sound and quasi-complete detection of infeasible test requirements. In: International Conference on Software Testing, Verification and Validation (ICST 2015), pp. 1\u201310. IEEE Computer Society (2015)","DOI":"10.1109\/ICST.2015.7102607"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Baresel, A., Binkley, D., Harman, M., Korel, B.: Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach. In: International Symposium on Software Testing and Analysis (ISSTA 2004), pp. 108\u2013118. Omni Parker House Hotel, Boston, Massachusetts, July 2004. Appears in Software Engineering Notes 29(4)","DOI":"10.1145\/1007512.1007527"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2442","DOI":"10.1007\/3-540-45110-2_148","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"A Baresel","year":"2003","unstructured":"Baresel, A., Sthamer, H.: Evolutionary testing of flag conditions. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L.D., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A.C., Dowsland, K.A., Jonoska, N., Miller, J. (eds.) GECCO 2003, Part II. LNCS, vol. 2724, pp. 2442\u20132454. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45110-2_148"},{"issue":"5","key":"1_CR6","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1109\/TSE.2014.2372785","volume":"41","author":"ET Barr","year":"2015","unstructured":"Barr, E.T., Harman, M., McMinn, P., Shahbaz, M., Yoo, S.: The Oracle problem in software testing: a survey. IEEE Trans. Softw. Eng. 41(5), 507\u2013525 (2015)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"11\u201313","key":"1_CR7","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1016\/j.tcs.2009.10.025","volume":"411","author":"R Barraclough","year":"2010","unstructured":"Barraclough, R., Binkley, D., Danicic, S., Harman, M., Hierons, R., Kiss, A., Laurence, M.: A trajectory-based strict semantics for program slicing. Theor. Comput. Sci. 411(11\u201313), 1372\u20131386 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR8","volume-title":"Software Testing Techniques","author":"B Beizer","year":"1990","unstructured":"Beizer, B.: Software Testing Techniques. Van Nostrand Reinhold, New York (1990)"},{"key":"1_CR9","volume-title":"Future of Software Engineering 2007","author":"A Bertolino","year":"2007","unstructured":"Bertolino, A.: Software testing research: achievements, challenges, dreams. In: Briand, L., Wolf, A. (eds.) Future of Software Engineering 2007. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"1_CR10","unstructured":"British Standards Institute: BS 7925\u20132 software component testing (1998)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Cadar, C.: Targeted program transformations for symbolic execution. In: 10th Joint Meeting on Foundations of Software Engineering (ESEC\/FSE), pp. 906\u2013909 (2015)","DOI":"10.1145\/2786805.2803205"},{"issue":"2","key":"1_CR12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic execution for software testing: three decades later. Commun. ACM 56(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cartwright, R., Felleisen, M.: The semantics of program dependence. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 13\u201327 (1989)","DOI":"10.1145\/73141.74820"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Chekam, T.T., Papadakis, M., Traon, Y.L., Harman, M.: An empirical study on mutation, statement and branch coverage fault revelation that avoids the unreliable clean program assumption. In: Proceedings of the 39th International Conference on Software Engineering, ICSE 2017, Buenos Aires, Argentina, 20\u201328 May 2017, pp. 597\u2013608 (2017)","DOI":"10.1109\/ICSE.2017.61"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Chen, T.Y., Feng, J., Tse, T.H.: Metamorphic testing of programs on partial differential equations: a case study. In: 26th Annual International Computer Software and Applications Conference (COMPSAC 2002), pp. 327\u2013333. IEEE Computer Society (2002)","DOI":"10.1109\/CMPSAC.2002.1045022"},{"issue":"4","key":"1_CR16","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Logic Comput. 2(4), 511\u2013547 (1992)","journal-title":"J. Logic Comput."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program transformation frameworks by abstract interpretation. In: The 29th ACM Symposium on Principles of Programming Languages (POPL 2002), pp. 178\u2013190, Portland, Oregon, 16\u201318 January 2002","DOI":"10.1145\/503272.503290"},{"issue":"1","key":"1_CR18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"J Darlington","year":"1977","unstructured":"Darlington, J., Burstall, R.M.: A transformation system for developing recursive programs. J. Assoc. Comput. Mach. 24(1), 44\u201367 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1188.001.0001","volume-title":"Algebraic Semantics of Imperative Programs","author":"JA Goguen","year":"1996","unstructured":"Goguen, J.A., Malcolm, G.: Algebraic Semantics of Imperative Programs. MIT Press, Cambridge (1996)"},{"issue":"8","key":"1_CR20","doi-asserted-by":"crossref","first-page":"1871","DOI":"10.1007\/s00521-011-0568-8","volume":"21","author":"D Gong","year":"2012","unstructured":"Gong, D., Yao, X.: Testability transformation based on equivalence of target statements. Neural Comput. Appl. 21(8), 1871\u20131882 (2012)","journal-title":"Neural Comput. Appl."},{"issue":"6","key":"1_CR21","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/359605.359618","volume":"20","author":"J Guttag","year":"1977","unstructured":"Guttag, J.: Abstract data types and the development of data structures. Commun. ACM 20(6), 396\u2013404 (1977)","journal-title":"Commun. ACM"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Harman, M.: Open problems in testability transformation (keynote paper). In: 1st International Workshop on Search Based Testing (SBST 2008), Lillehammer, Norway (2008)","DOI":"10.1109\/ICSTW.2008.30"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78917-8_11","volume-title":"Formal Methods and Testing","author":"M Harman","year":"2008","unstructured":"Harman, M., Baresel, A., Binkley, D., Hierons, R., Hu, L., Korel, B., McMinn, P., Roper, M.: Testability transformation \u2013 program transformation to improve testability. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) Formal Methods and Testing. LNCS, vol. 4949, pp. 320\u2013344. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78917-8_11"},{"issue":"3","key":"1_CR24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/stvr.4370050303","volume":"5","author":"M Harman","year":"1995","unstructured":"Harman, M., Danicic, S.: Using program slicing to simplify testing. Softw. Test. Verification Reliab. 5(3), 143\u2013162 (1995)","journal-title":"Softw. Test. Verification Reliab."},{"issue":"1","key":"1_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TSE.2004.1265732","volume":"30","author":"M Harman","year":"2004","unstructured":"Harman, M., Hu, L., Hierons, R.M., Wegener, J., Sthamer, H., Baresel, A., Roper, M.: Testability transformation. IEEE Trans. Softw. Eng. 30(1), 3\u201316 (2004)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Harman, M., Jia, Y., Zhang, Y.: Achievements, open problems and challenges for search based software testing (keynote paper). In: 8th IEEE International Conference on Software Testing, Verification and Validation (ICST 2015), Graz, Austria, April 2015","DOI":"10.1109\/ICST.2015.7102580"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Harman, M., Yao, X., Jia, Y.: A study of equivalent and stubborn mutation operators using human analysis of equivalence. In: 36th International Conference on Software Engineering (ICSE 2014), pp. 919\u2013930, Hyderabad, India, June 2014","DOI":"10.1145\/2568225.2568265"},{"issue":"4","key":"1_CR28","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1093\/comjnl\/bxh093","volume":"48","author":"R Hierons","year":"2005","unstructured":"Hierons, R., Harman, M., Fox, C.: Branch-coverage testability transformation for unstructured programs. Comput. J. 48(4), 421\u2013436 (2005)","journal-title":"Comput. J."},{"key":"1_CR29","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis of computer programming. Commun. ACM 12, 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"issue":"10","key":"1_CR30","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.infsof.2009.04.016","volume":"51","author":"Y Jia","year":"2009","unstructured":"Jia, Y., Harman, M.: Higher order mutation testing. J. Inf. Softw. Technol. 51(10), 1379\u20131393 (2009)","journal-title":"J. Inf. Softw. Technol."},{"issue":"5","key":"1_CR31","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1109\/TSE.2010.62","volume":"37","author":"Y Jia","year":"2011","unstructured":"Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Trans. Softw. Eng. 37(5), 649\u2013678 (2011)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Just, R., Jalali, D., Inozemtseva, L., Ernst, M.D., Holmes, R., Fraser, G.: Are mutants a valid substitute for real faults in software testing? In: International Symposium on Foundations of Software Engineering (FSE), pp. 654\u2013665 (2014)","DOI":"10.1145\/2635868.2635929"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Kalaji, A., Hierons, R.M., Swift, S.: A testability transformation approach for state-based programs. In: 1st International Symposium on Search Based Software Engineering (SSBSE 2009), pp. 85\u201388. IEEE, Windsor, May 2009","DOI":"10.1109\/SSBSE.2009.14"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Korel, B., Harman, M., Chung, S., Apirukvorapinit, P., Gupta, R.: Data dependence based testability transformation in automated test generation. In: 16th International Symposium on Software Reliability Engineering (ISSRE 2005), pp. 245\u2013254, Chicago, Illinios, USA, November 2005","DOI":"10.1109\/ISSRE.2005.16"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Kurtz, B., Ammann, P., Delamaro, M.E., Offutt, J., Deng, L.: Mutant subsumption graphs. In: 10th Mutation Testing Workshop (Mutation 2014), Cleveland Ohio, USA, March 2014, to appear","DOI":"10.1109\/ICSTW.2014.20"},{"issue":"1","key":"1_CR36","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TSE.2011.104","volume":"38","author":"C Goues Le","year":"2012","unstructured":"Le Goues, C., Nguyen, T., Forrest, S., Weimer, W.: GenProg: a generic method for automatic software repair. IEEE Trans. Softw. Eng. 38(1), 54\u201372 (2012)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-23716-4_21","volume-title":"Search Based Software Engineering","author":"Y Li","year":"2011","unstructured":"Li, Y., Fraser, G.: Bytecode testability transformation. In: Cohen, M.B., \u00d3 Cinn\u00e9ide, M. (eds.) SSBSE 2011. LNCS, vol. 6956, pp. 237\u2013251. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23716-4_21"},{"issue":"1","key":"1_CR38","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TSE.2013.44","volume":"40","author":"L Madeyski","year":"2014","unstructured":"Madeyski, L., Orzeszyna, W., Torkar, R., Jozala, M.: Overcoming the equivalent mutant problem: a systematic literature review and a comparative experiment of second order mutation. IEEE Trans. Softw. Eng. 40(1), 23\u201342 (2014)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"McMinn, P.: Search-based failure discovery using testability transformations to generate pseudo-oracles. In: Rothlauf, F. (ed.) Genetic and Evolutionary Computation Conference (GECCO 2009), pp. 1689\u20131696. ACM, Montreal (2009)","DOI":"10.1145\/1569901.1570127"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"McMinn, P., Binkley, D., Harman, M.: Empirical evaluation of a nesting testability transformation for evolutionary testing. ACM Trans. Softw. Eng. Methodol. 18(3) (2009). Article no. 11","DOI":"10.1145\/1525880.1525884"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Jia, Y., Harman, M., Traon, Y.L.: Trivial compiler equivalence: a large scale empirical study of a simple, fast and effective equivalent mutant detection technique. In: 37th International Conference on Software Engineering (ICSE 2015), pp. 936\u2013946, Florence, Italy (2015)","DOI":"10.1109\/ICSE.2015.103"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Parsons-Selke, R.: A graph semantics for program dependence graphs. In: Sixteenth ACM Symposium on Principles of Programming Languages (POPL), Austin, TX, 11\u201313 January 1989, pp. 12\u201324 (1989)","DOI":"10.1145\/75277.75279"},{"key":"1_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61512-2","volume-title":"The Specification and Transformation of Programs: A Formal Approach to Software Development","author":"HA Partsch","year":"1990","unstructured":"Partsch, H.A.: The Specification and Transformation of Programs: A Formal Approach to Software Development. Springer, Heidelberg (1990)"},{"key":"1_CR44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jlap.2004.03.009","volume":"60","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: The origins of structural operational semantics. J. Logic Algebraic Prog. 60, 3\u201315 (2004)","journal-title":"J. Logic Algebraic Prog."},{"key":"1_CR45","unstructured":"Radio Technical Commission for Aeronautics: RTCA DO178-B Software considerations in airborne systems and equipment certification (1992)"},{"key":"1_CR46","unstructured":"Reps, T., Yang, W.: The semantics of program slicing. Technical report 777, University of Wisconsin (1988)"},{"issue":"3","key":"1_CR47","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10710-013-9195-8","volume":"15","author":"E Schulte","year":"2014","unstructured":"Schulte, E., Fry, Z.P., Fast, E., Weimer, W., Forrest, S.: Software mutational robustness. Genet. Program. Evolvable Mach. 15(3), 281\u2013312 (2014)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Woodward, M.R., Halewood, K.: From weak to strong, dead or alive? An analysis of some mutation testing issues. In: 2nd Workshop on Software Testing, Verification, and Analysis. Banff, Canada, July 1988","DOI":"10.1109\/WST.1988.5370"},{"issue":"5","key":"1_CR49","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/j.jss.2005.05.030","volume":"79","author":"YT Yu","year":"2006","unstructured":"Yu, Y.T., Lau, M.F.: A comparison of MC\/DC, MUMCUT and several other coverage criteria for logical decisions. J. Syst. Softw. 79(5), 577\u2013590 (2006)","journal-title":"J. Syst. Softw."},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, J., Hao, D., Zhang, L., Zhang, L.: To detect abnormal program behaviours via mutation deduction. In: Mutation Testing Workshop, Mutation 2018, to appear","DOI":"10.1109\/ICSTW.2018.00022"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92970-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:38:35Z","timestamp":1751661515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92970-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319929699","9783319929705"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92970-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}