{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:31:43Z","timestamp":1743100303043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031626449"},{"type":"electronic","value":"9783031626456"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62645-6_5","type":"book-chapter","created":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:01:51Z","timestamp":1718168511000},"page":"82-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synthesis for\u00a0Prefix First-Order Logic on\u00a0Data Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0470-1781","authenticated-orcid":false,"given":"Julien","family":"Grange","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6205-0682","authenticated-orcid":false,"given":"Mathieu","family":"Lehaut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-45231-5_6","volume-title":"Foundations of Software Science and Computation Structures","author":"B B\u00e9rard","year":"2020","unstructured":"B\u00e9rard, B., Bollig, B., Lehaut, M., Sznajder, N.: Parameterized synthesis for fragments of first-order logic over data words. In: FoSSaCS 2020. LNCS, vol. 12077, pp. 97\u2013118. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_6"},{"key":"5_CR2","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: 21th IEEE Symposium on Logic in Computer Science LICS (2006)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society (1969)","DOI":"10.2307\/1994916"},{"key":"5_CR4","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol.\u00a01 (1957)"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1093\/logcom\/exr013","volume":"22","author":"S Demri","year":"2012","unstructured":"Demri, S., d\u2019Souza, D., Gascon, R.: Temporal logics of repeating values. J. Log. Comput. 22(5), 1059\u20131096 (2012)","journal-title":"J. Log. Comput."},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"S Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: Ltl with the freeze quantifier and register automata. ACM Trans. Comput. Logic (TOCL) 10(3), 1\u201330 (2009)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"5_CR7","unstructured":"Exibard, L., Filiot, E., Khalimov, A.: A generic solution to register-bounded synthesis with an application to discrete orders. arXiv preprint arXiv:2205.01952 (2022)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Figueira, D., Praveen, M.: Playing with repetitions in data words using energy games. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS (2018)","DOI":"10.1145\/3209108.3209154"},{"key":"5_CR9","unstructured":"Grange, J., Lehaut, M.: First order synthesis for data words revisited. arXiv preprint arXiv:2307.04499 (2023)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Grange, J., Lehaut, M.: Synthesis for prefix first-order logic on data words. arXiv preprint arXiv:2404.14517 (2024)","DOI":"10.1007\/978-3-031-62645-6_5"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoret. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR12","unstructured":"Kara, A.: Logics on data words (2016)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic (TOCL) 5(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp. 746\u2013757. IEEE (1990)","DOI":"10.1109\/FSCS.1990.89597"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62645-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T17:01:29Z","timestamp":1732208489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62645-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031626449","9783031626456"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62645-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}