Showing cs.PLShow all
3 papers · 1 filter
cs.PL2024
Making Formulog Fast: An Argument for Unconventional Datalog Evaluation (Extended Version)
Aaron Bembenek, Michael Greenberg, Stephen Chong
By combining Datalog, SMT solving, and functional programming, the language Formulog provides an appealing mix of features for implementing SMT-based static analyses (e.g., refinem…
cs.PL2020
Formulog: Datalog for SMT-Based Static Analysis (Extended Version)
Aaron Bembenek, Michael Greenberg, Stephen Chong
Satisfiability modulo theories (SMT) solving has become a critical part of many static analyses, including symbolic execution, refinement type checking, and model checking. We prop…
cs.PL2018
FormuLog: Datalog for static analysis involving logical formulae
Aaron Bembenek, Stephen Chong
Datalog has become a popular language for writing static analyses. Because Datalog is very limited, some implementations of Datalog for static analysis have extended it with new la…