{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:11Z","timestamp":1750308431421,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["Universal"],"award-info":[{"award-number":["Universal"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["PrInt"],"award-info":[{"award-number":["PrInt"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,9,25]]},"DOI":"10.1145\/3624309.3624310","type":"proceedings-article","created":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T22:06:36Z","timestamp":1698962796000},"page":"91-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Lushu: Ofusca\u00e7\u00e3o de Dados Sigilosos via Reconhecimento de Linguagens a partir de Exemplos"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6155-4201","authenticated-orcid":false,"given":"Alexander","family":"Holmquist","sequence":"first","affiliation":[{"name":"Universidade Federal de Minas Gerais, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0994-7828","authenticated-orcid":false,"given":"Vitor","family":"Emanuel","sequence":"additional","affiliation":[{"name":"Universidade Federal de Minas Gerais, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0375-1657","authenticated-orcid":false,"given":"Fernando","family":"Pereira","sequence":"additional","affiliation":[{"name":"Universidade Federal de Minas Gerais, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2023,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Learning regular sets from queries and counterexamples. Information and computation 75, 2","author":"Angluin Dana","year":"1987","unstructured":"Dana Angluin. 1987. Learning regular sets from queries and counterexamples. Information and computation 75, 2 (1987), 87\u2013106."},{"key":"e_1_3_2_1_2_1","unstructured":"[2] CCPA. 2020. https:\/\/oag.ca.gov\/privacy\/ccpa"},{"key":"e_1_3_2_1_3_1","unstructured":"[3] Datadog. 2023. https:\/\/www.datadoghq.com\/"},{"key":"e_1_3_2_1_4_1","unstructured":"[4] Fluentd. 2023. https:\/\/www.fluentd.org\/"},{"key":"e_1_3_2_1_5_1","unstructured":"[5] GDPR. 2018. https:\/\/gdpr-info.eu\/"},{"key":"e_1_3_2_1_6_1","volume-title":"Language identification in the limit. Information and control 10, 5","author":"Gold E\u00a0Mark","year":"1967","unstructured":"E\u00a0Mark Gold. 1967. Language identification in the limit. Information and control 10, 5 (1967), 447\u2013474."},{"key":"e_1_3_2_1_7_1","first-page":"9","article-title":"A Method for the Construction of Minimum-Redundancy Codes","volume":"40","author":"Huffman A.","year":"1952","unstructured":"David\u00a0A. Huffman. 1952. A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the Institute of Radio Engineers 40, 9 (September 1952), 1098\u20131101.","journal-title":"Proceedings of the Institute of Radio Engineers"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3475061.3475084"},{"key":"e_1_3_2_1_9_1","unstructured":"[9] Lei Geral de Prote\u00e7\u00e3o de Dados. 2018. https:\/\/www.gov.br\/cidadania\/pt-br\/acesso-a-informacao\/lgpd"},{"key":"e_1_3_2_1_10_1","unstructured":"[10] Logstash. 2023. https:\/\/www.elastic.co\/logstash\/"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1972.29"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cola.2022.101153"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cola.2021.101022"},{"volume-title":"AIST (Supplement)","author":"Shcherbakov Andrei","key":"e_1_3_2_1_14_1","unstructured":"Andrei Shcherbakov. 2016. A Branching Alignment-Based Synthesis of Regular Expressions. In AIST (Supplement). Springer, Berlin, Germany, 315\u2013328."},{"key":"e_1_3_2_1_15_1","unstructured":"[15] Splunk. 2023. https:\/\/www.splunk.com\/"},{"key":"e_1_3_2_1_16_1","unstructured":"[16] Sumo Logic. 2023. https:\/\/www.sumologic.com\/"}],"event":{"name":"SBLP 2023: XXVII Brazilian Symposium on Programming Languages","acronym":"SBLP 2023","location":"Campo Grande, MS Brazil"},"container-title":["Proceedings of the XXVII Brazilian Symposium on Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624309.3624310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624309.3624310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:45Z","timestamp":1750268985000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624309.3624310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":16,"alternative-id":["10.1145\/3624309.3624310","10.1145\/3624309"],"URL":"https:\/\/doi.org\/10.1145\/3624309.3624310","relation":{},"subject":[],"published":{"date-parts":[[2023,9,25]]},"assertion":[{"value":"2023-11-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}