Checking Regular Expressions in Cvc5 Proofs

“Checking Regular Expressions in Cvc5 Proofs” by Ofec Israel, Yoni Zohar, Andrew Reynolds, S. Hitarth, Bruno Dutertre, Clark W. Barrett, and Cesare Tinelli. In Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26-29, 2026, Proceedings, Part I, (Armin Biere, Carsten Lutz, and Sara Negri, eds.), 2026, pp. 267-275. Lisbon, Portugal.

Abstract

cvc5 is a state-of-the-art proof-producing SMT solver, capable of solving formulas over a myriad of theories, including Unicode strings. Matching regular expressions against concrete strings is done numerous times during the solving process, and forms a bottleneck in proof-checking for unsatisfiable formulas. We describe three approaches for checking regular expressions in the Eunoia proof-checking framework, and evaluate them on proofs produced by cvc5.

BibTeX entry:

@inproceedings{IZR+26,
   author = {Ofec Israel and Yoni Zohar and Andrew Reynolds and S. Hitarth
	and Bruno Dutertre and Clark W. Barrett and Cesare Tinelli},
   editor = {Armin Biere and Carsten Lutz and Sara Negri},
   title = {Checking Regular Expressions in Cvc5 Proofs},
   booktitle = {Automated Reasoning - 13th International Joint Conference,
	{IJCAR} 2026, Lisbon, Portugal, July 26-29, 2026, Proceedings,
	Part {I}},
   series = {Lecture Notes in Computer Science},
   volume = {16688},
   pages = {267--275},
   publisher = {Springer},
   year = {2026},
   doi = {10.1007/978-3-032-32589-1_16},
   note = {Lisbon, Portugal},
   url = {https://doi.org/10.1007/978-3-032-32589-1_16}
}

(This webpage was created with bibtex2web.)