Towards neural-network-guided program synthesis and verification.

Uloženo v:
Podrobná bibliografie
Název: Towards neural-network-guided program synthesis and verification.
Autoři: Kobayashi, Naoki, Sekiyama, Taro, Sato, Issei, Unno, Hiroshi
Zdroj: Formal Methods in System Design; Nov2025, Vol. 67 Issue 2, p222-254, 33p
Témata: ARTIFICIAL neural networks, COMPUTER software correctness, MODEL validation, CODE generators, PREDICATE calculus, CONSTRAINT satisfaction
Abstrakt: We propose a novel framework of program and invariant synthesis called neural network-guided synthesis (NeuGuS). We first show that, by suitably designing and training neural networks, we can extract logical formulas over integers from the weights and biases of the trained neural networks. Based on the idea, we have implemented a tool to synthesize formulas from positive/negative examples and implication constraints, and obtained promising experimental results. We also discuss two applications of our synthesis method. One is the use of our tool for qualifier discovery in the framework of ICE-learning-based CHC solving, which can in turn be applied to program verification and inductive invariant synthesis. Another application is to a new program development framework called oracle-based programming, which is a neural-network-guided variation of Solar-Lezama's program synthesis by sketching. [ABSTRACT FROM AUTHOR]
Copyright of Formal Methods in System Design is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Buďte první, kdo okomentuje tento záznam!
Nejprve se musíte přihlásit.