{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:34:04Z","timestamp":1761597244614},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252368"},{"type":"electronic","value":"9783540322757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32275-7_25","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T21:14:41Z","timestamp":1292879681000},"page":"380-397","source":"Crossref","is-referenced-by-count":29,"title":["Abstraction-Carrying Code"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","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":"25_CR2","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":"25_CR3","unstructured":"Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., L\u00f3pez-Garc\u00eda, P., Puebla, G.: The Ciao System. Reference Manual (v1.10). Technical University of Madrid (UPM) (May 2004), Available at \n                  \n                    http:\/\/clip.dia.fi.upm.es\/Software\/Ciao"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-46425-5_5","volume-title":"Programming Languages and Systems","author":"W. Charatonik","year":"2000","unstructured":"Charatonik, W.: Directional Type Checking for Logic Programs: Beyond Discriminative Types. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, pp. 72\u201387. Springer, Heidelberg (2000)"},{"key":"25_CR5","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":"25_CR6","first-page":"157","volume-title":"Types in Logic Programming","author":"P.W. Dart","year":"1992","unstructured":"Dart, P.W., Zobel, J.: A Regular Type Language for Logic Programs. In: Types in Logic Programming, pp. 157\u2013187. MIT Press, Cambridge (1992)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Fr\u00fcwirth, T., Shapiro, E., Vardi, M.Y., Yardeni, E.: Logic programs as types for logic programs. In: Proc. LICS 1991, pp. 300\u2013309 (1991)","DOI":"10.1109\/LICS.1991.151654"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44898-5_8","volume-title":"Static Analysis","author":"M. Hermenegildo","year":"2003","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., L\u00f3pez-Garc\u00eda, P.: Program Development Using Abstract Interpretation (and The Ciao System Preprocessor). In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 127\u2013152. Springer, Heidelberg (2003)"},{"issue":"2","key":"25_CR9","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"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming\u00a019\/20, 503\u2013581 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"3-4","key":"25_CR11","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":"25_CR12","volume-title":"The Java Virtual Machine Specification","author":"T. Lindholm","year":"1997","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley, Reading (1997)"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/319301.319345","volume":"21","author":"G. Morrisett","year":"1999","unstructured":"Morrisett, G., Walker, D., Crary, K., Glew, N.: From system F to typed assembly language. ACM TOPLAS\u00a021(3), 527\u2013568 (1999)","journal-title":"ACM TOPLAS"},{"key":"25_CR14","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, June 1991, pp. 49\u201363. MIT Press, Cambridge (1991)"},{"key":"25_CR15","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":"25_CR16","volume-title":"Proc. of PLDI 1998","author":"G. Necula","year":"1998","unstructured":"Necula, G., Lee, P.: The Design and Implementation of a Certifying Compiler. In: Proc. of PLDI 1998, ACM Press, New York (1998)"},{"key":"25_CR17","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":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.: An Assertion Language for Constraint Logic Programs. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) DiSCiPl 1999. LNCS, vol.\u00a01870, pp. 23\u201361. Springer, Heidelberg (2000)"},{"key":"25_CR19","unstructured":"Rose, K., Rose, E.: Lightweight bytecode verification. In: OOPSALA Workshop on Formal Underpinnings of Java (1998)"},{"key":"25_CR20","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., Du Varney, D.: Modelcarrying code: A practical approach for safe execution of untrusted applications. In: Proc. of SOSP 2003, pp. 15\u201328. ACM Press, New York (2003)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45789-5_10","volume-title":"Static Analysis","author":"C. Vaucheret","year":"2002","unstructured":"Vaucheret, C., Bueno, F.: More precise yet efficient type inference for logic programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 102\u2013116. Springer, Heidelberg (2002)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30142-4_22","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Wildmoser","year":"2004","unstructured":"Wildmoser, M., Nipkow, T.: Certifying Machine Code Safety: Shallow Versus Deep Embedding. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol.\u00a03223, pp. 305\u2013320. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32275-7_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:46:57Z","timestamp":1620013617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32275-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252368","9783540322757"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32275-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}