Alternate and Learn: Finding Witnesses without Looking All over
Abstract elided by the publisher.
Related papers
- A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations CPP 2017
- Dynamic witnesses for static type errors (or, Ill-Typed Programs Usually Go Wrong) JFP 2018
- A Scalable and Nearly Uniform Generator of SAT Witnesses CAV 2013
- Predictive modeling in a polyhedral optimization space CGO 2011
- Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong) ICFP 2016
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints TACAS 2020
- Losing functions without gaining data: another look at defunctionalisation Haskell 2009
- SMT-Based Active Learning of Weighted Automata CAV 2026