{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:42:32Z","timestamp":1725864152941},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534120"},{"type":"electronic","value":"9783662534137"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53413-7_22","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T07:57:11Z","timestamp":1472543831000},"page":"447-468","source":"Crossref","is-referenced-by-count":2,"title":["Enforcing Termination of Interprocedural Analysis"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Schulze Frielinghaus","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-60360-3_31","volume-title":"Static Analysis","author":"M Alt","year":"1995","unstructured":"Alt, M., Martin, F.: Generation of efficient interprocedural analyzers with PAG. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol. 983, pp. 33\u201350. Springer, Heidelberg (1995)"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.scico.2015.12.005","volume":"120","author":"G Amato","year":"2016","unstructured":"Amato, G., Scozzari, F., Seidl, H., Apinis, K., Vojdani, V.: Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120, 1\u201324 (2016)","journal-title":"Sci. Comput. Program."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-642-35182-2_12","volume-title":"Programming Languages and Systems","author":"K Apinis","year":"2012","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Side-effecting constraint systems: a swiss army knife for program analysis. In: Igarashi, A., Jhala, R. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 157\u2013172. Springer, Heidelberg (2012)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: How to combine widening and narrowing for non-monotonic systems of equations. In: 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 377\u2013386. ACM (2013)","DOI":"10.1145\/2491956.2462190"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-27810-0_14","volume-title":"Semantics, Logics, and Calculi","author":"K Apinis","year":"2016","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Enhancing top-down solving with widening and narrowing. In: Probst, C.W., Hankin, C., Hansen, R.R. (eds.) Nielsons\u2019 Festschrift. LNCS, vol. 9560, pp. 272\u2013288. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-27810-0_14"},{"issue":"1\u20132","key":"22_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.scico.2005.02.003","volume":"58","author":"R Bagnara","year":"2005","unstructured":"Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. Sci. Comput. Program. 58(1\u20132), 28\u201356 (2005)","journal-title":"Sci. Comput. Program."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Formal Methods in Programming and Their Applications","author":"F Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Bj\u00f8rner, D., Broy, M., Pottosin, I.V. (eds.) Formal Methods in Programming and Their Applications. LNCS, vol. 735, pp. 128\u2013141. Springer, Heidelberg (1993)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","first-page":"112","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L Chen","year":"2010","unstructured":"Chen, L., Min\u00e9, A., Wang, J., Cousot, P.: An abstract domain to discover interval linear equalities. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 112\u2013128. Springer, Heidelberg (2010)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-662-46081-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Cousot","year":"2015","unstructured":"Cousot, P.: Abstracting induction by extrapolation and interpolation. In: D\u2019Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 19\u201342. Springer, Heidelberg (2015)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysisof programs by construction or approximation of fixpoints. In: Fourth ACM Symposium on Principles of Programming Languages (POPL), pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of generalized type unions. In: ACM Conference on Language Design for Reliable Software (LDRS), pp. 77\u201394. ACM (1977)","DOI":"10.1145\/800022.808314"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: IFIP Conference on Formal Description of Programming Concepts, pp. 237\u2013277, North-Holland (1977)","DOI":"10.1145\/800022.808314"},{"issue":"4","key":"22_CR13","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Log. Comput. 2(4), 511\u2013547 (1992)","journal-title":"J. Log. Comput."},{"issue":"3","key":"22_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10703-009-0089-6","volume":"35","author":"P Cousot","year":"2009","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Why does Astr\u00e9e scale up? Formal Methods Syst. Design 35(3), 229\u2013264 (2009)","journal-title":"Formal Methods Syst. Design"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","author":"C Fecht","year":"1996","unstructured":"Fecht, C., Seidl, H.: An even faster solver for general systems of equations. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145. Springer, Heidelberg (1996)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/11823230_10","volume-title":"Static Analysis","author":"L Gonnord","year":"2006","unstructured":"Gonnord, L., Halbwachs, N.: Combining widening and acceleration in linear relation analysis. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 144\u2013160. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"22_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S1471068411000457","volume":"12","author":"MV Hermenegildo","year":"2012","unstructured":"Hermenegildo, M.V., Bueno, F., Carro, M., L\u00f3pez-Garc\u00eda, P., Mera, E., Morales, J.F., Puebla, G.: An overview of Ciao and its design philosophy. Theor. Pract. Log. Program. 12(1\u20132), 219\u2013252 (2012)","journal-title":"Theor. Pract. Log. Program."},{"issue":"1\u20132","key":"22_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"MV Hermenegildo","year":"2005","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). Sci. Comput. Program. 58(1\u20132), 115\u2013140 (2005)","journal-title":"Sci. Comput. Program."},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-642-15769-1_21","volume-title":"Static Analysis","author":"M Hofmann","year":"2010","unstructured":"Hofmann, M., Karbyshev, A., Seidl, H.: Verifying a local generic solver in Coq. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 340\u2013355. Springer, Heidelberg (2010)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-642-14162-1_17","volume-title":"Automata, Languages and Programming","author":"M Hofmann","year":"2010","unstructured":"Hofmann, M., Karbyshev, A., Seidl, H.: What is a pure functional? In: Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G., Abramsky, S. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 199\u2013210. Springer, Heidelberg (2010)"},{"key":"22_CR21","unstructured":"Karbyshev, A.: Monadic Parametricity of Second-Order Functionals. Ph.D. thesis, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, September 2013"},{"issue":"3","key":"22_CR22","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1090\/S0002-9947-1937-1501929-X","volume":"42","author":"HM MacNeille","year":"1937","unstructured":"MacNeille, H.M.: Partially ordered sets. Trans. Amer. Math. Soc. 42(3), 416\u2013460 (1937)","journal-title":"Trans. Amer. Math. Soc."},{"key":"22_CR23","unstructured":"Muthukumar, K., Hermenegildo, M.V.: Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs. Technical report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, April 1990"},{"key":"22_CR24","unstructured":"Schulze Frielinghaus, S., Seidl, H., Vogler, R.: Enforcing termination of interprocedural analysis. arXiv e-prints (2016). http:\/\/arxiv.org\/abs\/1606.07687"},{"issue":"2","key":"22_CR25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0743-1066(99)00058-8","volume":"43","author":"H Seidl","year":"2000","unstructured":"Seidl, H., Fecht, C.: Interprocedural analyses: a comparison. J. Logic Program. 43(2), 123\u2013156 (2000)","journal-title":"J. Logic Program."},{"key":"22_CR26","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis.In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Application, pp. 189\u2013233. Prentice-Hall (1981)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53413-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T22:20:26Z","timestamp":1568326826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53413-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534120","9783662534137"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53413-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}