Automated Synthesis of Decision Lists for Polynomial Specifications over Integers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Automated Synthesis of Decision Lists for Polynomial Specifications over Integers

Résumé

In this work, we consider two sets I and O of bounded integer variables, modeling the inputs and outputs of a program. Given a specification Post, which is a Boolean combination of linear or polynomial inequalities with real coefficients over I ∪ O, our goal is to synthesize the weakest possible pre-condition Pre and a program P satisfying the Hoare triple {Pre}P{Post}. We provide a novel, practical, sound and complete algorithm, inspired by Farkas’ Lemma and Handelman’s Theorem, that synthesizes both the program P and the pre-condition Pre over a bounded integral region. Our approach is exact and guaranteed to find the weakest pre-condition. Moreover, it always synthesizes both P and Pre as linear decision lists. Thus, our output consists of simple programs and pre- conditions that facilitate further static analysis. We also provide experimental results over benchmarks showcasing the real-world applicability of our approach and considerable performance gains over the state-of-the-art.
Fichier principal
Vignette du fichier
LPAR.pdf (584.06 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04568906 , version 1 (06-05-2024)

Identifiants

  • HAL Id : hal-04568906 , version 1

Citer

S Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R Govind, Harshit J Motwani, et al.. Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2024), May 2024, Port Louis, Mauritius. ⟨hal-04568906⟩

Collections

TDS-MACS
21 Consultations
43 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More