16 citations · 21 across the 9 of their papers we have counts for
3 papers · 1 filter
On the proof complexity of MCSAT
Gereon Kremer, Erika Abraham, Vijay Ganesh
Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical pro…
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…
On the Hierarchical Community Structure of Practical Boolean Formulas
Chunxiao Li, Jonathan Chung, Soham Mukherjee +5
Modern CDCL SAT solvers easily solve industrial instances containing tens of millions of variables and clauses, despite the theoretical intractability of the SAT problem. This gap…