{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:50:41Z","timestamp":1776297041532,"version":"3.50.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227515","type":"print"},{"value":"9783032227522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22752-2_25","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:50:52Z","timestamp":1776289852000},"page":"480-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LTL$$_f$$ Learning Meets Boolean Set Cover"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2400-4914","authenticated-orcid":false,"given":"Gabriel","family":"Bathie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6576-4680","authenticated-orcid":false,"given":"Nathana\u00ebl","family":"Fijalkow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5043-3221","authenticated-orcid":false,"given":"Th\u00e9o","family":"Matricon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3248-5714","authenticated-orcid":false,"given":"Baptiste","family":"Mouillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5834-1068","authenticated-orcid":false,"given":"Pierre","family":"Vandenhove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Ammons, G., Bod\u00edk, R., Larus, J.R.: Mining specifications. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. pp. 4\u201316. POPL\u201902, Association for Computing Machinery (2002). https:\/\/doi.org\/10.1145\/503272.503275","DOI":"10.1145\/503272.503275"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319\u2013342 (1988). https:\/\/doi.org\/10.1023\/a:1022821128753","DOI":"10.1023\/a:1022821128753"},{"key":"25_CR3","unstructured":"Anthony, M., Biggs, N.: Computational Learning Theory. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (1997)"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Asarin, E., Donz\u00e9, A., Maler, O., Nickovic, D.: Parametric identification of temporal properties. In: Khurshid, S., Sen, K. (eds.) Runtime Verification. pp. 147\u2013160. Springer Berlin Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29860-8_12","DOI":"10.1007\/978-3-642-29860-8_12"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Bartocci, E., Bortolussi, L., Nenzi, L., Sanguinetti, G.: System design of stochastic models using robustness of temporal properties. Theoretical Computer Science 587, 3\u201325 (2015). https:\/\/doi.org\/10.1016\/J.TCS.2015.02.046","DOI":"10.1016\/J.TCS.2015.02.046"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Bathie, G., Fijalkow, N., Matricon, T., Mouillon, B., Vandenhove, P.: LTL$$_f$$ learning meets boolean set cover. CoRR abs\/2509.24616 (2025). https:\/\/doi.org\/10.48550\/arXiv.2509.24616","DOI":"10.48550\/arXiv.2509.24616"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Bombara, G., Vasile, C.I., Penedo\u00a0Alvarez, F., Yasuoka, H., Belta, C.: A decision tree approach to data classification using signal temporal logic. In: Hybrid Systems: Computation and Control. HSCC\u201916 (2016). https:\/\/doi.org\/10.1145\/2883817.2883843","DOI":"10.1145\/2883817.2883843"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: On the complexity of some quadratic-time solvable problems. In: Crescenzi, P., Loreti, M. (eds.) Proceedings of the 16th Italian Conference on Theoretical Computer Science, ICTCS 2015. Electronic Notes in Theoretical Computer Science, vol.\u00a0322, pp. 51\u201367. Elsevier (2015). https:\/\/doi.org\/10.1016\/J.ENTCS.2016.03.005","DOI":"10.1016\/J.ENTCS.2016.03.005"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Brafman, R.I., Giacomo, G.D., Patrizi, F.: LTLf\/LDLf non-Markovian rewards. In: McIlraith, S.A., Weinberger, K.Q. (eds.) AAAI Conference on Artificial Intelligence. pp. 1771\u20131778. AAAI Press (2018). https:\/\/doi.org\/10.1609\/AAAI.V32I1.11572","DOI":"10.1609\/AAAI.V32I1.11572"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Bufo, S., Bartocci, E., Sanguinetti, G., Borelli, M., Lucangelo, U., Bortolussi, L.: Temporal logic based monitoring of assisted ventilation in intensive care patients. In: Margaria, T., Steffen, B. (eds.) International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. Specialized Techniques and Applications. Lecture Notes in Computer Science, vol.\u00a08803, pp. 391\u2013403. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-45231-8_30","DOI":"10.1007\/978-3-662-45231-8_30"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Camacho, A., Chen, O., Sanner, S., McIlraith, S.A.: Non-Markovian rewards expressed in LTL: Guiding search via reward shaping. In: Fukunaga, A., Kishimoto, A. (eds.) International Symposium on Combinatorial Search. pp. 159\u2013160. AAAI Press (2017). https:\/\/doi.org\/10.1609\/SOCS.V8I1.18421","DOI":"10.1609\/SOCS.V8I1.18421"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Camacho, A., Icarte, R.T., Klassen, T.Q., Valenzano, R.A., McIlraith, S.A.: LTL and beyond: Formal languages for reward function specification in reinforcement learning. In: Kraus, S. (ed.) International Joint Conference on Artificial Intelligence. pp. 6065\u20136073. ijcai.org (2019). https:\/\/doi.org\/10.24963\/IJCAI.2019\/840","DOI":"10.24963\/IJCAI.2019\/840"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Camacho, A., McIlraith, S.A.: Learning interpretable models expressed in linear temporal logic. International Conference on Automated Planning and Scheduling 29 (2019). https:\/\/doi.org\/10.1609\/icaps.v29i1.3529","DOI":"10.1609\/icaps.v29i1.3529"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Caplain, M.: Finding invariant assertions for proving programs. In: Shooman, M.L., Yeh, R.T. (eds.) International Conference on Reliable Software 1975. pp. 165\u2013171. ACM (1975). https:\/\/doi.org\/10.1145\/800027.808436","DOI":"10.1145\/800027.808436"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Chou, G., Ozay, N., Berenson, D.: Explaining multi-stage tasks by learning temporal logic formulas from suboptimal demonstrations. In: Toussaint, M., Bicchi, A., Hermans, T. (eds.) Robotics: Science and Systems XVI (2020). https:\/\/doi.org\/10.15607\/RSS.2020.XVI.097","DOI":"10.15607\/RSS.2020.XVI.097"},{"key":"25_CR16","unstructured":"Chowdhury, A.B., Romanelli, M., Tan, B., Karri, R., Garg, S.: Retrieval-guided reinforcement learning for Boolean circuit minimization. In: International Conference on Learning Representations, ICLR. OpenReview.net (2024)"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Christodorescu, M., Jha, S., Kruegel, C.: Mining specifications of malicious behavior. In: Crnkovic, I., Bertolino, A. (eds.) Joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering. pp. 5\u201314. ACM (2007). https:\/\/doi.org\/10.1145\/1287624.1287628","DOI":"10.1145\/1287624.1287628"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Crama, Y., Hammer, P.L., Ibaraki, T.: Cause-effect relationships and partially defined Boolean functions. Annals of Operations Research 16(1), 299\u2013325 (1988). https:\/\/doi.org\/10.1007\/bf02283750","DOI":"10.1007\/bf02283750"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Ding, Y., Qiu, X.: Enhanced enumeration techniques for syntax-guided synthesis of bit-vector manipulations. Proceedings of the ACM on Programming Languages 8(POPL), 2129\u20132159 (2024). https:\/\/doi.org\/10.1145\/3632913","DOI":"10.1145\/3632913"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"Dureja, R., Rozier, K.Y.: More scalable LTL model checking via discovering design-space dependencies ($${D}^3$$). In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS. Lecture Notes in Computer Science, vol. 10805, pp. 309\u2013327. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_17","DOI":"10.1007\/978-3-319-89960-2_17"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Duret-Lutz, A., Renault, E., Colange, M., Renkin, F., Aisse, A.G., Schlehuber-Caissier, P., Medioni, T., Martin, A., Dubois, J., Gillard, C., Lauko, H.: From Spot 2.0 to Spot 2.10: What\u2019s new? In: Shoham, S., Vizel, Y. (eds.) Computer Aided Verification \u2013 34th International Conference, CAV 2022, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13372, pp. 174\u2013187. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-13188-2_9","DOI":"10.1007\/978-3-031-13188-2_9"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Engler, D.R., Chen, D.Y., Chou, A.: Bugs as deviant behavior: A general approach to inferring errors in systems code. In: Marzullo, K., Satyanarayanan, M. (eds.) ACM Symposium on Operating System Principles. pp. 57\u201372. ACM (2001). https:\/\/doi.org\/10.1145\/502034.502041","DOI":"10.1145\/502034.502041"},{"key":"25_CR23","unstructured":"Fijalkow, N., Lagarde, G.: The complexity of learning linear temporal formulas from examples. In: International Conference on Grammatical Inference. ICGI\u201921, vol.\u00a0153, pp. 237\u2013250. Proceedings of Machine Learning Research (2021)"},{"key":"25_CR24","unstructured":"Gabbrielli, M., Levi, G., Meo, M.C.: Observational equivalences for logic programs. In: Joint International Conference and Symposium on Logic Programming. pp. 131\u2013145 (1992)"},{"key":"25_CR25","doi-asserted-by":"publisher","unstructured":"Gabel, M., Su, Z.: Javert: Fully automatic mining of general temporal properties from dynamic traces. In: ACM SIGSOFT International Symposium on Foundations of Software Engineering. pp. 339\u2013349. FSE\u201908, Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1453101.1453150","DOI":"10.1145\/1453101.1453150"},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Ghosh, S., Elenius, D., Li, W., Lincoln, P., Shankar, N., Steiner, W.: ARSENAL: Automatic requirements specification extraction from natural language. In: Rayadurgam, S., Tkachuk, O. (eds.) International Symposium on NASA Formal Methods. Lecture Notes in Computer Science, vol.\u00a09690, pp. 41\u201346. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40648-0_4","DOI":"10.1007\/978-3-319-40648-0_4"},{"key":"25_CR27","unstructured":"Giacomo, G.D., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Rossi, F. (ed.) International Joint Conference on Artificial Intelligence. pp. 854\u2013860. IJCAI\u201913, IJCAI\/AAAI (2013)"},{"key":"25_CR28","unstructured":"Giannakopoulou, D., Pressburger, T., Mavridou, A., Rhein, J., Schumann, J., Shi, N.: Formal requirements elicitation with FRET. In: International Conference on Requirements Engineering: Foundation for Software Quality. CEUR Workshop Proceedings, vol.\u00a02584. CEUR-WS.org (2020)"},{"key":"25_CR29","doi-asserted-by":"publisher","unstructured":"Guti\u00e9rrez-S\u00e1nchez, P., P\u00e9rez-Li\u00e9bana, D., Gaina, R.D.: Explaining and clustering playtraces using temporal logics. In: Proceedings of the 20th International Conference on the Foundations of Digital Games. pp. 1\u201310. FDG\u201925, ACM (2025). https:\/\/doi.org\/10.1145\/3723498.3723719","DOI":"10.1145\/3723498.3723719"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Icarte, R.T., Klassen, T.Q., Valenzano, R.A., McIlraith, S.A.: Teaching multiple tasks to an RL agent using LTL. In: Andr\u00e9, E., Koenig, S., Dastani, M., Sukthankar, G. (eds.) International Conference on Autonomous Agents and MultiAgent Systems. pp. 452\u2013461. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA \/ ACM (2018)","DOI":"10.65109\/FKNQ6967"},{"key":"25_CR31","unstructured":"Icarte, R.T., Klassen, T.Q., Valenzano, R.A., McIlraith, S.A.: Using reward machines for high-level task specification and decomposition in reinforcement learning. In: Dy, J.G., Krause, A. (eds.) International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a080, pp. 2112\u20132121. PMLR (2018)"},{"key":"25_CR32","doi-asserted-by":"publisher","unstructured":"Jacobs, S., P\u00e9rez, G.A., Abraham, R., Bruy\u00e8re, V., Cadilhac, M., Colange, M., Delfosse, C., van Dijk, T., Duret-Lutz, A., Faymonville, P., Finkbeiner, B., Khalimov, A., Klein, F., Luttenberger, M., Meyer, K.J., Michaud, T., Pommellet, A., Renkin, F., Schlehuber-Caissier, P., Sakr, M., Sickert, S., Staquet, G., Tamines, C., Tentrup, L., Walker, A.: The reactive synthesis competition (SYNTCOMP): 2018-2021. International Journal on Software Tools for Technology Transfer 26(5), 551\u2013567 (2024). https:\/\/doi.org\/10.1007\/S10009-024-00754-1","DOI":"10.1007\/S10009-024-00754-1"},{"key":"25_CR33","doi-asserted-by":"publisher","unstructured":"Jin, X., Donz\u00e9, A., Deshmukh, J.V., Seshia, S.A.: Mining requirements from closed-loop control models. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 34(11), 1704\u20131717 (2015). https:\/\/doi.org\/10.1109\/TCAD.2015.2421907","DOI":"10.1109\/TCAD.2015.2421907"},{"key":"25_CR34","doi-asserted-by":"publisher","unstructured":"Jones, A., Kong, Z., Belta, C.: Anomaly detection in cyber-physical systems: A formal methods approach. In: IEEE Conference on Decision and Control. pp. 848\u2013853. IEEE (2014). https:\/\/doi.org\/10.1109\/CDC.2014.7039487","DOI":"10.1109\/CDC.2014.7039487"},{"key":"25_CR35","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Symposium on the Complexity of Computer Computations. pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"25_CR36","doi-asserted-by":"publisher","unstructured":"Kong, Z., Jones, A., Belta, C.: Temporal logics for learning and detection of anomalous behavior. IEEE Transactions on Automatic Control 62(3), 1210\u20131222 (2017). https:\/\/doi.org\/10.1109\/TAC.2016.2585083","DOI":"10.1109\/TAC.2016.2585083"},{"key":"25_CR37","doi-asserted-by":"publisher","unstructured":"Lemieux, C., Beschastnikh, I.: Investigating program behavior using the Texada LTL specifications miner. In: IEEE\/ACM International Conference on Automated Software Engineering. pp. 870\u2013875. ASE\u201915, IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/ASE.2015.94","DOI":"10.1109\/ASE.2015.94"},{"key":"25_CR38","doi-asserted-by":"publisher","unstructured":"Lemieux, C., Park, D., Beschastnikh, I.: General LTL specification mining. In: IEEE\/ACM International Conference on Automated Software Engineering. pp. 81\u201392. ASE\u201915, IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/ASE.2015.71","DOI":"10.1109\/ASE.2015.71"},{"key":"25_CR39","unstructured":"Li, W.: Specification Mining: New Formalisms, Algorithms and Applications. Ph.D. thesis, University of California, Berkeley, USA (2013)"},{"key":"25_CR40","doi-asserted-by":"publisher","unstructured":"Li, Z., Zhou, Y.: PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code. In: Wermelinger, M., Gall, H.C. (eds.) European Software Engineering Conference held jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering. pp. 306\u2013315. ACM (2005). https:\/\/doi.org\/10.1145\/1081706.1081755","DOI":"10.1145\/1081706.1081755"},{"key":"25_CR41","doi-asserted-by":"publisher","unstructured":"Lo, D., Khoo, S.C., Han, J., Liu, C.: Mining Software Specifications: Methodologies and Applications. CRC Press, Inc., USA, 1st edn. (2017). https:\/\/doi.org\/10.1201\/b10928","DOI":"10.1201\/b10928"},{"key":"25_CR42","doi-asserted-by":"publisher","unstructured":"Lyu, M., Li, F., Lee, C.H., Chen, C.H.: VALIO: Visual attention-based linear temporal logic method for explainable out-of-the-loop identification. Knowledge-Based Systems 299, 112086 (2024). https:\/\/doi.org\/10.1016\/j.knosys.2024.112086","DOI":"10.1016\/j.knosys.2024.112086"},{"key":"25_CR43","doi-asserted-by":"publisher","unstructured":"Mascle, C., Fijalkow, N., Lagarde, G.: Learning temporal formulas from examples is hard. CoRR abs\/2312.16336 (2023). https:\/\/doi.org\/10.48550\/arXiv.2312.16336","DOI":"10.48550\/arXiv.2312.16336"},{"key":"25_CR44","doi-asserted-by":"publisher","unstructured":"Murphy, W., Holzer, N., Koenig, N., Cui, L., Rothkopf, R., Qiao, F., Santolucito, M.: Guiding LLM temporal logic generation with explicit separation of data and control. CoRR abs\/2406.07400 (2024). https:\/\/doi.org\/10.48550\/arXiv.2406.07400","DOI":"10.48550\/arXiv.2406.07400"},{"key":"25_CR45","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: Symposium on Foundations of Computer Science. SFCS\u201977 (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"25_CR46","doi-asserted-by":"publisher","unstructured":"Raha, R., Roy, R., Fijalkow, N., Neider, D.: Scalable anytime algorithms for learning fragments of linear temporal logic. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS\u201922, vol. 13243, pp. 263\u2013280. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_14","DOI":"10.1007\/978-3-030-99524-9_14"},{"key":"25_CR47","doi-asserted-by":"publisher","unstructured":"Raha, R., Roy, R., Fijalkow, N., Neider, D.: Scarlet: Scalable anytime algorithms for learning fragments of linear temporal logic. Journal of Open Source Software (2024). https:\/\/doi.org\/10.21105\/joss.05052","DOI":"10.21105\/joss.05052"},{"key":"25_CR48","unstructured":"Roy, R., Pote, Y., Parker, D., Kwiatkowska, M.: Learning probabilistic temporal logic specifications for stochastic systems"},{"key":"25_CR49","doi-asserted-by":"publisher","unstructured":"Rozier, K.Y.: Specification: The biggest bottleneck in formal methods and autonomy. In: Blazy, S., Chechik, M. (eds.) International Conference on Verified Software. Theories, Tools, and Experiments. Lecture Notes in Computer Science, vol.\u00a09971, pp. 8\u201326 (2016). https:\/\/doi.org\/10.1007\/978-3-319-48869-1_2","DOI":"10.1007\/978-3-319-48869-1_2"},{"key":"25_CR50","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: A theory of the learnable. Communications of the ACM 27(11), 1134\u20131142 (1984). https:\/\/doi.org\/10.1145\/1968.1972","DOI":"10.1145\/1968.1972"},{"key":"25_CR51","doi-asserted-by":"publisher","unstructured":"Valizadeh, M., Berger, M.: Search-based regular expression inference on a GPU. Proceedings of the ACM on Programming Languages 7(PLDI), 1317\u20131339 (2023). https:\/\/doi.org\/10.1145\/3591274","DOI":"10.1145\/3591274"},{"key":"25_CR52","doi-asserted-by":"publisher","unstructured":"Valizadeh, M., Fijalkow, N., Berger, M.: LTL learning on GPUs. In: International Conference on Computer Aided Verification, CAV. Lecture Notes in Computer Science, vol. 14683, pp. 209\u2013231. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65633-0_10","DOI":"10.1007\/978-3-031-65633-0_10"},{"key":"25_CR53","doi-asserted-by":"publisher","unstructured":"Wegbreit, B.: The synthesis of loop predicates. Communications of the ACM 17(2), 102\u2013112 (1974). https:\/\/doi.org\/10.1145\/360827.360850","DOI":"10.1145\/360827.360850"},{"key":"25_CR54","doi-asserted-by":"publisher","unstructured":"Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348(2-3), 357\u2013365 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.023","DOI":"10.1016\/j.tcs.2005.09.023"},{"key":"25_CR55","doi-asserted-by":"publisher","unstructured":"Yang, H., Hoxha, B., Fainekos, G.E.: Querying parametric temporal logic properties on embedded systems. In: Nielsen, B., Weise, C. (eds.) IFIP International Conference on Testing Software and Systems. Lecture Notes in Computer Science, vol.\u00a07641, pp. 136\u2013151. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34691-0_11","DOI":"10.1007\/978-3-642-34691-0_11"},{"key":"25_CR56","doi-asserted-by":"publisher","unstructured":"Yang, J., Evans, D., Bhardwaj, D., Bhat, T., Das, M.: Perracotta: Mining temporal API rules from imperfect traces. In: International Conference on Software Engineering. pp. 282\u2013291. ICSE\u201906, Association for Computing Machinery (2006). https:\/\/doi.org\/10.1145\/1134285.1134325","DOI":"10.1145\/1134285.1134325"},{"key":"25_CR57","doi-asserted-by":"publisher","unstructured":"Zeller, A.: Mining specifications: A roadmap. In: Nanz, S. (ed.) The Future of Software Engineering. pp. 173\u2013182. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15187-3_13","DOI":"10.1007\/978-3-642-15187-3_13"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22752-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:10:19Z","timestamp":1776294619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22752-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227515","9783032227522"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22752-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}