{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:50:22Z","timestamp":1783684222966,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642046933","type":"print"},{"value":"9783642046940","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04694-0_10","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T05:50:17Z","timestamp":1252993817000},"page":"132-151","source":"Crossref","is-referenced-by-count":16,"title":["Runtime Verification of C Memory Safety"],"prefix":"10.1007","author":[{"given":"Grigore","family":"Ro\u015fu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfram","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Traian Florin","family":"\u015eerb\u0103nu\u0163\u0103","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"128","volume-title":"POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"G.C. Necula","year":"2002","unstructured":"Necula, G.C., McPeak, S., Weimer, W.: CCured: type-safe retrofitting of legacy code. In: POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 128\u2013139. ACM, New York (2002)"},{"key":"10_CR2","unstructured":"Hastings, R., Joyce, B.: Purify: Fast detection of memory leaks and access errors. In: Proceedings of the Winter USENIX Conference, January 1992, pp. 125\u2013136 (1992)"},{"key":"10_CR3","first-page":"89","volume-title":"PLDI","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Seward, J.: Valgrind: a framework for heavyweight dynamic binary instrumentation. In: Ferrante, J., McKinley, K.S. (eds.) PLDI, pp. 89\u2013100. ACM, New York (2007)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/1133981.1134000","volume-title":"PLDI 2006: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation","author":"E.D. Berger","year":"2006","unstructured":"Berger, E.D., Zorn, B.G.: Diehard: probabilistic memory safety for unsafe languages. In: PLDI 2006: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation, pp. 158\u2013168. ACM, New York (2006)"},{"issue":"12","key":"10_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1409360.1409382","volume":"51","author":"G. Novark","year":"2008","unstructured":"Novark, G., Berger, E.D., Zorn, B.G.: Exterminator: Automatically correcting memory errors with high probability. Commun. ACM\u00a051(12), 87\u201395 (2008)","journal-title":"Commun. ACM"},{"key":"10_CR6","volume-title":"C: A Reference Manual","author":"S.P. Harbison","year":"2002","unstructured":"Harbison, S.P., Steele, G.L.: C: A Reference Manual, 5th edn. Prentice Hall, Englewood Cliffs (2002)","edition":"5"},{"key":"10_CR7","unstructured":"Ro\u015fu, G.: K: A Rewriting-Based Framework for Computations \u2013 Preliminary version. Technical Report UIUCDCS-R-2007-2926, University of Illinois (2007)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2006.12.018","volume":"373","author":"J. Meseguer","year":"2007","unstructured":"Meseguer, J., Ro\u015fu, G.: The rewriting logic semantics project. Theor. Computer Science\u00a0373(3), 213\u2013237 (2007)","journal-title":"Theor. Computer Science"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.F., Ro\u015fu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Inf. and Comp. (to appear, 2009), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.ic.2008.03.026","DOI":"10.1016\/j.ic.2008.03.026"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditioned rewriting logic as a united model of concurrency. Theor. Comput. Sci.\u00a096(1), 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A.K. Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput.\u00a0115(1), 38\u201394 (1994)","journal-title":"Inf. Comput."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L. (eds.): All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/248621.248623","volume":"29","author":"M. Walicki","year":"1996","unstructured":"Walicki, M., Meldal, S.: Algebraic approaches to nondeterminism: An overview. ACM Comput. Surv.\u00a029(1), 30\u201381 (1996)","journal-title":"ACM Comput. Surv."},{"key":"10_CR14","unstructured":"Rosu, G., Schulte, W.: Matching logic. Technical Report UIUCDCS-R-2009-3026, University of Illinois at Urbana-Champaign (2009)"},{"key":"10_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1987","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"key":"10_CR16","unstructured":"K-Maude web page, \n                  \n                    http:\/\/fsl.cs.uiuc.edu\/index.php\/K-Maude"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04694-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:52:46Z","timestamp":1552157566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04694-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046933","9783642046940"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04694-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}