{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:41:50Z","timestamp":1776444110823,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100018693","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101069748"],"award-info":[{"award-number":["101069748"]}],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["NF-HiSec ANR-22- PEFT-0009"],"award-info":[{"award-number":["NF-HiSec ANR-22- PEFT-0009"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"DOI":"10.1145\/3644033.3644382","type":"proceedings-article","created":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T16:56:27Z","timestamp":1717692987000},"page":"12-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Finite Automata synthesis from Interactions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5322-4337","authenticated-orcid":false,"given":"Erwan","family":"Mahe","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CEA, List, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4943-7807","authenticated-orcid":false,"given":"Boutheina","family":"Bannour","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CEA, List, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6865-5108","authenticated-orcid":false,"given":"Christophe","family":"Gaston","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CEA, List, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2185-4051","authenticated-orcid":false,"given":"Arnault","family":"Lapitre","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CEA, List, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8955-6835","authenticated-orcid":false,"given":"Pascale","family":"Le Gall","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CentraleSup\u00e9lec, Gif-sur-Yvette, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Abdulla Parosh Aziz","unstructured":"Parosh Aziz Abdulla, Yu-Fang Chen, Luk\u00e1\u0161 Hol\u00edk, Richard Mayr, and Tom\u00e1\u0161 Vojnar. 2010. When Simulation Meets Antichains. In Tools and Algorithms for the Construction and Analysis of Systems, Javier Esparza and Rupak Majumdar (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 158--174."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48320-9_10"},{"key":"e_1_3_2_1_3_1","volume-title":"FA Minimisation Heuristics for a Class of Finite Languages","author":"Amilhastre Jerome","unstructured":"Jerome Amilhastre, Philippe Janssen, and Marie-Catherine Vilarem. 2001. FA Minimisation Heuristics for a Class of Finite Languages. In Automata Implementation, Oliver Boldt and Helmut Jurgensen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1--12."},{"key":"e_1_3_2_1_4_1","unstructured":"Maroneze Andre Massonnet Philippe Dupont Sebastien Nigam Vivek Plate Henrik Sykosch Arnold Cakmak Eren Thanasis Sfetsos Jimenez Victor Amparan Estibaliz Martinez Cristina Lopez Angel Garcia-Alfaro Joaquin Segovia Mariana Rubio-Hernan Jose Blanc Gregory Debar Herve Carbone Roberto Ranise Silvio Verderame Luca Spaziani-Brunella Marco Yautsiukhin Artsiom Morgagni Andrea Klein Jacques Bissyande Tegawende and Samhi Jordan. 2020. Assessment specifications and roadmap. In Technical report EC (Ed.). SPARTA project."},{"key":"e_1_3_2_1_5_1","volume-title":"STACS 95, Ernst W","author":"Antimirov Valentin","unstructured":"Valentin Antimirov. 1995. Partial derivatives of regular expressions and finite automata constructions. In STACS 95, Ernst W. Mayr and Claude Puech (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 455--466."},{"key":"e_1_3_2_1_6_1","volume-title":"Principles of model checking","author":"Baier Christel","unstructured":"Christel Baier and Joost-Pieter Katoen. 2008. Principles of model checking. MIT Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5311\/JOSIS.2013.6.104"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"e_1_3_2_1_9_1","volume-title":"Developments in Language Theory","author":"Champarnaud Jean-Marc","unstructured":"Jean-Marc Champarnaud and Fabien Coulon. 2003. NFA Reduction Algorithms by Means of Regular Inequalities. In Developments in Language Theory, Zoltan Esik and Zoltan Fulop (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 194--205."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120100561601"},{"key":"e_1_3_2_1_11_1","volume-title":"Rewrite Systems","author":"Dershowitz Nachum","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. 1991. Rewrite Systems. MIT Press, Cambridge, MA, USA, 243--320."},{"key":"e_1_3_2_1_12_1","volume-title":"Process Algebra: An Algebraic Theory of Concurrency","author":"Fokkink Wan","year":"2009","unstructured":"Wan Fokkink. 2009. Process Algebra: An Algebraic Theory of Concurrency. In Algebraic Informatics, Symeon Bozapalidis and George Rahonis (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 47--77."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.036"},{"key":"e_1_3_2_1_14_1","volume-title":"Reducing Nondeterministic Finite Automata with SAT Solvers","author":"Geldenhuys Jaco","unstructured":"Jaco Geldenhuys, Brink van der Merwe, and Lynette van Zijl. 2010. Reducing Nondeterministic Finite Automata with SAT Solvers. In Finite-State Methods and Natural Language Processing, Anssi Yli-Jyra, Andras Kornai, Jacques Sakarovitch, and Bruce Watson (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 81--92."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.08.004"},{"key":"e_1_3_2_1_17_1","volume-title":"Ullman","author":"Hopcroft John E.","year":"1979","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27812-2_11"},{"key":"e_1_3_2_1_19_1","volume-title":"Mathematical Foundations of Computer Science","author":"Iliea Lucian","year":"2002","unstructured":"Lucian Iliea and Sheng Yu. 2002. Algorithms for Computing Small NFAs. In Mathematical Foundations of Computer Science 2002, Krzysztof Diks and Wojciech Rytter (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 328--340."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Tao Jiang and B. Ravikumar. 1991. Minimal NFA problems are hard. In Automata Languages and Programming Javier Leach Albert Burkhard Monien and Mario Rodriguez Artalejo (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 629--640.","DOI":"10.1007\/3-540-54233-7_169"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222994"},{"key":"e_1_3_2_1_22_1","volume-title":"UML Interactions Meet State Machines - An Institutional Approach. In 7th Conf. on Algebra and Coalgebra in Computer Science (CALCO) (Leibniz International Proceedings in Informatics (LIPIcs)","author":"Knapp Alexander","year":"2017","unstructured":"Alexander Knapp and Till Mossakowski. 2017. UML Interactions Meet State Machines - An Institutional Approach. In 7th Conf. on Algebra and Coalgebra in Computer Science (CALCO) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 72)."},{"key":"e_1_3_2_1_23_1","volume-title":"Tyrolean Termination Tool 2","author":"Korp Martin","unstructured":"Martin Korp, Christian Sternagel, Harald Zankl, and Aart Middeldorp. 2009. Tyrolean Termination Tool 2. In Rewriting Techniques and Applications, Ralf Treinen (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 295--304."},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 3rd Distributed Ledger Technology Workshop Co-located with ITASEC 2020 (CEUR Workshop Proceedings","author":"Lallai Giorgia","year":"2020","unstructured":"Giorgia Lallai, Andrea Pinna, Michele Marchesi, and Roberto Tonelli. 2020. Software Engineering for DApp Smart Contracts Managing Workers Contracts. In Proceedings of the 3rd Distributed Ledger Technology Workshop Co-located with ITASEC 2020 (CEUR Workshop Proceedings, Vol. 2580). CEUR-WS.org."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(81)80005-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"P. Madhusudan and B. Meenakshi. 2001. Beyond Message Sequence Graphs. In FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science 21st Conference Bangalore India December 13--15 2001 Proceedings (Lecture Notes in Computer Science Vol. 2245) Ramesh Hariharan Madhavan Mukund and V. Vinay (Eds.). Springer 256--267. 10.1007\/3-540-45294-X_22","DOI":"10.1007\/3-540-45294-X_22"},{"key":"e_1_3_2_1_27_1","unstructured":"Erwan Mahe. 2022. HIBOU tool. https:\/\/github.com\/erwanM974\/hibou_label."},{"key":"e_1_3_2_1_28_1","unstructured":"Erwan Mahe. 2023. applying an incremental approach to NFA synthesis on interaction use cases from the literature. https:\/\/github.com\/erwanM974\/hibou_nfagen_concrete_usecases."},{"key":"e_1_3_2_1_29_1","unstructured":"Erwan Mahe. 2023. AUTOUR toolbox. https:\/\/github.com\/erwanM974\/autour_core."},{"key":"e_1_3_2_1_30_1","unstructured":"Erwan Mahe. 2023. comparing incremental and compositional approaches to NFA synthesis from interactions. https:\/\/github.com\/erwanM974\/hibou_nfa_synthesis_benchmark."},{"key":"e_1_3_2_1_31_1","unstructured":"Erwan Mahe. 2023. coq proof for the equivalence of interaction semantics with co-regions. https:\/\/github.com\/erwanM974\/coq_interaction_semantics_equivalence_with_coregions."},{"key":"e_1_3_2_1_32_1","unstructured":"Erwan Mahe. 2023. proof of convergence for interaction simplification. https:\/\/github.com\/erwanM974\/hibou_trs_simplify_empty."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3412841.3442054"},{"key":"e_1_3_2_1_34_1","volume-title":"Fundamental Approaches to Software Engineering","author":"Mahe Erwan","unstructured":"Erwan Mahe, Christophe Gaston, and Pascale Le Gall. 2020. Revisiting Semantics of Interactions for Trace Validity Analysis. In Fundamental Approaches to Software Engineering, Heike Wehrheim and Jordi Cabot (Eds.). Springer International Publishing, Cham, 482--501."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-10363-6_8"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2023.103034"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00060-2"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1098"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03014374"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-010-0157-9"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30500-2_37"},{"key":"e_1_3_2_1_44_1","volume-title":"Testing Extended Regular Language Membership Incrementally by Rewriting","author":"Ro\u015fu Grigore","unstructured":"Grigore Ro\u015fu and Mahesh Viswanathan. 2003. Testing Extended Regular Language Membership Incrementally by Rewriting. In Rewriting Techniques and Applications, Robert Nieuwenhuis (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 499--514."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)81051-X"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2009.16"},{"key":"e_1_3_2_1_47_1","volume-title":"Automated Deduction - CADE-23, Nikolaj Bj\u00f8rner and Viorica Sofronie-Stokkermans (Eds.)","author":"Zankl Harald","unstructured":"Harald Zankl, Bertram Felgenhauer, and Aart Middeldorp. 2011. CSI - A Confluence Tool. In Automated Deduction - CADE-23, Nikolaj Bj\u00f8rner and Viorica Sofronie-Stokkermans (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 499--505."}],"event":{"name":"FormaliSE '24: 2024 IEEE\/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)","location":"Lisbon Portugal","acronym":"FormaliSE '24","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 2024 IEEE\/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3644033.3644382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3644033.3644382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:58Z","timestamp":1750291018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3644033.3644382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":46,"alternative-id":["10.1145\/3644033.3644382","10.1145\/3644033"],"URL":"https:\/\/doi.org\/10.1145\/3644033.3644382","relation":{},"subject":[],"published":{"date-parts":[[2024,4,14]]},"assertion":[{"value":"2024-06-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}