101 citations · 260 across the 46 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2023
Embedded Finite Models Beyond Restricted Quantifier Collapse
Michael Benedikt, Ehud Hrushovski
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This form…
cs.LO2018
Polynomial Invariants for Affine Programs
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly +1
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-determin…