{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:28:42Z","timestamp":1715646522356},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T00:00:00Z","timestamp":1710374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T00:00:00Z","timestamp":1710374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10270-024-01161-5","type":"journal-article","created":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T08:45:39Z","timestamp":1710405939000},"page":"319-342","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A lightweight approach to nontermination inference using Constrained Horn Clauses"],"prefix":"10.1007","volume":"23","author":[{"given":"Bishoksan","family":"Kafle","sequence":"first","affiliation":[]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,14]]},"reference":[{"key":"1161_CR1","doi-asserted-by":"publisher","unstructured":"Gupta, A., Henzinger, T.A., Majumdar, R., Rybalchenko, A., Xu, R.: Proving non-termination. In: Necula, G.C., Wadler, P. (eds.) Proc. 35th ACM Symp. Principles of Programming Languages, pp. 147\u2013158. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1328438.1328459","DOI":"10.1145\/1328438.1328459"},{"key":"1161_CR2","doi-asserted-by":"publisher","unstructured":"Chen, H.Y., Cook, B., Fuhs, C., Nimkar, K., O\u2019Hearn, P.W.: Proving nontermination via safety. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 8413, pp. 156\u2013171. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_11","DOI":"10.1007\/978-3-642-54862-8_11"},{"issue":"2 &3","key":"1161_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Logic Progr. 13(2 &3), 103\u2013179 (1992). https:\/\/doi.org\/10.1016\/0743-1066(92)90030-7","journal-title":"J. Logic Progr."},{"key":"1161_CR4","unstructured":"Cousot, P.: Principles of abstract interpretation. MIT Press, Cambridge MA (2021)"},{"key":"1161_CR5","doi-asserted-by":"publisher","unstructured":"Borralleras, C., Brockschmidt, M., Larraz, D., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Proving termination through conditional termination. In: Legay, A., Margaria, T. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 10205, pp. 99\u2013117. Springer, Berlin Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_6","DOI":"10.1007\/978-3-662-54577-5_6"},{"key":"1161_CR6","doi-asserted-by":"publisher","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Termination analysis by learning terminating programs. In: Biere, A., Bloem, R. (eds.) Computer-Aided Verification. LNCS, vol. 8559, pp. 797\u2013813. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_53","DOI":"10.1007\/978-3-319-08867-9_53"},{"issue":"4","key":"1161_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629488","volume":"61","author":"AM Ben-Amram","year":"2014","unstructured":"Ben-Amram, A.M., Genaim, S.: Ranking functions for linear-constraint loops. J. ACM 61(4), 1\u201355 (2014). https:\/\/doi.org\/10.1145\/2629488","journal-title":"J. ACM"},{"key":"1161_CR8","doi-asserted-by":"publisher","unstructured":"Giesl, J., et al: Proving termination of programs automatically with AProVE. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) Automated Reasoning. LNCS, vol. 8562, pp. 184\u2013191. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_13","DOI":"10.1007\/978-3-319-08587-6_13"},{"key":"1161_CR9","doi-asserted-by":"publisher","unstructured":"Howe, J.M., King, A., Lu, L.: Analysing logic programs by reasoning backwards. In: Bruynooghe, M., Lau, K. (eds.) Program Development in Computational Logic. LNCS, vol. 3049, pp. 152\u2013188. Springer, Berlin Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25951-0_6","DOI":"10.1007\/978-3-540-25951-0_6"},{"key":"1161_CR10","doi-asserted-by":"publisher","unstructured":"Moy, Y.: Sufficient preconditions for modular assertion checking. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) Verification, Model Checking and Abstract Interpretation. LNCS, vol. 4905, pp. 188\u2013202. Springer, Berlin Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78163-9_18","DOI":"10.1007\/978-3-540-78163-9_18"},{"key":"1161_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.entcs.2012.09.009","volume":"287","author":"A Min\u00e9","year":"2012","unstructured":"Min\u00e9, A.: Inferring sufficient conditions with backward polyhedral under-approximations. Electron. Notes Theoret. Comput. Sci. 287, 89\u2013100 (2012). https:\/\/doi.org\/10.1016\/j.entcs.2012.09.009","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"1161_CR12","doi-asserted-by":"publisher","unstructured":"Bakhirkin, A., Berdine, J., Piterman, N.: Backward analysis via over-approximate abstraction and under-approximate subtraction of Horn clauses. In: M\u00fcller-Olm, M., Seidl, H. (eds.) Static Analysis. LNCS, vol. 8723, pp. 34\u201350. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_3","DOI":"10.1007\/978-3-319-10936-7_3"},{"key":"1161_CR13","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1017\/S1471068418000091","volume":"18","author":"B Kafle","year":"2018","unstructured":"Kafle, B., Gallagher, J.P., Gange, G., Schachte, P., S\u00f8ndergaard, H., Stuckey, P.J.: An iterative approach to precondition inference using constrained Horn clauses. Theory Pract. Logic Progr. 18, 553\u2013570 (2018). https:\/\/doi.org\/10.1017\/S1471068418000091","journal-title":"Theory Pract. Logic Progr."},{"key":"1161_CR14","doi-asserted-by":"publisher","unstructured":"Le, T.C., Qin, S., Chin, W.-N.: Termination and non-termination specification inference. In: Grove, D., Blackburn, S.M. (eds.) Proc. 36th ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 489\u2013498. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2737924.2737993","DOI":"10.1145\/2737924.2737993"},{"key":"1161_CR15","doi-asserted-by":"publisher","unstructured":"Kafle, B., Gange, G., Schachte, P., S\u00f8ndergaard, H., Stuckey, P.J.: Lightweight nontermination inference with CHCs. In: Calinescu, R., P\u0103s\u0103reanu, C.S. (eds.) Software Engineering and Formal Methods. LNCS, vol. 13085, pp. 383\u2013402. Springer, Switzerland (2021). https:\/\/doi.org\/10.1007\/978-3-030-92124-8_22","DOI":"10.1007\/978-3-030-92124-8_22"},{"key":"1161_CR16","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Goharshady, E.K., Novotn\u00fd, P., \u017dikeli\u0107, D.: Proving non-termination by program reversal. In: Freund, S.N., Yahav, E. (eds.) Proc. 42nd ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 1033\u20131048. ACM, New York (2021). https:\/\/doi.org\/10.1145\/3453483.3454093","DOI":"10.1145\/3453483.3454093"},{"key":"1161_CR17","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R., F\u00e4hndrich, M., Logozzo, F.: Automatic inference of necessary preconditions. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) Verification, Model Checking and Abstract Interpretation. LNCS, vol. 7737, pp. 128\u2013148. Springer, Berlin Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35873-9_10","DOI":"10.1007\/978-3-642-35873-9_10"},{"key":"1161_CR18","unstructured":"Bakhirkin, A.: Recurrent sets for non-termination and safety of programs. PhD thesis, University of Leicester (2016)"},{"key":"1161_CR19","doi-asserted-by":"publisher","unstructured":"Bakhirkin, A., Monniaux, D.: Combining forward and backward abstract interpretation of Horn clauses. In: Ranzato, F. (ed.) Static Analysis. LNCS, vol. 10422, pp. 23\u201345. Springer, Berlin Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_2","DOI":"10.1007\/978-3-319-66706-5_2"},{"key":"1161_CR20","doi-asserted-by":"publisher","unstructured":"Seghir, M.N., Schrammel, P.: Necessary and sufficient preconditions via eager abstraction. In: Garrigue, J. (ed.) Proc. 12th Asian Symp. Programming Languages and Systems. LNCS, vol. 8858, pp. 236\u2013254. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-12736-1_13","DOI":"10.1007\/978-3-319-12736-1_13"},{"issue":"6","key":"1161_CR21","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1017\/S1471068421000272","volume":"21","author":"B Kafle","year":"2021","unstructured":"Kafle, B., Gange, G., Stuckey, P.J., Schachte, P., S\u00f8ndergaard, H.: Transformation-enabled precondition inference. Theory Pract. Logic Progr. 21(6), 700\u2013716 (2021). https:\/\/doi.org\/10.1017\/S1471068421000272","journal-title":"Theory Pract. Logic Progr."},{"issue":"5\u20136","key":"1161_CR22","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1017\/S1471068419000310","volume":"19","author":"JJ Dom\u00e9nech","year":"2019","unstructured":"Dom\u00e9nech, J.J., Gallagher, J.P., Genaim, S.: Control-flow refinement by partial evaluation, and its application to termination and cost analysis. Theory Pract. Logic Progr. 19(5\u20136), 990\u20131005 (2019). https:\/\/doi.org\/10.1017\/S1471068419000310","journal-title":"Theory Pract. Logic Progr."},{"key":"1161_CR23","doi-asserted-by":"publisher","unstructured":"Gallagher, J.P.: Polyvariant program specialisation with property-based abstraction. In: Lisitsa, A., Nemytykh, A.P. (eds.) Proc. Seventh Int. Workshop on Verification and Program Transformation. EPTCS, vol. 299, pp. 34\u201348 (2019). https:\/\/doi.org\/10.4204\/EPTCS.299.6","DOI":"10.4204\/EPTCS.299.6"},{"key":"1161_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.scico.2017.01.002","volume":"137","author":"B Kafle","year":"2017","unstructured":"Kafle, B., Gallagher, J.P.: Constraint specialisation in Horn clause verification. Sci. Comput. Progr. 137, 125\u2013140 (2017). https:\/\/doi.org\/10.1016\/j.scico.2017.01.002","journal-title":"Sci. Comput. Progr."},{"key":"1161_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.scico.2014.05.017","volume":"95","author":"E De Angelis","year":"2014","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: Program verification via iterated specialization. Sci. Comput. Progr. 95, 149\u2013175 (2014). https:\/\/doi.org\/10.1016\/j.scico.2014.05.017","journal-title":"Sci. Comput. Progr."},{"key":"1161_CR26","doi-asserted-by":"publisher","unstructured":"Peralta, J.C., Gallagher, J.P., Sa\u011flam, H.: Analysis of imperative programs through analysis of constraint logic programs. In: Levi, G. (ed.) Static Analysis. LNCS, vol. 1503, pp. 246\u2013261. Springer, Berlin Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_15","DOI":"10.1007\/3-540-49727-7_15"},{"key":"1161_CR27","doi-asserted-by":"publisher","unstructured":"M\u00e9ndez-Lojo, M., Navas, J.A., Hermenegildo, M.V.: A flexible, (C)LP-based approach to the analysis of object-oriented programs. In: King, A. (ed.) Logic-Based Program Synthesis and Transformation. LNCS, vol. 4915, pp. 154\u2013168. Springer, Berlin Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-78769-3_11","DOI":"10.1007\/978-3-540-78769-3_11"},{"issue":"10","key":"1161_CR28","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1016\/j.infsof.2009.04.010","volume":"51","author":"M G\u00f3mez-Zamalloa","year":"2009","unstructured":"G\u00f3mez-Zamalloa, M., Albert, E., Puebla, G.: Decompilation of Java bytecode to Prolog by partial evaluation. Inform. Softw. Technol. 51(10), 1409\u20131427 (2009). https:\/\/doi.org\/10.1016\/j.infsof.2009.04.010","journal-title":"Inform. Softw. Technol."},{"key":"1161_CR29","doi-asserted-by":"publisher","unstructured":"Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: Vitek, J., Lin, H., Tip, F. (eds.) Proc. 33rd ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 405\u2013416. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2254064.2254112","DOI":"10.1145\/2254064.2254112"},{"key":"1161_CR30","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.scico.2016.11.002","volume":"147","author":"E De Angelis","year":"2017","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: Semantics-based generation of verification conditions via program specialization. Sci. Comput. Progr. 147, 78\u2013108 (2017). https:\/\/doi.org\/10.1016\/j.scico.2016.11.002","journal-title":"Sci. Comput. Progr."},{"key":"1161_CR31","doi-asserted-by":"publisher","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The SeaHorn verification framework. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) Computer-Aided Verification. LNCS, vol. 9206, pp. 343\u2013361. Springer, Berlin Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_20","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"1161_CR32","doi-asserted-by":"publisher","unstructured":"Perez-Carrasco, V., Klemen, M., L\u00f3pez-Garc\u00eda, P., Morales, J.F., Hermenegildo, M.V.: Cost analysis of smart contracts via parametric resource analysis. In: Pichardie, D., Sighireanu, M. (eds.) Static Analysis. LNCS, vol. 12389, pp. 7\u201331. Springer, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-65474-0_2","DOI":"10.1007\/978-3-030-65474-0_2"},{"key":"1161_CR33","doi-asserted-by":"publisher","unstructured":"Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis and transformation. In: Proc. Int. Symp. Code Generation and Optimization, pp. 75\u201386. IEEE Comp. Soc., Piscataway NJ (2004). https:\/\/doi.org\/10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"key":"1161_CR34","doi-asserted-by":"publisher","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge UK (2003). https:\/\/doi.org\/10.1017\/CBO9780511615320","DOI":"10.1017\/CBO9780511615320"},{"key":"1161_CR35","doi-asserted-by":"crossref","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge MA (1998)","DOI":"10.7551\/mitpress\/5625.001.0001"},{"issue":"20","key":"1161_CR36","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. J. Logic Progr. 19(20), 503\u2013581 (1994). https:\/\/doi.org\/10.1016\/0743-1066(94)90033-7","journal-title":"J. Logic Progr."},{"issue":"6","key":"1161_CR37","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1017\/S1471068421000211","volume":"22","author":"E De Angelis","year":"2022","unstructured":"De Angelis, E., Fioravanti, F., Gallagher, J.P., Hermenegildo, M.V., Pettorossi, A., Proietti, M.: Analysis and transformation of constrained Horn clauses for program verification. Theory Pract. Logic Progr. 22(6), 974\u20131042 (2022). https:\/\/doi.org\/10.1017\/S1471068421000211","journal-title":"Theory Pract. Logic Progr."},{"key":"1161_CR38","doi-asserted-by":"crossref","unstructured":"Hehner, E.: A Practical Theory of Programming. Springer, New York NY (1993)","DOI":"10.1007\/978-1-4419-8596-5"},{"key":"1161_CR39","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: Proc. Fourth ACM Symp. Principles of Programming Languages, pp. 238\u2013252. ACM, New York (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"1161_CR40","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.) Programming Language Implementation and Logic Programming. LNCS, vol. 631, pp. 269\u2013295. Springer, Berlin Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55844-6_142","DOI":"10.1007\/3-540-55844-6_142"},{"key":"1161_CR41","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Aho, A.V., Zilles, S.N., Szymanski, T.G. (eds.) Proc. Fifth ACM Symp. Principles of Programming Languages, pp. 84\u201396. ACM, New York (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"1161_CR42","doi-asserted-by":"publisher","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic sets and other strange ways to implement logic programs. In: Silberschatz, A. (ed.) Proc. Fifth ACM SIGMOD-SIGACT Symp. Principles of Database Systems, pp. 1\u201315. ACM, New York (1986). https:\/\/doi.org\/10.1145\/6012.15399","DOI":"10.1145\/6012.15399"},{"key":"1161_CR43","doi-asserted-by":"publisher","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Specialization with clause splitting for deriving deterministic constraint logic programs. In: Proceedings of the IEEE conference Systems, Man and Cybernetics. IEEE, Piscataway NJ (2002). https:\/\/doi.org\/10.1109\/ICSMC.2002.1167971","DOI":"10.1109\/ICSMC.2002.1167971"},{"key":"1161_CR44","doi-asserted-by":"publisher","unstructured":"Gallagher, J.P.: Tutorial on specialisation of logic programs. In: Schmidt, D. (ed.) PEPM\u201993: Proc. 1993 ACM SIGPLAN Symp. Partial Evaluation and Semantics-Based Program Manipulation, pp. 88\u201398. ACM, New York (1993). https:\/\/doi.org\/10.1145\/154630.154640","DOI":"10.1145\/154630.154640"},{"key":"1161_CR45","doi-asserted-by":"publisher","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) Verification, Model Checking and Abstract Interpretation. LNCS, vol. 2937, pp. 239\u2013251. Springer, Berlin Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_20","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"1161_CR46","doi-asserted-by":"publisher","unstructured":"Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes. In: Rosenkrantz, D.J. (ed.) Proc. Tenth ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 216\u2013226. ACM, New York (1991). https:\/\/doi.org\/10.1145\/113413.113433","DOI":"10.1145\/113413.113433"},{"issue":"1\u20132","key":"1161_CR47","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library. Sci. Comput. Progr. 72(1\u20132), 3\u201321 (2008). https:\/\/doi.org\/10.1016\/j.scico.2007.08.001","journal-title":"Sci. Comput. Progr."},{"key":"1161_CR48","unstructured":"Termination Competition 2022: C Integer. https:\/\/termcomp.github.io\/Y2022\/C_Integer.html. Accessed: 2023-04-26"},{"key":"1161_CR49","unstructured":"Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., L\u00f3pez-Garc\u00eda, P., Puebla, G.: The Ciao Prolog system: Reference manual. Technical Report CLIP 3\/97.1, UPM (1997). http:\/\/www.clip.dia.fi.upm.es\/"},{"key":"1161_CR50","doi-asserted-by":"publisher","unstructured":"Dutertre, B.: Yices 2.2. In: Biere, A., Bloem, R. (eds.) Computer-Aided Verification. LNCS, vol. 8559, pp. 737\u2013744. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_49","DOI":"10.1007\/978-3-319-08867-9_49"},{"key":"1161_CR51","doi-asserted-by":"publisher","unstructured":"Kafle, B., Gallagher, J.P., Morales, J.F.: RAHFT: A tool for verifying Horn clauses using abstract interpretation and finite tree automata. In: Chaudhuri, S., Farzan, A. (eds.) Computer-Aided Verification. LNCS, vol. 9779, pp. 261\u2013268. Springer, Berlin Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_14","DOI":"10.1007\/978-3-319-41528-4_14"},{"key":"1161_CR52","doi-asserted-by":"publisher","unstructured":"Larraz, D., Nimkar, K., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Proving non-termination using Max-SMT. In: Biere, A., Bloem, R. (eds.) Computer-Aided Verification. LNCS, vol. 8559, pp. 779\u2013796. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_52","DOI":"10.1007\/978-3-319-08867-9_52"},{"key":"1161_CR53","doi-asserted-by":"publisher","unstructured":"Velroyen, H., R\u00fcmmer, P.: Non-termination checking for imperative programs. In: Beckert, B., H\u00e4hnle, R. (eds.) Tests and Proofs. LNCS, vol. 4966, pp. 154\u2013170. Springer, Berlin Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79124-9_11","DOI":"10.1007\/978-3-540-79124-9_11"},{"key":"1161_CR54","doi-asserted-by":"publisher","unstructured":"Brockschmidt, M., Str\u00f6der, T., Otto, C., Giesl, J.: Automated detection of non-termination and NullPointerExceptions for Java bytecode. In: Beckert, B., Damiani, F., Gurov, D. (eds.) Formal Verification of Object-Oriented Software. LNCS, vol. 7421, pp. 123\u2013141. Springer, Berlin Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31762-0_9","DOI":"10.1007\/978-3-642-31762-0_9"},{"key":"1161_CR55","doi-asserted-by":"publisher","unstructured":"Cook, B., Fuhs, C., Nimkar, K., O\u2019Hearn, P.W.: Disproving termination with overapproximation. In: Claessen, K., Kuncak, V. (eds.) Formal Methods in Computer-Aided Design, pp. 67\u201374. FMCAD Inc, Vienna (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987597","DOI":"10.1109\/FMCAD.2014.6987597"},{"key":"1161_CR56","doi-asserted-by":"publisher","unstructured":"Leike, J., Heizmann, M.: Geometric nontermination arguments. In: Beyer, D., Huisman, M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 10806, pp. 266\u2013283. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_16","DOI":"10.1007\/978-3-319-89963-3_16"},{"issue":"3\/4","key":"1161_CR57","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1009747629591","volume":"2","author":"L Fribourg","year":"1997","unstructured":"Fribourg, L., Ols\u00e9n, H.: A decompositional approach for computing least fixed-points of Datalog programs with $$\\cal{Z} $$-counters. Constraints 2(3\/4), 305\u2013335 (1997). https:\/\/doi.org\/10.1023\/A:1009747629591","journal-title":"Constraints"},{"key":"1161_CR58","doi-asserted-by":"publisher","unstructured":"Leuschel, M., Lehmann, H.: Solving coverability problems of Petri nets by partial deduction. In: Gabbrielli, M., Pfenning, F. (eds.) Proc. Second Int. ACM SIGPLAN Conf. Principles and Practice of Declarative Programming, pp. 268\u2013279. ACM, New York (2000). https:\/\/doi.org\/10.1145\/351268.351298","DOI":"10.1145\/351268.351298"},{"key":"1161_CR59","doi-asserted-by":"publisher","unstructured":"Jaffar, J., Santosa, A.E., Voicu, R.: A CLP proof method for timed automata. In: Proc. 25th IEEE Real-Time Systems Symp., pp. 175\u2013186. IEEE, Piscataway NJ (2004). https:\/\/doi.org\/10.1109\/REAL.2004.5","DOI":"10.1109\/REAL.2004.5"},{"key":"1161_CR60","doi-asserted-by":"publisher","unstructured":"Banda, G., Gallagher, J.P.: Analysis of linear hybrid systems in CLP. In: Hanus, M. (ed.) Logic-Based Program Synthesis and Transformation. LNCS, vol. 5438, pp. 55\u201370. Springer, Berlin Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-642-00515-2_5","DOI":"10.1007\/978-3-642-00515-2_5"},{"key":"1161_CR61","doi-asserted-by":"publisher","unstructured":"Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, R. (ed.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 1579, pp. 223\u2013239. Springer, Berlin Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49059-0_16","DOI":"10.1007\/3-540-49059-0_16"},{"issue":"1\u20134","key":"1161_CR62","doi-asserted-by":"publisher","first-page":"115","DOI":"10.3233\/FI-2013-899","volume":"127","author":"F Fioravanti","year":"2013","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M., Senni, V.: Proving theorems by program transformation. Fundam. Inform. 127(1\u20134), 115\u2013134 (2013). https:\/\/doi.org\/10.3233\/FI-2013-899","journal-title":"Fundam. Inform."},{"issue":"3\u20134","key":"1161_CR63","doi-asserted-by":"publisher","first-page":"205","DOI":"10.3233\/FI-2019-1783","volume":"165","author":"E De Angelis","year":"2019","unstructured":"De Angelis, E., Fioravanti, F., Meo, M.C., Pettorossi, A., Proietti, M.: Semantics and controllability of time-aware business processes. Fundam. Inform. 165(3\u20134), 205\u2013244 (2019). https:\/\/doi.org\/10.3233\/FI-2019-1783","journal-title":"Fundam. Inform."},{"key":"1161_CR64","doi-asserted-by":"publisher","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S., Clarke, E.M.: Automatic abstraction in SMT-based unbounded software model checking. In: Sharygina, N., Veith, H. (eds.) Computer-Aided Verification. LNCS, vol. 8044, pp. 846\u2013862. Springer, Berlin Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_59","DOI":"10.1007\/978-3-642-39799-8_59"},{"key":"1161_CR65","doi-asserted-by":"publisher","unstructured":"Hojjat, H., R\u00fcmmer, P.: The Eldarica Horn solver. In: Bj\u00f8rner, N., Gurfinkel, A. (eds.) 2018 Formal Methods in Computer Aided Design (FMCAD), pp. 1\u20137. IEEE, Piscataway NJ (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603013","DOI":"10.23919\/FMCAD.2018.8603013"},{"key":"1161_CR66","doi-asserted-by":"publisher","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: VeriMAP: A tool for verifying programs through transformations. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 8413, pp. 568\u2013574. Springer, Berlin Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_47","DOI":"10.1007\/978-3-642-54862-8_47"},{"key":"1161_CR67","doi-asserted-by":"publisher","unstructured":"Ben-Amram, A.M., Dom\u00e9nech, J.J., Genaim, S.: Multiphase-linear ranking functions and their relation to recurrent sets. In: Chang, B. (ed.) Static Analysis. LNCS, vol. 11822, pp. 459\u2013480. Springer, Switzerland (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_22","DOI":"10.1007\/978-3-030-32304-2_22"},{"key":"1161_CR68","doi-asserted-by":"publisher","unstructured":"Fedyukovich, G., Zhang, Y., Gupta, A.: Syntax-guided termination analysis. In: Chockler, H., Weissenbacher, G. (eds.) Computer-Aided Verification, Part I. LNCS, vol. 10981, pp. 124\u2013143. Springer, Berlin Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_7","DOI":"10.1007\/978-3-319-96145-3_7"},{"key":"1161_CR69","doi-asserted-by":"publisher","unstructured":"Le, T.C., Antonopoulos, T., Fathololumi, P., Koskinen, E., Nguyen, T.: DynamiTe: Dynamic termination and non-termination proofs. In: Proc. ACM Program. Lang. 4, OOPSLA, pp. 1\u201330. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3428257","DOI":"10.1145\/3428257"},{"key":"1161_CR70","doi-asserted-by":"publisher","unstructured":"Prabhu, S., Fedyukovich, G., Madhukar, K., D\u2019Souza, D.: Specification synthesis with constrained Horn clauses. In: Proc. 42nd ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 1203\u20131217. ACM, New York (2021). https:\/\/doi.org\/10.1145\/3453483.3454104","DOI":"10.1145\/3453483.3454104"}],"container-title":["Software and Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-024-01161-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10270-024-01161-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-024-01161-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T12:06:37Z","timestamp":1715601997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10270-024-01161-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,14]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1161"],"URL":"https:\/\/doi.org\/10.1007\/s10270-024-01161-5","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"value":"1619-1366","type":"print"},{"value":"1619-1374","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,14]]},"assertion":[{"value":"4 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}