The design of a verified derivative-based parsing tool for regular expressions.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCardoso, Elton Maximo-
Autor(es): dc.creatorAmaro, Maycon José Jorge-
Autor(es): dc.creatorFeitosa, Samuel da Silva-
Autor(es): dc.creatorReis, Leonardo Vieira dos Santos-
Autor(es): dc.creatorBois, André Rauber Du-
Autor(es): dc.creatorRibeiro, Rodrigo Geraldo-
Data de aceite: dc.date.accessioned2025-08-21T15:34:57Z-
Data de disponibilização: dc.date.available2025-08-21T15:34:57Z-
Data de envio: dc.date.issued2022-12-05-
Data de envio: dc.date.issued2022-12-05-
Data de envio: dc.date.issued2020-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/jspui/handle/123456789/15838-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1018900-
Descrição: dc.descriptionWe describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda. The formalization produces a proof that either an input string matches a given regular expression or that no matching exists. A tool for regular expression based search in the style of the well known GNU grep has been developed with the certified algorithms. Practical experiments conducted with this tool are reported.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsaberto-
Direitos: dc.rightsThis work is licensed under a Creative Commons Attribution 4.0 International License. Fonte: Clei Eletronic Journal. <http://www.clei.org/cleiej/index.php/cleiej/article/view/521>. Acesso em: 28 set. 2022.-
Palavras-chave: dc.subjectCertified algorithms-
Palavras-chave: dc.subjectDependent types-
Título: dc.titleThe design of a verified derivative-based parsing tool for regular expressions.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.