Toward Neural-Network-Guided Program Synthesis and Verification

نویسندگان

چکیده

We propose a novel framework of program and invariant synthesis called neural network-guided synthesis. first show that, by suitably designing training networks, we can extract logical formulas over integers from the weights biases trained networks. Based on idea, have implemented tool to synthesize positive/negative examples implication constraints, obtained promising experimental results. also discuss an application our method for improving qualifier discovery in ICE-learning-based CHC solving, which turn be applied verification inductive Another potential is neural-network-guided variation Solar-Lezama’s sketching.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counter-Example Guided Program Verification

This paper presents a novel counter-example guided abstraction refinement algorithm for the automatic verification of concurrent programs. Our algorithm proceeds in different steps. It first constructs an abstraction of the original program by slicing away a given subset of variables. Then, it uses an external model checker as a backend tool to analyze the correctness of the abstract program. I...

متن کامل

scour modeling piles of kambuzia industrial city bridge using hec-ras and artificial neural network

today, scouring is one of the important topics in the river and coastal engineering so that the most destruction in the bridges is occurred due to this phenomenon. whereas the bridges are assumed as the most important connecting structures in the communications roads in the country and their importance is doubled while floodwater, thus exact design and maintenance thereof is very crucial. f...

Signature Verification Using Neural Network

In this paper we present new improved off-line signature verification system using global and texture features of signatures. This scheme is based on the technique that applies preprocessing on the signature to get a binary image and then calculate the global and texture features points from it and maintain a feature vector. All calculations are done on the basis of these feature points. The fe...

متن کامل

Toward Synthesis of Network Updates

Updates to network configurations are notoriously difficult to implement correctly. Even if the old and new configurations are correct, the update process can introduce transient errors such as forwarding loops, dropped packets, and access control violations. The key factor that makes updates difficult to implement is that networks are distributed systems with hundreds or even thousands of node...

متن کامل

Network Verification in the Light of Program Verification

The fastest tools for network reachability queries use adhoc algorithms to compute all packets from a source S that can reach a destination D. This paper examines whether network reachability can be solved efficiently using existing verification tools. While most verification tools only compute reachability (“Can S reach D?”), we efficiently generalize them to compute all reachable packets. Usi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-88806-0_12