{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:35Z","timestamp":1742914295474,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642252709"},{"type":"electronic","value":"9783642252716"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25271-6_16","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T20:56:11Z","timestamp":1323896171000},"page":"297-315","source":"Crossref","is-referenced-by-count":1,"title":["Tightening Test Coverage Metrics: A Case Study in Equivalence Checking Using k-Induction"],"prefix":"10.1007","author":[{"given":"Alastair F.","family":"Donaldson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nannan","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kroening","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"R\u00fcmmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2004.12.021","volume":"119","author":"R. Armoni","year":"2005","unstructured":"Armoni, R., Fix, L., Fraer, R., Huddleston, S., Piterman, N., Vardi, M.Y.: SAT-based induction for temporal safety properties. Electr. Notes Theor. Comput. Sci.\u00a0119(2), 3\u201316 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"16_CR2","first-page":"118","volume":"58","author":"A. Biere","year":"2003","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers\u00a058, 118\u2013149 (2003)","journal-title":"Advances in Computers"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-40922-X_23","volume-title":"Formal Methods in Computer-Aided Design","author":"P. Bjesse","year":"2000","unstructured":"Bjesse, P., Claessen, K.: SAT-based verification without state space traversal. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 372\u2013389. Springer, Heidelberg (2000)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-17071-3_11","volume-title":"Formal Methods for Components and Objects","author":"A. Brillout","year":"2010","unstructured":"Brillout, A., He, N., Mazzucchi, M., Kroening, D., Purandare, M., R\u00fcmmer, P., Weissenbacher, G.: Mutation-based test case generation for simulink models. In: de Boer, F.S., Bonsangue, M.M., Hallerstede, S., Leuschel, M. (eds.) FMCO 2009. LNCS, vol.\u00a06286, pp. 208\u2013227. Springer, Heidelberg (2010)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.. M. Clarke","year":"2004","unstructured":"Clarke, E. M., Kr\u00f6ning, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 168\u2013176. Springer, Heidelberg (2004)"},{"key":"16_CR7","first-page":"238","volume-title":"Principles of Programming Languages (POPL)","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Principles of Programming Languages (POPL), pp. 238\u2013252. ACM, New York (1977)"},{"key":"16_CR8","first-page":"203","volume-title":"CHARME. IFIP Conference Proceedings","author":"D. D\u00e9harbe","year":"1997","unstructured":"D\u00e9harbe, D., Moreira, A.M.: Using induction and BDDs to model check invariants. In: CHARME. IFIP Conference Proceedings, vol.\u00a0105, pp. 203\u2013213. Chapman & Hall, Boca Raton (1997)"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/C-M.1978.218136","volume":"11","author":"R. DeMillo","year":"1978","unstructured":"DeMillo, R., Lipton, R., Sayward, F.: Hints on test data selection: Help for the practicing programmer. Computer\u00a011(4), 34\u201341 (1978)","journal-title":"Computer"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-18275-4_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A.F. Donaldson","year":"2011","unstructured":"Donaldson, A.F., Haller, L., Kroening, D.: Strengthening induction-based race checking with lightweight static analysis. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 169\u2013183. Springer, Heidelberg (2011)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-3-642-23702-7_26","volume-title":"SAS 2011","author":"A.F. Donaldson","year":"2011","unstructured":"Donaldson, A.F., Haller, L., Kroening, D., R\u00fcmmer, P.: Software verification using k-induction. In: Yahav, E. (ed.) SAS 2011. LNCS, vol.\u00a06887, pp. 351\u2013368. Springer, Heidelberg (2011)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-12002-2_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A.F. Donaldson","year":"2010","unstructured":"Donaldson, A.F., Kroening, D., R\u00fcmmer, P.: Automatic analysis of scratch-pad memory code for heterogeneous multicore processors. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 280\u2013295. Springer, Heidelberg (2010)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Donaldson, A.F., Kroening, D., R\u00fcmmer, P.: Automatic analysis of DMA races using model checking and k-induction. Formal Methods in System Design (2011)","DOI":"10.1007\/s10703-011-0124-2"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci.\u00a089(4) (2003)","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/DATE.1998.655922","volume-title":"Proceedings of the Conference on Design, Automation and Test in Europe (DATE)","author":"C.A.J. Eijk van","year":"1998","unstructured":"van Eijk, C.A.J.: Sequential equivalence checking without state space traversal. In: Proceedings of the Conference on Design, Automation and Test in Europe (DATE), pp. 618\u2013623. IEEE, Los Alamitos (1998)"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.entcs.2005.07.017","volume":"144","author":"A. Franz\u00e9n","year":"2006","unstructured":"Franz\u00e9n, A.: Using satisfiability modulo theories for inductive verification of Lustre programs. Electr. Notes Theor. Comput. Sci.\u00a0144(1), 19\u201333 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"16_CR17","first-page":"113","volume-title":"MEMOCODE","author":"D. Gro\u00dfe","year":"2010","unstructured":"Gro\u00dfe, D., Le, H.M., Drechsler, R.: Proving transaction and system-level properties of untimed SystemC TLM designs. In: MEMOCODE, pp. 113\u2013122. IEEE Computer Society, Los Alamitos (2010)"},{"key":"16_CR18","first-page":"109","volume-title":"FMCAD","author":"G. Hagen","year":"2008","unstructured":"Hagen, G., Tinelli, C.: Scaling up the formal verification of Lustre programs with SMT-based techniques. In: FMCAD, pp. 109\u2013117. IEEE, Los Alamitos (2008)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"He, N., R\u00fcmmer, P., Kroening, D.: Test-case generation for embedded Simulink via formal concept analysis. In: Proceedings of DAC (2011)","DOI":"10.1145\/2024724.2024777"},{"key":"16_CR20","unstructured":"Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Transactions on Software Engineering, TSE (2010)"},{"key":"16_CR21","series-title":"Kluwer International Series in Engineering and Computer Science Series","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-1-4615-0817-5_13","volume-title":"Logic Synthesis and Verification","author":"A. Kuehlmann","year":"2002","unstructured":"Kuehlmann, A., van Eijk, C.A.J.: Combinational and sequential equivalence checking. In: Logic Synthesis and Verification. Kluwer International Series in Engineering and Computer Science Series, pp. 343\u2013372. Kluwer, Dordrecht (2002)"},{"key":"16_CR22","first-page":"1","volume-title":"Formal Methods in Computer-Aided Design (FMCAD)","author":"O. Kupferman","year":"2008","unstructured":"Kupferman, O., Li, W., Seshia, S.A.: A theory of mutations with applications to vacuity, coverage, and fault tolerance. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 1\u20139. IEEE, Los Alamitos (2008)"},{"issue":"3","key":"16_CR23","first-page":"299","volume":"6","author":"C.J. Lillieroth","year":"1999","unstructured":"Lillieroth, C.J., Singh, S.: Formal verification of FPGA cores. Nord. J. Comput.\u00a06(3), 299\u2013319 (1999)","journal-title":"Nord. J. Comput."},{"key":"16_CR24","unstructured":"Offutt, J., Voas, J.M.: Subsumption of condition coverage techniques by mutation testing. Tech. Rep. ISSE-TR-96-01, George Mason University (1996)"},{"issue":"4","key":"16_CR25","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TSE.2006.37","volume":"32","author":"J.R. Ruthruff","year":"2006","unstructured":"Ruthruff, J.R., Burnett, M.M., Rothermel, G.: Interactive fault localization techniques in a spreadsheet environment. IEEE Transactions on Software Engineering (TSE)\u00a032(4), 213\u2013239 (2006)","journal-title":"IEEE Transactions on Software Engineering (TSE)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"16_CR27","unstructured":"Toom, A., Izerrouken, N., Naks, T., Pantel, M., Kai, O.S.Y.: Towards reliable code generation with an open tool: Evolutions of the Gene-Auto toolset. In: Proceedings, Embedded Real Time Software and Systems, ERTS (2010)"},{"key":"16_CR28","first-page":"63","volume-title":"VLSID","author":"V.C. Vimjam","year":"2007","unstructured":"Vimjam, V.C., Hsiao, M.S.: Explicit safety property strengthening in SAT-based induction. In: VLSID, pp. 63\u201368. IEEE, Los Alamitos (2007)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25271-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:28:48Z","timestamp":1561058928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25271-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642252709","9783642252716"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25271-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}