乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:54:24Z","timestamp":1725544464209},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540326540"},{"type":"electronic","value":"9783540326564"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11680093_10","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T06:43:40Z","timestamp":1141109020000},"page":"147-162","source":"Crossref","is-referenced-by-count":0,"title":["Converting One Type-Based Abstract Domain to Another"],"prefix":"10.1007","author":[{"given":"John P.","family":"Gallagher","sequence":"first","affiliation":[]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Elvira","family":"Albert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/567752.567778","volume-title":"Conference Record of the 6th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Conference Record of the 6th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio,Texas, pp. 269\u2013282. ACM Press, New York (1979)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M.V., 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\u20132) (2005)","DOI":"10.1016\/j.scico.2005.02.006"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-27775-0_3","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2004","unstructured":"Gallagher, J.P., Henriksen, K.S.: Abstract domains based on regular types. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 27\u201342. Springer, Heidelberg (2004)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/234528.234742","volume":"28","author":"G. Fil\u00e8","year":"1996","unstructured":"Fil\u00e8, G., Giacobazzi, R., Ranzato, F.: A unifying view on abstract domain design. ACM Computing Surveys\u00a028(2), 333\u2013336 (1996)","journal-title":"ACM Computing Surveys"},{"key":"10_CR5","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, S. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 21\u201330. Springer, Heidelberg (2005)"},{"key":"10_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1999), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","first-page":"61","volume-title":"Logic Based Program Synthesis and Transformation","author":"S. Craig","year":"2004","unstructured":"Craig, S., Gallagher, J.P., Leuschel, M., Henriksen, K.S.: Fully automatic binding time analysis for Prolog. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol.\u00a03018, pp. 61\u201370. Springer, Heidelberg (2004)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-58402-1_30","volume-title":"Programming Language Implementation and Logic Programming","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M., Denecker, M.: Abstracting s-semantics using a model-theoretic approach. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 432\u2013446. Springer, Heidelberg (1994)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-58485-4_33","volume-title":"Static Analysis","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M.: A systematic construction of abstract domains. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 61\u201377. Springer, Heidelberg (1994)"},{"key":"10_CR11","first-page":"351","volume-title":"Proc. of International Logic Programming Symposium, MIT Press","author":"J.P. Gallagher","year":"1995","unstructured":"Gallagher, J.P., Boulanger, D., Sa\u011flam, H.: Practical model-based static analysis for definite logic programs. In: Lloyd, J.W. (ed.) Proc. of International Logic Programming Symposium, MIT Press, pp. 351\u2013365. MIT Press, Cambridge (1995)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11562931_22","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2005","unstructured":"Gallagher, J.P., Henriksen, K.S., Banda, G.: Techniques for scaling up analyses based on pre-interpretations. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 280\u2013296. Springer, Heidelberg (2005)"},{"issue":"1-4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Precise and efficient groundness analysis for logic programs. LOPLAS\u00a02(1-4), 181\u2013196 (1993)","journal-title":"LOPLAS"},{"key":"10_CR14","first-page":"467","volume-title":"ICDE","author":"M. Iwaihara","year":"1995","unstructured":"Iwaihara, M., Inoue, Y.: Bottom-up evaluation of logic programs using binary decision diagrams. In: Yu, P.S., Chen, A.L.P. (eds.) ICDE, pp. 467\u2013474. IEEE Computer Society, Los Alamitos (1995)"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/996841.996859","volume-title":"PLDI","author":"J. Whaley","year":"2004","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: Pugh, W., Chambers, C. (eds.) PLDI, pp. 131\u2013144. ACM, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11680093_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T16:31:07Z","timestamp":1683390667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11680093_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540326540","9783540326564"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11680093_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}