{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:58Z","timestamp":1725543478299},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540366355"},{"type":"electronic","value":"9783540366362"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_14","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T12:25:42Z","timestamp":1154953542000},"page":"163-178","source":"Crossref","is-referenced-by-count":11,"title":["Reduced Certificates for Abstraction-Carrying Code"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Albert, E., Arenas, P., Puebla, G., Hermenegildo, M.: Reduced Certificates for Abstraction-Carrying Code. Technical Report CLIP8\/2005.0, Technical University of Madrid (UPM), School of Computer Science, UPM (October 2005)"},{"key":"14_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-32275-7_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"E. Albert","year":"2005","unstructured":"Albert, E., Puebla, G., Hermenegildo, M.: Abstraction-Carrying Code. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 380\u2013397. Springer, Heidelberg (2005)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30569-9_1","volume-title":"Construction and Analysis of Safe, Secure, and Interoperable Smart Devices","author":"D. Aspinall","year":"2005","unstructured":"Aspinall, D., Gilmore, S., Hofmann, M., Sannella, D., Stark, I.: Mobile Resource Guarantees for Smart Devices. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol.\u00a03362, pp. 1\u201326. Springer, Heidelberg (2005)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. Journal of Logic Programming\u00a010, 91\u2013124 (1991)","journal-title":"Journal of Logic Programming"},{"key":"14_CR5","unstructured":"Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., L\u00f3pez-Garc\u00eda, P., Puebla, G. (eds.): The Ciao System. Reference Manual (v1.13). Technical report, School of Computer Science (UPM) (2006), Available at: \n                    \n                      http:\/\/clip.dia.fi.upm.es\/Software\/Ciao\/"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-24725-8_27","volume-title":"Programming Languages and Systems","author":"D. Cachera","year":"2004","unstructured":"Cachera, D., Jensen, T., Pichardie, D., Rusu, V.: Extracting a Data Flow Analyser in Constructive Logic. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 385\u2013400. Springer, Heidelberg (2004)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. of POPL 1977, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","volume-title":"Programming Languages and Systems","author":"P. Cousot","year":"2005","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: The ASTRE\u00c9 Analyzer. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 21\u201330. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M. Hermenegildo","year":"2005","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., L\u00f3pez-Garc\u00eda, P.: Integrated Program Debugging, Verification, and Optimization Using Abstract Interpretation (and The Ciao System Preprocessor). Science of Computer Programming\u00a058(1-2), 115\u2013140 (2005)","journal-title":"Science of Computer Programming"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"M. Hermenegildo","year":"2000","unstructured":"Hermenegildo, M., Puebla, G., Marriott, K., Stuckey, P.: Incremental Analysis of Constraint Logic Programs. ACM TOPLAS\u00a022(2), 187\u2013223 (2000)","journal-title":"ACM TOPLAS"},{"issue":"298","key":"14_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0304-3975(02)00869-1","volume":"3","author":"G. Klein","year":"2003","unstructured":"Klein, G., Nipkow, T.: Verified bytecode verifiers. Theoretical Computer Science\u00a03(298), 583\u2013626 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3-4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1025055424017","volume":"30","author":"X. Leroy","year":"2003","unstructured":"Leroy, X.: Java bytecode verification: algorithms and formalizations. Journal of Automated Reasoning\u00a030(3-4), 235\u2013269 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"14_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K. Marriot","year":"1998","unstructured":"Marriot, K., Stuckey, P.: Programming with Constraints: An Introduction. The MIT Press, Cambridge (1998)"},{"key":"14_CR15","first-page":"49","volume-title":"1991 International Conference on Logic Programming","author":"K. Muthukumar","year":"1991","unstructured":"Muthukumar, K., Hermenegildo, M.: Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In: 1991 International Conference on Logic Programming, pp. 49\u201363. MIT Press, Cambridge (1991)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/263699.263712","volume-title":"Proc. of POPL 1997","author":"G. Necula","year":"1997","unstructured":"Necula, G.: Proof-Carrying Code. In: Proc. of POPL 1997, pp. 106\u2013119. ACM Press, New York (1997)"},{"key":"14_CR17","first-page":"93","volume-title":"Proceedings of LICS 1998","author":"G.C. Necula","year":"1998","unstructured":"Necula, G.C., Lee, P.: Efficient representation and validation of proofs. In: Proceedings of LICS 1998, p. 93. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"14_CR18","first-page":"142","volume-title":"Proceedings of POPL 2001","author":"G.C. Necula","year":"2001","unstructured":"Necula, G.C., Rahul, S.P.: Oracle-based checking of untrusted software. In: Proceedings of POPL 2001, pp. 142\u2013154. ACM Press, New York (2001)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-61739-6_47","volume-title":"Static Analysis","author":"G. Puebla","year":"1996","unstructured":"Puebla, G., Hermenegildo, M.: Optimized Algorithms for the Incremental Analysis of Logic Programs. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 270\u2013284. Springer, Heidelberg (1996)"},{"issue":"13","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1002\/cpe.599","volume":"13","author":"E. Rose","year":"2001","unstructured":"Rose, E., Rose, K.: Java access protection through typing. Concurrency and Computation: Practice and Experience\u00a013(13), 1125\u20131132 (2001)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"14_CR21","unstructured":"Rose, K., Rose, E.: Lightweight bytecode verification. In: OOPSLA Workshop on Formal Underpinnings of Java (1998)"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/945445.945448","volume-title":"Proc. of SOSP 2003","author":"R. Sekar","year":"2003","unstructured":"Sekar, R., Venkatakrishnan, V.N., Basu, S., Bhatkar, S., DuVarney, D.: Model-carrying code: A practical approach for safe execution of untrusted applications. In: Proc. of SOSP 2003, pp. 15\u201328. ACM Press, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:24:45Z","timestamp":1619508285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11799573_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}