{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:26:20Z","timestamp":1740108380703,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,1,4]],"date-time":"2017-01-04T00:00:00Z","timestamp":1483488000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00236-016-0291-0","type":"journal-article","created":{"date-parts":[[2017,1,4]],"date-time":"2017-01-04T08:51:34Z","timestamp":1483519894000},"page":"521-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Descending chains and narrowing on template abstract domains"],"prefix":"10.1007","volume":"55","author":[{"given":"Gianluca","family":"Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Di Nardo Di Maio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Chiara","family":"Meo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2105-4855","authenticated-orcid":false,"given":"Francesca","family":"Scozzari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,4]]},"reference":[{"key":"291_CR1","volume-title":"Compilers: Principles, Techniques and Tools","author":"AV Aho","year":"2006","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.: Compilers: Principles, Techniques and Tools, 2nd edn. Addison Wesley, Boston (2006)","edition":"2"},{"key":"291_CR2","doi-asserted-by":"publisher","unstructured":"Amato, G., Di Nardo Di Maio, S., Meo, M.C., Scozzari, F.: Narrowing operators on template abstract domains. In: Bj\u00f8ner, N., de Boer, F. (eds.) Proceedings of the 20th International Symposium on FM 2015: Formal Methods, Oslo, Norway, June 24\u201326, 2015, Lecture Notes in Computer Science, vol. 9109, pp. 57\u201372. Springer, Berlin (2015). doi:\n                        10.1007\/978-3-319-19249-9_5","DOI":"10.1007\/978-3-319-19249-9_5"},{"issue":"12","key":"291_CR3","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/j.jsc.2011.12.052","volume":"47","author":"G Amato","year":"2012","unstructured":"Amato, G., Parton, M., Scozzari, F.: Discovering invariants via simple component analysis. J. Symb. Comput. 47(12), 1533\u20131560 (2012). doi:\n                        10.1016\/j.jsc.2011.12.052","journal-title":"J. Symb. Comput."},{"key":"291_CR4","doi-asserted-by":"publisher","unstructured":"Amato, G., Scozzari, F.: The abstract domain of parallelotopes. In: Midtgaard, J., Might, M. (eds.) Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2012), Electronic Notes in Theoretical Computer Science, vol. 287, pp. 17\u201328. Elsevier, Amsterdam (2012). doi:\n                        10.1016\/j.entcs.2012.09.003","DOI":"10.1016\/j.entcs.2012.09.003"},{"key":"291_CR5","doi-asserted-by":"publisher","unstructured":"Amato, G., Scozzari, F.: Localizing widening and narrowing. In: Logozzo, F., F\u00e4hndrich, M. (eds.) In: Proceedings of the 20th International Symposium on Static Analysis (SAS 2013), Seattle, WA, USA, June 20\u201322, 2013, Lecture Notes in Computer Science, vol. 7935, pp. 25\u201342. Springer, Berlin (2013). doi:\n                        10.1007\/978-3-642-38856-9_4","DOI":"10.1007\/978-3-642-38856-9_4"},{"key":"291_CR6","doi-asserted-by":"publisher","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). doi:\n                        10.1016\/j.scico.2015.12.005","journal-title":"Sci. Comput. Program."},{"key":"291_CR7","doi-asserted-by":"publisher","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: How to combine widening and narrowing for non-monotonic systems of equations. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201913), pp. 377\u2013386. ACM, New York (2013). doi:\n                        10.1145\/2491956.2462190","DOI":"10.1145\/2491956.2462190"},{"key":"291_CR8","doi-asserted-by":"publisher","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Bj\u00f8rner, D., Broy, M., Pottosin, I.V. (eds.) Proceedings of the Formal Methods in Programming and Their Applications, International Conference Academgorodok, Novosibirsk, Russia June 28\u2013July 2, 1993, Lecture Notes in Computer Science, vol. 735, pp. 128\u2013141. Springer, Berlin (1993). doi:\n                        10.1007\/BFb0039704","DOI":"10.1007\/BFb0039704"},{"key":"291_CR9","doi-asserted-by":"publisher","unstructured":"Costan, A., Gaubert, S., Goubault, E., Martel, M., Putot, S.: A policy iteration algorithm for computing fixed points in static analysis of programs. In: Etessami, K., Rajamani, S.K. (eds.) Proceedings of the 17th International Conference on Computer Aided Verification (CAV 2005), Edinburgh, Scotland, UK, July 6\u201310, 2005, Lecture Notes in Computer Science, vol. 3576, pp. 462\u2013475. Springer, Berlin (2005). doi:\n                        10.1007\/11513988_46","DOI":"10.1007\/11513988_46"},{"key":"291_CR10","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the Second International Symposium on Programming, pp. 106\u2013130. Dunod, Paris (1976)"},{"key":"291_CR11","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL \u201977: Proceedings of the 4th ACM SIGACT\u2013SIGPLAN symposium on Principles of programming languages, pp. 238\u2013252. ACM Press, New York (1977). doi:\n                        10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"291_CR12","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL \u201979: Proceedings of the 6th ACM SIGACT\u2013SIGPLAN Symposium on Principles of Programming Languages, pp. 269\u2013282. ACM Press, New York (1979). doi:\n                        10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"key":"291_CR13","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming (PLILP\u201992), Leuven, Belgium, August 26\u201328, 1992, Lecture Notes in Computer Science, vol. 631, pp. 269\u2013295. Springer, Berlin (1992). doi:\n                        10.1007\/3-540-55844-6_101\n                        \n                    . Invited paper","DOI":"10.1007\/3-540-55844-6_101"},{"key":"291_CR14","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL \u201978: Proceedings of the 5th ACM SIGACT\u2013SIGPLAN Symposium on Principles of Programming Languages, pp. 84\u201397. ACM Press, New York (1978). doi:\n                        10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"291_CR15","doi-asserted-by":"publisher","unstructured":"Gawlitza, T.M., Monniaux, D.: Invariant generation through strategy iteration in succinctly represented control flow graphs. Log. Methods Comput. Sci. (2012). doi:\n                        10.2168\/LMCS-8(3:29)2012","DOI":"10.2168\/LMCS-8(3:29)2012"},{"issue":"3","key":"291_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961204.1961207","volume":"33","author":"TM Gawlitza","year":"2011","unstructured":"Gawlitza, T.M., Seidl, H.: Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33(3), 1\u201348 (2011). doi:\n                        10.1145\/1961204.1961207","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"291_CR17","doi-asserted-by":"publisher","unstructured":"Gonnord, L., Halbwachs, N.: Combining widening and acceleration in linear relation analysis. In: Yi, K. (ed.) Proceedings of the 13th International Symposium on Static Analysis (SAS 2006), Seoul, August 29\u201331, 2006, Lecture Notes in Computer Science, vol. 4134, pp. 144\u2013160. Springer, Berlin (2006). doi:\n                        10.1007\/11823230_10","DOI":"10.1007\/11823230_10"},{"key":"291_CR18","doi-asserted-by":"publisher","unstructured":"Halbwachs, N., Henry, J.: When the decreasing sequence fails. In: Min\u00e9, A., Schmidt, D. (eds.) Proceedings of the 19th International Symposium on Static Analysis (SAS 2012), Deauville, September 11\u201313, 2012, Lecture Notes in Computer Science, vol. 7460, pp. 198\u2013213. Springer, Berlin (2012). doi:\n                        10.1007\/978-3-642-33125-1_15","DOI":"10.1007\/978-3-642-33125-1_15"},{"issue":"1","key":"291_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. High-Order Symb. Comput. 19(1), 31\u2013100 (2006). doi:\n                        10.1007\/s10990-006-8609-1","journal-title":"High-Order Symb. Comput."},{"key":"291_CR20","doi-asserted-by":"publisher","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2005), Paris, January 17\u201319, 2005, Lecture Notes in Computer Science, vol. 3385, pp. 25\u201341. Springer, Berlin (2005). doi:\n                        10.1007\/b105073","DOI":"10.1007\/b105073"},{"key":"291_CR21","doi-asserted-by":"publisher","unstructured":"Simon, A., King, A., Howe, J.M.: Two variables per linear inequality as an abstract domain. In: Leuschel, M. (ed.) Logic Based Program Synthesis and Transformation 12th International Workshop (LOPSTR 2002), Madrid, Spain, September 17\u201320, 2002. Revised Selected Papers, Lecture Notes in Computer Science, vol. 2664, pp. 71\u201389. Springer, Berlin (2003). doi:\n                        10.1007\/3-540-45013-0_7","DOI":"10.1007\/3-540-45013-0_7"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-016-0291-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0291-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0291-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T11:57:51Z","timestamp":1533124671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-016-0291-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,4]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["291"],"URL":"https:\/\/doi.org\/10.1007\/s00236-016-0291-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2017,1,4]]}}}