{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:53Z","timestamp":1778300993893,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540439974","type":"print"},{"value":"9783540456575","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45657-0_45","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T14:59:43Z","timestamp":1179586783000},"page":"526-538","source":"Crossref","is-referenced-by-count":73,"title":["Temporal-Safety Proofs for Systems Code"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George C.","family":"Necula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjit","family":"Jhala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Sutre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Westley","family":"Weimer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"T. Ball, R. Majumdar, T. Millstein, and S.K. Rajamani. Automatic predicate abstraction of C programs. Conf. Programming Language Design and Implementation, pp. 203\u2013213. ACM, 2001.","DOI":"10.1145\/378795.378846"},{"key":"45_CR2","unstructured":"T. Ball and S.K. Rajamani. Personal communication."},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"T. Ball and S.K. Rajamani. The Slast project: debugging system software via static analysis. Symp. Principles of Programming Languages, pp. 1\u20133. ACM, 2002.","DOI":"10.1145\/565816.503274"},{"key":"45_CR4","unstructured":"D. Blei, C. Harrelson, R. Jhala, R. Majumdar, G.C. Necula, S.P. Rahul, W. Weimer, and D. Weitz. Vampyre: A Proof-generating Theorem Prover. http:\/\/www.eecs.berkeley.edu\/~rupak\/Vampyre ."},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"A. Chou, J. Yang, B. Chelf, S. Hallem, and D. Engler. An empirical study of operating system bugs. Symp. Operating System Principles, pp. 78\u201381. ACM, 2001.","DOI":"10.1145\/502039.502042"},{"key":"45_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer-Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. Computer-Aided Verification, LNCS 1855, pp. 154\u2013169. Springer-Verlag, 2000."},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, Robby, S. Laubach, and H. Zheng. Bandera: extracting finite-state models from Java source code. Int. Conf. Software Engineering, pp. 439\u2013448. ACM, 2000.","DOI":"10.1145\/337180.337234"},{"key":"45_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-48683-6_16","volume-title":"Computer-Aided Verification","author":"S. Das","year":"1999","unstructured":"S. Das, D. L. Dill, and S. Park. Experience with predicate abstraction. Computer-Aided Verification, LNCS 1633, pp. 160\u2013171. Springer-Verlag, 1999."},{"key":"45_CR9","unstructured":"D. Detlefs, G. Nelson, and J. Saxe. The Simplify Theorem Prover. http:\/\/research.compaq.com\/SRC\/esc\/Simplify.html ."},{"key":"45_CR10","unstructured":"E. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976."},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"M.D. Ernst. Dynamically Discovering Likely Program Invariants. Ph.D. Thesis. University of Washington, Seattle, 2000.","DOI":"10.1145\/302405.302467"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"J.S. Foster, T. Terauchi, and A. Aiken. Flow sensitive type qualifiers. Conf. Programming Languages Design and Implementation (to appear), ACM, 2002.","DOI":"10.21236\/ADA603588"},{"key":"45_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer-Aided Verification","author":"S. Graf","year":"1997","unstructured":"S. Graf and H. Sa\u00efdi. Construction of abstract state graphs with PVS. Computer-Aided Verification, LNCS 1254, pp. 72\u201383. Springer-Verlag, 1997."},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40:143\u2013184, 1993.","journal-title":"Journal of the ACM"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. Symp. Principles of Programming Languages, pp. 58\u201370. ACM, 2002.","DOI":"10.1145\/565816.503279"},{"key":"45_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/10722468_8","volume-title":"SPIN Workshop","author":"G. Holzmann","year":"2000","unstructured":"G. Holzmann. Logic verification of ANSI-C code with Spin. SPIN Workshop, LNCS 1885, pp. 131\u2013147. Springer-Verlag, 2000."},{"key":"45_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-44585-4_2","volume-title":"Computer-Aided Verification","author":"K. Namjoshi","year":"2001","unstructured":"K. Namjoshi. Certifying model checkers. Computer-Aided Verification, LNCS 2102, pp. 2\u201313. Springer-Verlag, 2001."},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"G.C. Necula. Proof carrying code. Symp. Principles of Programming Languages, pp. 106\u2013119. ACM, 1997.","DOI":"10.1145\/263699.263712"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"G. Necula and S.P. Rahul. Oracle-based checking of untrusted software. Symp. Principles of Programming Languages, pp. 142\u2013154. ACM, 2001.","DOI":"10.1145\/373243.360216"},{"key":"45_CR20","doi-asserted-by":"crossref","unstructured":"G.C. Necula and P. Lee. Efficient representation and validation of proofs. Symp. Logic in Computer Science, pp. 93\u2013104. IEEE Computer Society, 1998.","DOI":"10.1109\/LICS.1998.705646"},{"key":"45_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45937-5_16","volume-title":"Compiler Construction","author":"G.C. Necula","year":"2002","unstructured":"G.C. Necula, S. McPeak, S.P. Rahul, and W. Weimer. CIL: intermediate language and tools for analysis and transformation of C programs. Compiler Construction, LNCS 2304, pp. 213\u2013228. Springer-Verlag, 2002."},{"key":"45_CR22","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"SPIN Workshop","author":"D. Peled","year":"2001","unstructured":"D. Peled and L. Zuck. From model checking to a temporal proof. SPIN Workshop, LNCS 2057, pp. 1\u201314. Springer-Verlag, 2001."},{"key":"45_CR23","unstructured":"F. Pfenning. Computation and Deduction. Lecture notes, CMU, 1997."},{"key":"45_CR24","unstructured":"F. Somenzi. Colorado University Decision Diagram Package. http:\/\/vlsi.colorado.edu\/pub ."},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"W. Visser, K. Havelund, G. Brat, and S. Park. Model Checking Programs. Conf. Automated Software Engineering, pp. 3\u201312. IEEE, 2000.","DOI":"10.1109\/ASE.2000.873645"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45657-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T13:11:06Z","timestamp":1737033066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45657-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439974","9783540456575"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45657-0_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}