Sign inGet started
Paper · arXiv

Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications

Mining specifications from execution traces presents an automated way of capturing characteristic system behaviors. However, existing approaches are largely restricted to Boolean abstractions of events, limiting their ability to express data-aware properties. In this paper, we extend mining procedures to operate over richer datatypes. We first establish candidate functions in our domain that cover the set of traces by leveraging Syntax Guided Synthesis (SyGuS) techniques. To capture these function applications temporally, we formalize the semantics of TSL$_f$, a finite-prefix interpretation of Temporal Stream Logic (TSL) that extends LTL$_f$ with support for first-order predicates and fun...

AuthorsSam Nicholas Kouteili, William Fishell, Christian Scaff et al.
Primary categorycs.LO
Published5 March 2026
Last updated at source5 March 2026
cs.LOcs.AIcs.FLcs.PL
Embed this entry
<iframe src="https://silytics.si/embed/item/ccca4174-fe0f-4137-befd-c1bcbacd1a92" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.