{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:18Z","timestamp":1725511878253},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713142"},{"type":"electronic","value":"9783540713166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71316-6_19","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:58:28Z","timestamp":1184605108000},"page":"268-283","source":"Crossref","is-referenced-by-count":7,"title":["Small Witnesses for Abstract Interpretation-Based Proofs"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Besson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiphaine","family":"Turpin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11799573_14","volume-title":"Logic Programming","author":"E. Albert","year":"2006","unstructured":"Albert, E., et al.: Reduced certificates for abstraction-carrying code. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 163\u2013178. Springer, Heidelberg (2006)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.08.012","volume":"364","author":"F. Besson","year":"2006","unstructured":"Besson, F., Jensen, T., Pichardie, D.: Proof-Carrying Code from Certified Abstract Interpretation and Fixpoint Compression. Theoretical Computer Science\u00a0364, 273\u2013291 (2006)","journal-title":"Theoretical Computer Science"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"Proc. of the 4th ACM Symp. on Principles of Programming Languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints. In: Proc. of the 4th ACM Symp. on Principles of Programming Languages, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/512760.512770","volume-title":"Proc. of the 5th ACM Symp. on Principles of programming languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. of the 5th ACM Symp. on Principles of programming languages, pp. 84\u201396. ACM Press, New York (1978)"},{"key":"19_CR5","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/3-540-56922-7_28","volume-title":"Computer Aided Verification","author":"N. Halbwachs","year":"1993","unstructured":"Halbwachs, N.: Delay analysis in synchronous programs. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 333\u2013346. Springer, Heidelberg (1993)"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-6423(96)00041-X","volume":"31","author":"N. Halbwachs","year":"1998","unstructured":"Halbwachs, N.: About synchronous programming and abstract interpretation. Science of Computer Programming\u00a031(1), 75\u201389 (1998)","journal-title":"Science of Computer Programming"},{"key":"19_CR8","unstructured":"Koehler, H.: A contraction algorithm for finding minimal feedback sets. In: Proc.\u00a0 of the 28th Australasian Conf. on Computer Science, Newcastle, Australia, pp. 165\u2013173. Australian Computer Society, Inc. (2005)"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/0196-6774(88)90013-2","volume":"9","author":"H. Levy","year":"1988","unstructured":"Levy, H., Low, D.W.: A contraction algorithm for finding small cycle cutsets. J. Algorithms\u00a09(4), 470\u2013493 (1988)","journal-title":"J. Algorithms"},{"key":"19_CR10","volume-title":"Program Flow Analysis: Theory and Application","author":"S.S. Muchnick","year":"1981","unstructured":"Muchnick, S.S., Jones, N.D.: Program Flow Analysis: Theory and Application. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01237234","volume":"28","author":"T. Marlowe","year":"1990","unstructured":"Marlowe, T., Ryder, B.: Properties of data flow frameworks. Acta Informatica\u00a028, 121\u2013163 (1990)","journal-title":"Acta Informatica"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/263699.263712","volume-title":"Proc.\u00a0of the 24th ACM Symp. on Principles of programming languages","author":"G. Necula","year":"1997","unstructured":"Necula, G.: Proof-carrying code. In: Proc.\u00a0of the 24th ACM Symp. on Principles of programming languages, pp. 106\u2013119. ACM Press, New York (1997)"},{"key":"19_CR13","first-page":"93","volume-title":"Proc.\u00a0of the 13th IEEE Symp. on Logic in Computer Science","author":"G. Necula","year":"1998","unstructured":"Necula, G., Lee, P.: Efficient representation and validation of proofs. In: Proc.\u00a0of the 13th IEEE Symp. on Logic in Computer Science, pp. 93\u2013104. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/360204.360216","volume-title":"Proc.\u00a0of the 28th ACM Symp. on Principles of programming languages","author":"G.C. Necula","year":"2001","unstructured":"Necula, G.C., Rahul, S.P.: Oracle-based checking of untrusted software. In: Proc.\u00a0of the 28th ACM Symp. on Principles of programming languages, pp. 142\u2013154. ACM Press, New York (2001)"},{"issue":"3-4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/B:JARS.0000021015.15794.82","volume":"31","author":"E. Rose","year":"2003","unstructured":"Rose, E.: Lightweight bytecode verification. J. Automated Reasoning\u00a031(3-4), 303\u2013334 (2003)","journal-title":"J. Automated Reasoning"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-540-27864-1_7","volume-title":"Static Analysis","author":"S. Sankaranarayanan","year":"2004","unstructured":"Sankaranarayanan, S., Sipma, H., Manna, Z.: Constraint-based linear-relations analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 53\u201368. Springer, Heidelberg (2004)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/888251.888276","volume-title":"Proc.\u00a0of the 5th ACM Int. Conf. on Principles and Practice of Declarative Programming","author":"D. Wu","year":"2003","unstructured":"Wu, D., Appel, A.W., Stump, A.: Foundational proof checkers with small witnesses. In: Proc.\u00a0of the 5th ACM Int. Conf. on Principles and Practice of Declarative Programming, pp. 264\u2013274. ACM Press, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71316-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T03:12:26Z","timestamp":1550459546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71316-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540713142","9783540713166"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71316-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}