Towards more efficient methods for solving regular-expression heavy string constraints

Widespread use of string solvers in the formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context. Designing practical algorithms for the (generally undecidable) satisfiability problem for systems of string co...

Full description

Saved in:
Bibliographic Details
Main Authors: Murphy Berzish, Joel Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka
Format: Default Article
Published: 2022
Subjects:
Information and computing sciences
Mathematical sciences
SMT solving
String solving
String constraints
Regular expressions
Linear length constraints
Heuristics
Online Access:https://hdl.handle.net/2134/21895836.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/21895836.v1

Similar Items