{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:16:52Z","timestamp":1770293812574,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540008866","type":"print"},{"value":"9783540365754","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36575-3_25","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T17:52:15Z","timestamp":1193507535000},"page":"363-379","source":"Crossref","is-referenced-by-count":15,"title":["Building Certified Libraries for PCC: Dynamic Storage Allocation"],"prefix":"10.1007","author":[{"given":"Dachuan","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadeem A.","family":"Hamid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"A. W. Appel. Foundational proof-carrying code. In Proc. 16th Annual IEEE Symposium on Logic in Computer Science, pages 247\u2013258, June 2001.","DOI":"10.1109\/LICS.2001.932501"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"C. Colby, P. Lee, G. Necula, F. Blau, M. Plesko, and K. Cline. A certifying compiler for Java. In Proc. 2000 ACM Conf. on Prog. Lang. Design and Impl., pages 95\u2013107, New York, 2000. ACM Press.","DOI":"10.1145\/349299.349315"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76:95\u2013120, 1988.","journal-title":"Information and Computation"},{"key":"25_CR4","unstructured":"J.-C. Filli\u00e2tre. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming (to appear), 2001."},{"key":"25_CR5","unstructured":"J.-C. Filli\u00e2tre. The WHY certification tool, tutorial and reference manual. http:\/\/why.lri.fr\/ , July 2002."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, Oct. 1969.","DOI":"10.1145\/363235.363259"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. Proof of a program: FIND. Communications of the ACM, Jan. 1971.","DOI":"10.1145\/362452.362489"},{"key":"25_CR8","unstructured":"W. A. Howard. The formulae-as-types notion of constructions. In To H.B.Curry: Essays on Computational Logic, Lambda Calculus and Formalism. Academic Press, 1980."},{"key":"25_CR9","unstructured":"B. W. Kernighan and D. M. Ritchie. The C Programming Language (Second Edition). Prentice Hall, 1988."},{"key":"25_CR10","unstructured":"D. E. Knuth. The Art of Computer Programming (Second Edition), volume 1. Addison-Wesley, 1973."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. In Proc. 25th ACM Symp. on Principles of Prog. Lang., pages 85\u201397. ACM Press, Jan. 1998.","DOI":"10.1145\/268946.268954"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"G. Necula. Proof-carrying code. In Proc. 24th ACM Symp. on Principles of Prog. Lang., pages 106\u2013119, New York, Jan. 1997. ACM Press.","DOI":"10.1145\/263699.263712"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"G. Necula and P. Lee. Safe kernel extensions without run-time checking. In Proc. 2nd USENIX Symp. on Operating System Design and Impl., pages 229\u2013243, 1996.","DOI":"10.1145\/238721.238781"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"G. Necula and P. Lee. The design and implementation of a certifying compiler. In Proc. 1998 ACM Conf. on Prog. Lang. Design and Impl., pages 333\u2013344, New York, 1998.","DOI":"10.1145\/277650.277752"},{"key":"25_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Inductive definitions in the system Coq-rules and properties","author":"C. Paulin-Mohring","year":"1993","unstructured":"C. Paulin-Mohring. Inductive definitions in the system Coq-rules and properties. In M. Bezem and J. Groote, editors, Proc. TLCA, volume 664 of LNCS. Springer-Verlag, 1993."},{"key":"25_CR16","unstructured":"J. C. Reynolds. Lectures on reasoning about shared mutable data structure. IFIP Working Group 2.3 School\/Seminar on State-of-the-Art Program Design Using Logic, Tandil, Argentina, September 6-13, 2000."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings Seventeenth Annual IEEE Symposium on Logic in Computer Science, Los Alamitos, California, 2002. IEEE Computer Society.","DOI":"10.1109\/LICS.2002.1029817"},{"key":"25_CR18","unstructured":"The Coq Development Team. The Coq proof assistant reference manual. The Coq release v7.1, Oct. 2001."},{"key":"25_CR19","unstructured":"The FLINT Project. Coq implementation for certified dynamic storage allocation. http:\/\/flint.cs.yale.edu\/flint\/publications\/cdsa.html , Oct. 2002."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"P. R. Wilson, M. S. Johnstone, M. Neely, and D. Boles. Dynamic storage allocation: A survey and critical review. In Proc. Int. Workshop on Memory Management, Kinross Scotland (UK), 1995.","DOI":"10.1007\/3-540-60368-9_19"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. K. Wright","year":"1994","unstructured":"A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38\u201394, 1994.","journal-title":"Information and Computation"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"D. Yu, N. A. Hamid, and Z. Shao. Building certified libraries for PCC: Dynamic storage allocation. Technical Report YALEU\/DCS\/TR-1247, Dept. of Computer Science, Yale Univeristy, New Haven, CT, Jan. 2003. http:\/\/flint.cs.yale.edu\/ .","DOI":"10.21236\/ADA639289"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36575-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:17:58Z","timestamp":1556921878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36575-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008866","9783540365754"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36575-3_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}