Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917319363526656 |
|---|---|
| author | Kouteili, Sam Nicholas Fishell, William Scaff, Christian Santolucito, Mark Piskac, Ruzica |
| author_facet | Kouteili, Sam Nicholas Fishell, William Scaff, Christian Santolucito, Mark Piskac, Ruzica |
| contents | 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 functional updates. This allows us to unify a corresponding procedure for learning the data transformations and temporal specifications of a system. We demonstrate our approach synthesizing reactive programs from mined specifications on the OpenAI-Gymnasium ToyText environments, finding that our method is more robust and orders of magnitude more sample-efficient than passive learning baselines on generalized problem instances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_06710 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications Kouteili, Sam Nicholas Fishell, William Scaff, Christian Santolucito, Mark Piskac, Ruzica Logic in Computer Science Artificial Intelligence Formal Languages and Automata Theory Programming Languages 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 functional updates. This allows us to unify a corresponding procedure for learning the data transformations and temporal specifications of a system. We demonstrate our approach synthesizing reactive programs from mined specifications on the OpenAI-Gymnasium ToyText environments, finding that our method is more robust and orders of magnitude more sample-efficient than passive learning baselines on generalized problem instances. |
| title | Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications |
| topic | Logic in Computer Science Artificial Intelligence Formal Languages and Automata Theory Programming Languages |
| url | https://arxiv.org/abs/2603.06710 |