{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:46Z","timestamp":1725550126915},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292081"},{"type":"electronic","value":"9783540319474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11562931_22","type":"book-chapter","created":{"date-parts":[[2005,10,8]],"date-time":"2005-10-08T13:28:42Z","timestamp":1128778122000},"page":"280-296","source":"Crossref","is-referenced-by-count":9,"title":["Techniques for Scaling Up Analyses Based on Pre-interpretations"],"prefix":"10.1007","author":[{"given":"John P.","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Henriksen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gourinath","family":"Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","first-page":"351","volume-title":"Proc. of International Logic Programming Symposium","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, pp. 351\u2013365. MIT Press, Cambridge (1995)"},{"key":"22_CR2","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)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11506676_4","volume-title":"Logic Based Program Synthesis and Transformation","author":"S. Craig","year":"2005","unstructured":"Craig, S., Gallagher, J.P., Leuschel, M., Henriksen, K.S.: Fully automatic binding time analysis for Prolog. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol.\u00a03573, pp. 61\u201370. Springer, Heidelberg (2005)"},{"key":"22_CR4","doi-asserted-by":"crossref","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":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Hermenegildo, M., Penjam, J. (eds.) PLILP 1994. LNCS, vol.\u00a0844, pp. 432\u2013446. Springer, Heidelberg (1994)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-57186-8_72","volume-title":"Programming Language Implementation and Logic Programming","author":"M.M. Corsini","year":"1993","unstructured":"Corsini, M.M., Musumbu, K., Rauzy, A., Le Charlier, B.: Efficient bottom-up abstract interpretation of prolog by means of constraint solving over symbolic finite domains. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 75\u201391. Springer, Heidelberg (1993)"},{"key":"22_CR8","volume-title":"Proceedings of the 1993 International Symposium on Logic Programming","author":"M. Codish","year":"1993","unstructured":"Codish, M., Demoen, B.: Analysing logic programs using \u201cProp\u201d-ositional logic programs and a magic wand. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, Vancouver. MIT Press, Cambridge (1993)"},{"key":"22_CR9","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: Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"22_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1999), \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"22_CR11","volume-title":"Principles of Knowledge and Database Systems","author":"J. Ullman","year":"1988","unstructured":"Ullman, J.: Principles of Knowledge and Database Systems, vol.\u00a01. Computer Science Press, Rockville (1988)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Dawson, S., Ramakrishnan, C.R., Warren, D.S.: Practical program analysis using general purpose logic programming systems\u00d1a case study. In: Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, May 1996, pp. 17\u2013126 (1996)","DOI":"10.1145\/231379.231399"},{"key":"22_CR13","doi-asserted-by":"publisher","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)"},{"key":"22_CR14","unstructured":"Whaley, J., Unkel, C., Lam, M.S.: A bdd-based deductive database for program analysis (2004), \n                  \n                    http:\/\/bddbddb.sourceforge.net\/"},{"key":"22_CR15","unstructured":"Lind-Nielsen, J.: BuDDy, a binary decision diagram package (2004), \n                  \n                    http:\/\/sourceforge.net\/projects\/buddy"},{"key":"22_CR16","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45635-X_16","volume-title":"Logic Programming","author":"J.M. Howe","year":"2001","unstructured":"Howe, J.M., King, A.: Positive Boolean Functions as Multiheaded Clauses. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 120\u2013134. Springer, Heidelberg (2001)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Practical Aspects of Declarative Languages","author":"J.P. Gallagher","year":"2002","unstructured":"Gallagher, J.P., Puebla, G.: Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, p. 243. Springer, Heidelberg (2002)"},{"key":"22_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45653-8_48","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Genet","year":"2001","unstructured":"Genet, T., Tong, V.V.T.: Reachability analysis of term rewriting systems with Timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 695\u2013706. Springer, Heidelberg (2001)"},{"key":"22_CR20","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Bottom-up abstract interpretation of logic programs. In: Proceedings of the Fifth International Conference and Symposium on Logic Programming, Washington (1988)"},{"key":"22_CR21","unstructured":"Schachte, P.: Precise and Efficient Static Analysis of Logic Programs. PhD thesis, Dept. of Computer Science, The University of Melbourne, Australia (1999)"},{"key":"22_CR22","unstructured":"Banda, G.: Scalable real-time kernel for small embedded systems. Master\u2019s thesis, Southern Univ. of Denmark, S\u00f8nderborg (2003)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/BFb0054183","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W. Charatonik","year":"1998","unstructured":"Charatonik, W., Podelski, A.: Set-based analysis of reactive infinite-state systems. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, p. 358. Springer, Heidelberg (1998)"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/3-540-45591-4_134","volume-title":"Parallel and Distributed Processing","author":"J. Goubault-Larrecq","year":"2000","unstructured":"Goubault-Larrecq, J.: A method for automatic cryptographic protocol verification. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 977\u2013984. Springer, Heidelberg (2000)"},{"issue":"2-3","key":"22_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-6423(02)00132-6","volume":"47","author":"D. Monniaux","year":"2003","unstructured":"Monniaux, D.: Abstracting cryptographic protocols with tree automata. Sci. Comput. Program.\u00a047(2-3), 177\u2013202 (2003)","journal-title":"Sci. Comput. Program."},{"key":"22_CR26","unstructured":"Comon, H., Kozen, D., Seidl, H., Vardi, M.: Applications of Tree Automata in Rewriting, Logic and Programming. Schlo\u00df Dagstuhl Seminar 9743 (October 20-24, 1997), \n                  \n                    http:\/\/www.informatik.uni-trier.de\/~seidl\/Trees.html"},{"key":"22_CR27","unstructured":"Heintze, N.: Using bottom-up tree automaton to solve definite set constraints. Unpublished. Presentation at Schlo\u00df Dagstuhl Seminar 9743 (1997), \n                  \n                    http:\/\/www.informatik.uni-trier.de\/~seidl\/Trees.html"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/117009.117013","volume":"13","author":"J. B\u00f6rstler","year":"1991","unstructured":"B\u00f6rstler, J., M\u00f6ncke, U., Wilhelm, R.: Table compression for tree automata. ACM Trans. Program. Lang. Syst.\u00a013, 295\u2013314 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"22_CR29","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)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562931_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:21Z","timestamp":1619507661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562931_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292081","9783540319474"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11562931_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}