{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:38:31Z","timestamp":1725521911166},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787686"},{"type":"electronic","value":"9783540787693"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-78769-3_9","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T12:05:56Z","timestamp":1227701156000},"page":"121-137","source":"Crossref","is-referenced-by-count":2,"title":["A Scalable Inclusion Constraint Solver Using Unification"],"prefix":"10.1007","author":[{"given":"Ye","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A. Aiken","year":"1999","unstructured":"Aiken, A.: Introduction to set constraint-based program analysis. Sci. Comput. Program.\u00a035(2), 79\u2013111 (1999)","journal-title":"Sci. Comput. Program."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-40042-4_4","volume-title":"Global Computing. Programming Environments, Languages, Security, and Analysis of Systems","author":"L. Bettini","year":"2003","unstructured":"Bettini, L., Bono, V., Nicola, R.D., Ferrari, G.L., Gorla, D., Loreti, M., Moggi, E., Pugliese, R., Tuosto, E., Venneri, B.: The Klaim Project: Theory and Practice. In: Priami, C. (ed.) GC 2003. LNCS, vol.\u00a02874, pp. 88\u2013150. Springer, Heidelberg (2003)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.3233\/JCS-2005-13302","volume":"13","author":"C. Bodei","year":"2005","unstructured":"Bodei, C., Buchholtz, M., Degano, P., Nielson, F., Nielson, H.R.: Static validation of security protocols. Journal of Computer Security\u00a013(3), 347\u2013390 (2005)","journal-title":"Journal of Computer Security"},{"key":"9_CR4","unstructured":"Buchholtz, M., Nielson, H.R., Nielson, F.: Experiments with succinct solvers. Technical report, Informatics and Mathematical Modelling, Richard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby, Denmark (February 2002)"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/inco.2001.2952","volume":"179","author":"W. Charatonik","year":"2002","unstructured":"Charatonik, W., Podelski, A.: Set constraints with intersection. Inf. Comput.\u00a0179(2), 213\u2013229 (2002)","journal-title":"Inf. Comput."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47764-0_15","volume-title":"Static Analysis","author":"M. Das","year":"2001","unstructured":"Das, M., Liblit, B., F\u00e4hndrich, M., Rehof, J.: Estimating the Impact of Scalable Pointer Analysis on Optimization. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, Springer, Heidelberg (2001)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/BFb0032737","volume-title":"Static Analysis","author":"M. F\u00e4hndrich","year":"1997","unstructured":"F\u00e4hndrich, M., Aiken, A.: Program analysis using mixed term and set constraints. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 114\u2013126. Springer, Heidelberg (1997)"},{"issue":"4","key":"9_CR8","first-page":"304","volume":"5","author":"C. Fecht","year":"1998","unstructured":"Fecht, C., Seidl, H.: Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems. Nord. J. Comput.\u00a05(4), 304\u2013329 (1998)","journal-title":"Nord. J. Comput."},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-6423(99)00009-X","volume":"35","author":"C. Fecht","year":"1999","unstructured":"Fecht, C., Seidl, H.: A faster solver for general systems of equations. Sci. Comput. Program.\u00a035(2), 137\u2013161 (1999)","journal-title":"Sci. Comput. Program."},{"key":"9_CR10","unstructured":"Gao, H.: Using the Succinct Solver to implement flow logic specifications of classical data flow analysis. Master\u2019s thesis, Technical University of Denmark (2004)"},{"key":"9_CR11","first-page":"42","volume-title":"LICS","author":"N. Heintze","year":"1990","unstructured":"Heintze, N., Jaffar, J.: A decision procedure for a class of set constraints (extended abstract). In: LICS, pp. 42\u201351. IEEE Computer Society, Los Alamitos (1990)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Heintze, N., McAllester, D.A.: Linear-time subtransitive control flow analysis. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 261\u2013272 (1997)","DOI":"10.1145\/258915.258939"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Henglein, F.: Global tagging optimization by type inference. In: LISP and Functional Programming, pp. 205\u2013215 (1992)","DOI":"10.1145\/141471.141542"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11547662_16","volume-title":"Static Analysis","author":"J. Kodumal","year":"2005","unstructured":"Kodumal, J., Aiken, A.: Banshee: A scalable constraint-based analysis toolkit. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 218\u2013234. Springer, Heidelberg (2005)"},{"key":"9_CR15","unstructured":"Le Charlier, B., Van Hentenryck, P.: A universal top-down fixpoint algorithm. Technical Report CS-92-25, Brown University (1992)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Melski, D., Reps, T.W.: Interconveritibility of set constraints and context-free language reachability. In: PEPM, pp. 74\u201389 (1997)","DOI":"10.1145\/258994.259006"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. J. Comput. Syst. Sci.\u00a017(3), 348\u2013375 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.L.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"issue":"4","key":"9_CR19","first-page":"335","volume":"9","author":"F. Nielson","year":"2002","unstructured":"Nielson, F., Seidl, H., Nielson, H.R.: A succinct solver for ALFP. Nord. J. Comput.\u00a09(4), 335\u2013372 (2002)","journal-title":"Nord. J. Comput."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24631-2_6","volume-title":"Foundations of Security Analysis and Design II","author":"H.R. Nielson","year":"2004","unstructured":"Nielson, H.R., Nielson, F., Buchholtz, M.: Security for mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2001. LNCS, vol.\u00a02946, pp. 207\u2013265. Springer, Heidelberg (2004)"},{"key":"9_CR21","unstructured":"Pilegaard, H.: A feasibility study: The Succinct Solver v2.0, XSB prolog v2.6, and flow-logic based program analysis for carmel. Technical Report SECSAFE-IMM-008-1.0, Technical University of Denmark (2003)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: POPL, pp. 32\u201341 (1996)","DOI":"10.1145\/237721.237727"},{"key":"9_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms, volume CMBS44 of Regional Conference Series in Applied Mathematics","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms, volume CMBS44 of Regional Conference Series in Applied Mathematics. SIAM (1983)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11575467_8","volume-title":"Programming Languages and Systems","author":"J. Whaley","year":"2005","unstructured":"Whaley, J., Avots, D., Carbin, M., Lam, M.S.: Using datalog with binary decision diagrams for program analysis. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 97\u2013118. Springer, Heidelberg (2005)"},{"key":"9_CR25","unstructured":"Zhang, Y.: Static analysis for protocol validation in hierarchical networks. Master\u2019s thesis, Technical University of Denmark (2005)"}],"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\/978-3-540-78769-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:45:09Z","timestamp":1557945909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78769-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540787686","9783540787693"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78769-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}