{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T03:38:51Z","timestamp":1782877131454,"version":"3.54.5"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255398","type":"print"},{"value":"9783030255404","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25540-4_1","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:02:35Z","timestamp":1562929355000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Symbolic Register Automata"],"prefix":"10.1007","author":[{"given":"Loris","family":"D\u2019Antoni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tiago","family":"Ferreira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matteo","family":"Sammartino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Argyros, G., D\u2019Antoni, L.: The learnability of symbolic automata. In: CAV, pp. 427\u2013445 (2018)","DOI":"10.1007\/978-3-319-96145-3_23"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barringer, H., Falcone, Y., Havelund, K., Reger, G., Rydeheard, D.E.: Quantified event automata: towards expressive and efficient runtime monitors. In: FM, pp. 68\u201384 (2012)","DOI":"10.1007\/978-3-642-32759-9_9"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Becchi, M., Crowley, P.: Extending finite automata to efficiently match perl-compatible regular expressions. In: CoNEXT, pp. 25 (2008)","DOI":"10.1145\/1544012.1544037"},{"key":"1_CR4","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: AMW (2010)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bispo, J., Sourdis, I., Cardoso, J.M.P., Vassiliadis, S.: Regular expression matching for reconfigurable packet inspection. In: FPT, pp. 119\u2013126 (2006)","DOI":"10.1109\/FPT.2006.270302"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A fresh approach to learning register automata. In: DLT, pp. 118\u2013130 (2013)","DOI":"10.1007\/978-3-642-38771-5_12"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jlamp.2014.07.004","volume":"84","author":"S Cassel","year":"2015","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. J. Log. Algebr. Meth. Program. 84(1), 54\u201366 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Asp. Comput. 28(2), 233\u2013263 (2016)","journal-title":"Formal Asp. Comput."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Leng\u00e1l, O., Tan, T., Wu, Z.: Register automata with linear arithmetic. In: LICS, pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005111"},{"key":"1_CR10","unstructured":"D\u2019Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic register automata. CoRR, abs\/1811.06968 (2019). \n                      http:\/\/arxiv.org\/abs\/1811.06968"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10703-015-0233-4","volume":"47","author":"L D\u2019Antoni","year":"2015","unstructured":"D\u2019Antoni, L., Veanes, M.: Extended symbolic finite automata and transducers. Formal Meth. Syst. Des. 47(1), 93\u2013119 (2015)","journal-title":"Formal Meth. Syst. Des."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: CAV, pp. 47\u201367 (2017)","DOI":"10.1007\/978-3-319-63387-9_3"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"S Demri","year":"2009","unstructured":"Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16:1\u201316:30 (2009)","journal-title":"ACM Trans. Comput. Log."},{"issue":"6","key":"1_CR14","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1017\/S0960129514000322","volume":"26","author":"D Figueira","year":"2016","unstructured":"Figueira, D., Hofman, P., Lasota, S.: Relating timed and register automata. Math. Struct. Comput. Sci. 26(6), 993\u20131021 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Grigore, R., Distefano, D., Petersen, R.L., Tzevelekos, N.: Runtime verification based on register automata. In: TACAS, pp. 260\u2013276 (2013)","DOI":"10.1007\/978-3-642-36742-7_19"},{"issue":"1\u20132","key":"1_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(1\u20132), 65\u201398 (2014)","journal-title":"Mach. Learn."},{"issue":"2","key":"1_CR17","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. Theor. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-40447-4_10","volume-title":"Trends in Functional Programming","author":"V Komendantsky","year":"2013","unstructured":"Komendantsky, V.: Matching problem for regular expressions with variables. In: Loidl, H.-W., Pe\u00f1a, R. (eds.) TFP 2012. LNCS, vol. 7829, pp. 149\u2013166. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40447-4_10"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: POPL, pp. 613\u2013625 (2017)","DOI":"10.1145\/3093333.3009879"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Bisimilarity in fresh-register automata. In: LICS, pp. 156\u2013167 (2015)","DOI":"10.1109\/LICS.2015.24"},{"key":"1_CR21","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Polynomial-time equivalence testing for deterministic fresh-register automata. In: MFCS, pp. 72:1\u201372:14 (2018)"},{"issue":"3","key":"1_CR22","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. Log. 5(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"1_CR23","unstructured":"RegExLib. Regular expression library (2017). \n                      http:\/\/regexlib.com\/"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-18098-9_26","volume-title":"Implementation and Application of Automata","author":"D Reidenbach","year":"2011","unstructured":"Reidenbach, D., Schmid, M.L.: A polynomial time match test for large classes of extended regular expressions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 241\u2013250. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-18098-9_26"},{"issue":"2","key":"1_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297\u2013308 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR26","unstructured":"SVPAlib: Symbolic automata library (2018). \n                      https:\/\/github.com\/lorisdanto\/symbolicautomata"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: POPL, pp. 295\u2013306 (2011)","DOI":"10.1145\/1925844.1926420"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Veanes, M., Halleux, P.D., Tillmann, N.: Rex: symbolic regular expression explorer. In: ICST, pp. 498\u2013507 (2010)","DOI":"10.1109\/ICST.2010.15"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25540-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:02:42Z","timestamp":1562929362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25540-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255398","9783030255404"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25540-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}