Synthesizing Trajectory Queries from Examples

February 16, 2026 ยท Grace Period ยท ๐Ÿ› International Conference on Computer Aided Verification

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Stephen Mell, Favyen Bastani, Steve Zdancewic, Osbert Bastani arXiv ID 2602.15164 Category cs.PL: Programming Languages Citations 2 Venue International Conference on Computer Aided Verification
Abstract
Data scientists often need to write programs to process predictions of machine learning models, such as object detections and trajectories in video data. However, writing such queries can be challenging due to the fuzzy nature of real-world data; in particular, they often include real-valued parameters that must be tuned by hand. We propose a novel framework called Quivr that synthesizes trajectory queries matching a given set of examples. To efficiently synthesize parameters, we introduce a novel technique for pruning the parameter space and a novel quantitative semantics that makes this more efficient. We evaluate Quivr on a benchmark of 17 tasks, including several from prior work, and show both that it can synthesize accurate queries for each task and that our optimizations substantially reduce synthesis time.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Programming Languages