{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T04:15:52Z","timestamp":1684383352198},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00354-008-0039-7","type":"journal-article","created":{"date-parts":[[2008,4,30]],"date-time":"2008-04-30T14:11:43Z","timestamp":1209564703000},"page":"171-204","source":"Crossref","is-referenced-by-count":4,"title":["Abstraction-Carrying Code: a Model for Mobile Code Safety"],"prefix":"10.1007","volume":"26","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","published-online":{"date-parts":[[2008,5,1]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Puebla, G. and Hermenegildo, M., \u201cReduced Certificates for Abstraction-Carrying Code,\u201d in 22nd International Conference on Logic Programming (ICLP 2006), LNCS 4079, Springer-Verlag, pp. 163-178, August 2006.","DOI":"10.1007\/11799573_14"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Albert, E., G\u00f3mez-Zamalloa, M., Hubert, L. and Puebla, G., \u201cVerification of Java Bytecode using Analysis and Transformation of Logic Programs,\u201d in Ninth Int. Symp. on Practical Aspects of Declarative Languages, LNCS 4354, Springer-Verlag, pp 124-139, January 2007.","DOI":"10.1007\/978-3-540-69611-7_8"},{"key":"39_CR3","unstructured":"Appel, A. and Felty, A. \u201cLightweight Lemmas in lambda-Prolog,\u201d in Proc. of ICLP\u201999, MIT Press, pp. 411-425, 1999."},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Aspinall, D., Gilmore, S., Hofmann, M, Sannella, D. and Stark, I., \u201cMobile Resource Guarantees for Smart Devices,\u201d in CASSIS\u201904 (Barthe, G., Burdy, L., Huisman, M. Lanet, J.-L. and Muntean, T. eds.), LNCS 3362, Springer, pp. 1-27, 2005.","DOI":"10.1007\/978-3-540-30569-9_1"},{"key":"39_CR5","unstructured":"Barras, B., Boutin, S., Cornes, C., Courant, J., Filliatre, J., Gimenez, E., Herbelin, H., Huet, G., Munoz, C., Murthy, C., Parent, C., Paulin-Mohring, C., Saibi, A. and Werner, B, \u201cThe Coq proof assistant reference manual : Version 6.1,\u201d Technical Report RT-0203, 1997, citeseer.ist.psu.edu\/barras97coq.html."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Bernard, A. and Lee, P. \u201cTemporal logic for proof-carrying code,\u201d in Proc. of CADE\u201902, LINCS, Springer, pp. 31-46, 2002.","DOI":"10.1007\/3-540-45620-1_3"},{"key":"39_CR7","unstructured":"Besson, F., Jensen, T. and Pichardie, D., \u201cA pcc architecture based on certified abstract interpretation,\u201d in Proc. of First Int. Workshop on Emerging Applications of Abstract Interpretation (EAAI\u201906), Electronic Notes in Theoretical Computer Science (ENTCS), 2006."},{"key":"39_CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M Bruynooghe","year":"1991","unstructured":"Bruynooghe, M, \u201cA Practical Framework for the Abstract Interpretation of Logic Programs,\u201d Journal of Logic Programming, 10, pp. 91-124, 1991.","journal-title":"Journal of Logic Programming"},{"key":"39_CR9","unstructured":"Bueno, F., Cabeza, D., Carro, M. Hermenegildo, M., L\u00f3pez-Garci\u00e1, P. and Puebla, G., \u201cThe Ciao Prolog System. Reference Manual (v1.8),\u201d The Ciao System Documentation Series-TR CLIP4\/2002.1, School of Computer Science, Technical University of Madrid (UPM), May 2002. System and on-line version of the manual available at http:\/\/www.ciaohome.org ."},{"key":"39_CR10","unstructured":"Bueno, F., Garc\u00eda de la Banda, M. and Hermenegildo, M., \u201cEffectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization,\u201d in Int. Symp. on Logic Programming, MIT Press, pp. 320-336, November 1994."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Cachera, D., Jensen, T., Pichardie, D. and Rusu, V., \u201cExtracting a Data Flow Analyser in Constructive Logic,\u201d in Proc. of ESOP 2004, LNCS 2986, pp. 385-400, 2004.","DOI":"10.1007\/978-3-540-24725-8_27"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Charatonik, W., \u201cDirectional Type Checking for Logic Programs: Beyond Discriminative Types,\u201d in Proc. of ESOP 2000, LINCS 1782, pp. 72-87, 2000.","DOI":"10.1007\/3-540-46425-5_5"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Le Charlier, B., Degimbe, O., Michael, L. and Van Hentenryck, P., \u201cOptimization Techniques for General Purpose Fixpoint Algorithms: Practical Efficiency for the Abstract Interpretation of Prolog,\u201d in Workshop on Static Analysis, Springer-Verlag, pp. 15-26, September 1993.","DOI":"10.1007\/3-540-57264-3_26"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Le Charlier, B. and Van Hentenryck, P, \u201cExperimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog,\u201d ACM Transactions on Programming Languages and Systems, 16(1), pp. 35-101, 1994.","DOI":"10.1145\/174625.174627"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Comini, M., Gori, R., Levi, G. and Volpe, P., \u201cAbstract Interpretation based Verification of Logic Programs,\u201d Electr. Notes Theor. Comput. Sci., 30(1), 2000.","DOI":"10.1016\/S1571-0661(04)00112-4"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Cousot, R., \u201cAbstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints,\u201d in Proc. of POPL\u201977, pp. 238-252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"39_CR17","unstructured":"Dart, P.W. and Zobel, J., \u201cA Regular Type Language for Logic Programs,\u201d in Types in Logic Programming, MIT Press, pp. 157-187, 1992."},{"issue":"3","key":"39_CR18","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"S.K. Debray","year":"1989","unstructured":"Debray, S.K., \u201cStatic Inference of Modes and Data Dependencies in Logic Programs,\u201d ACM Transactions on Programming Languages and Systems, 11(3), pp.:418-450, 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Debray, S.K.(ed.), \u201cAbstract Interpretation\u201d, Journal of Logic Programming, Special Issue: Vol. 13(1-2), North-Holland, July 1992.","DOI":"10.1016\/0743-1066(92)90029-3"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Fr\u00fcwirth, T., Shapiro, E., Vardi, M.Y. and Yardeni, E., \u201cLogic programs as types for logic programs,\u201d in Proc. LICS\u201991, pp, 300-309, 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F. and L\u00f3pez-Garc\u00eda, P., \u201cProgram Development Using Abstract Interpretation (and The Ciao System Preprocessor),\u201d in Proc. of SAS\u201903, LINCS 2694, Springer, pp. 127-152, 2003.","DOI":"10.1007\/3-540-44898-5_8"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M., Puebla, G., Marriott, K. and Stuckey, P., \u201cIncremental Analysis of Constraint Logic Programs,\u201d ACM Transactions on Programming Languages and Systems, 22(2), pp. 187-223, March 2000.","DOI":"10.1145\/349214.349216"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M., Warren, R. and Debray, S.K., \u201cGlobal Flow Analysis as a Practical Compilation Tool,\u201d Journal of Logic Programming, 13(4), pp. 349-367, August 1992.","DOI":"10.1016\/0743-1066(92)90053-6"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and Maher, M.J., \u201cConstraint Logic Programming: A Survey,\u201d Journal of Logic Programming, 19\/20, pp. 503-581, 1994.","DOI":"10.1016\/0743-1066(94)90033-7"},{"issue":"2","key":"39_CR25","first-page":"188","volume":"28","author":"A. Kelly","year":"1998","unstructured":"Kelly, A., Marriott, K., S\u00f8ndergaard, H. and Stuckey, P.J., \u201cA practical object-oriented analysis engine for CLP,\u201d Software: Practice and Experience, 28(2), pp. 188-224, 1998.","journal-title":"Software: Practice and Experience"},{"issue":"3-4","key":"39_CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1025055424017","volume":"30","author":"Xavier Leroy","year":"2003","unstructured":"Xavier Leroy, \u201cJava bytecode verification: algorithms and formalizations,\u201d Journal of Automated Reasoning, 30(3-4), pp. 235-269, 2003.","journal-title":"Journal of Automated Reasoning"},{"key":"39_CR27","doi-asserted-by":"crossref","unstructured":"Lindholm, T. and Yellin, F., The Java Virtual Machine Specification, Addison-Wesley, 1997.","DOI":"10.1016\/S1353-4858(97)83033-4"},{"issue":"3","key":"39_CR28","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/177492.177650","volume":"16","author":"K. Marriott","year":"1994","unstructured":"Marriott, K., S\u00f8ndergaard, H. and Jones, N.D., \u201cDenotational Abstract Interpretation of Logic Programs,\u201d ACM Transactions on Programming Languages and Systems, 16(3), pp. 607-648, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"39_CR29","doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-Lojo, M., Navas, J. and Hermenegildo, M., \u201cAn Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode,\u201d in ETAPS Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE\u201907), Electronic Notes in Theoretical Computer Science. Elsevier - North Holland, March 2007. To appear.","DOI":"10.1016\/j.entcs.2007.02.060"},{"issue":"3","key":"39_CR30","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/319301.319345","volume":"21","author":"G. Morrisett","year":"1999","unstructured":"Morrisett, G., Walker, D., Crary, K. and Glew, N., \u201cFrom system F to typed assembly language,\u201d ACM Transactions on Programming Languages and Systems, 21(3), pp. 527-568, 1999.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"39_CR31","unstructured":"Muthukumar, K. and Hermenegildo, M., \u201cDeriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs,\u201d Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, April 1990."},{"key":"39_CR32","unstructured":"Muthukumar, K. and Hermenegildo, M., \u201cCombined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation,\u201d in Int. Conf. on Logic Programming, MIT Press, pp. 49-63, June 1991."},{"key":"39_CR33","doi-asserted-by":"crossref","unstructured":"Muthukumar, K. and Hermenegildo, M., \u201cCompile-time Derivation of Variable Dependency Using Abstract Interpretation,\u201d Journal of Logic Programming, 13(2\/3), pp.315-347, July 1992.","DOI":"10.1016\/0743-1066(92)90035-2"},{"key":"39_CR34","doi-asserted-by":"crossref","unstructured":"Necula, G., \u201cProof-Carrying Code,\u201d in Proc. of POPL\u201997, ACM Press, pp. 106-119, 1997.","DOI":"10.1145\/263699.263712"},{"key":"39_CR35","doi-asserted-by":"crossref","unstructured":"Necula, G. and Lee, P., \u201cThe Design and Implementation of a Certifying Compiler,\u201d in Proc. of PLDI\u201998, ACM Press, 1998.","DOI":"10.1145\/277650.277752"},{"key":"39_CR36","doi-asserted-by":"crossref","unstructured":"Necula, G.C. and Rahul, S.P., \u201cOracle-based checking of untrusted software,\u201d in Proc. of POPL\u201901, ACM Press, pp. 142-154, 2001.","DOI":"10.1145\/360204.360216"},{"key":"39_CR37","doi-asserted-by":"crossref","unstructured":"Puebla, G., Bueno, F. and Hermenegildo, M., \u201cAn Assertion Language for Constraint Logic Programs,\u201d in Analysis and Visualization Tools for Constraint Programming, LINCS 1870, Springer, pp. 23-61, 2000.","DOI":"10.1007\/10722311_2"},{"key":"39_CR38","doi-asserted-by":"crossref","unstructured":"Puebla, G., Correas, J., Hermenegildo, M., Bueno, F., Garc\u00eda de la Banda, M., Marriott, K. and Stuckey, P.J., \u201cA Generic Framework for Context-Sensitive Analysis of Modular Programs,\u201d in Program Development in Computational Logic, A Decade of Research Advances in Logic-Based Program Development (Bruynooghe, M. and Lau, K. eds.), LNCS 3049, Springer-Verlag, Heidelberg, Germany, pp. 234-261, August 2004.","DOI":"10.1007\/978-3-540-25951-0_8"},{"key":"39_CR39","doi-asserted-by":"crossref","unstructured":"Puebla, G. and Hermenegildo, M., \u201cOptimized Algorithms for the Incremental Analysis of Logic Programs,\u201d in SAS\u201996, LINCS 1145, Springer, pp. 270-284, 1996.","DOI":"10.1007\/3-540-61739-6_47"},{"key":"39_CR40","unstructured":"Rose, K., Rose, E., \u201cLightweight bytecode verification,\u201d in OOPSLA Workshop on Formal Underpinnings of Java, 1998."},{"key":"39_CR41","doi-asserted-by":"crossref","unstructured":"Santos-Costa, V., Warren, D.H.D. and Yang, R., \u201cThe Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model,\u201d in Int. Conf. on Logic Programming, MIT Press, pp. 443-456, June 1991.","DOI":"10.1145\/109625.109635"},{"key":"39_CR42","doi-asserted-by":"crossref","unstructured":"Sekar, R., Venkatakrishnan, V.N., Basu, S., Bhatkar, S. and DuVarney, D., \u201cModel-carrying code: A practical approach for safe execution of untrusted applications,\u201d in Proc. of SOSP\u201903, ACM, pp. 15-28, 2003.","DOI":"10.1145\/945445.945448"},{"key":"39_CR43","doi-asserted-by":"crossref","unstructured":"Van Roy, P. and Despain, A.M., \u201cHigh-Performance Logic Programming with the Aquarius Prolog Compiler,\u201d IEEE Computer Magazine, pp. 54-68, January 1992.","DOI":"10.1109\/2.108055"},{"key":"39_CR44","doi-asserted-by":"crossref","unstructured":"Vaucheret, C. and Bueno, F., \u201cMore Precise yet Efficient Type Inference for Logic Programs,\u201d in Int. Static Analysis Symp., LNCS 2477, Springer-Verlag, pp. 102-116, September 2002.","DOI":"10.1007\/3-540-45789-5_10"},{"key":"39_CR45","doi-asserted-by":"crossref","unstructured":"Wildmoser, M. and Nipkow, T., \u201cCertifying Machine Code Safety: Shallow Versus Deep Embedding,\u201d in 17th Int. Conf. on Theorem Proving in Higher Order Logics, LNCS 3233, Springer, 2004.","DOI":"10.1007\/978-3-540-30142-4_22"},{"key":"39_CR46","doi-asserted-by":"crossref","unstructured":"Xia, S. and Hook, J., \u201cExperience with Abstraction Carrying Code,\u201d in Electronic Notes on Theo. Comp. Sci., 89, Elsevier, 2003.","DOI":"10.1016\/S1571-0661(05)80005-2"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0039-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-008-0039-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0039-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:36:27Z","timestamp":1684370187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-008-0039-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s00354-008-0039-7","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}