activity
20202023
most citedAn SMT Solver for Regular Expressions and Linear Arithmetic over String Length

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.SE2023

Genetic Algorithms for Searching a Matrix of Metagrammars for Synthesis

Yixuan Li, Federico Mora, Elizabeth Polgreen +1

Syntax-guided synthesis is a paradigm in program synthesis in which the search space of candidate solutions is constrained by a syntactic template in the form of a grammar. These s…

cs.LO2022

UCLID5: Multi-Modal Formal Modeling, Verification, and Synthesis

Elizabeth Polgreen, Kevin Cheang, Pranav Gaddamadugu +6

UCLID5 is a tool for the multi-modal formal modeling, verification, and synthesis of systems. It enables one to tackle verification problems for heterogeneous systems such as combi…

cs.CL2021

String Theories involving Regular Membership Predicates: From Practice to Theory and Back

Murphy Berzish, Joel D. Day, Vijay Ganesh +4

Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this con…

cs.LO2020★ 1 cited

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length

Murphy Berzish, Mitja Kulczynski, Federico Mora +4

We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length. We implement…

cs.PL2020

Synthesis in Uclid5

Federico Mora, Kevin Cheang, Elizabeth Polgreen +1

We describe an integration of program synthesis into Uclid5, a formal modelling and verification tool. To the best of our knowledge, the new version of Uclid5 is the only tool that…