Function synthesis for maximizing model counting - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Function synthesis for maximizing model counting

Synthese de fonctions maximisant le nombre de modèles

Thomas Vigouroux
Marius Bozga
Cristian Ene
Laurent Mounier
  • Fonction : Auteur

Résumé

Given a boolean formula ϕ(X, Y, Z), the Max#SAT problem asks for finding a partial model on the set of variables X, maximizing its number of projected models over the set of variables Y. We investigate a strict generalization of Max#SAT allowing dependencies for variables in X, effectively turning it into a synthesis problem. We show that this new problem, called DQMax#SAT, subsumes both the DQBF and DSSAT problems. We provide a general resolution method, based on a reduction to Max#SAT, together with two improvements for dealing with its inherent complexity. We further discuss a concrete application of DQMax#SAT for symbolic synthesis of adaptive attackers in the field of program security. Finally, we report preliminary results obtained on the resolution of benchmark problems using a prototype DQMax#SAT solver implementation.
Fichier principal
Vignette du fichier
main.pdf (328.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04098541 , version 1 (16-05-2023)
hal-04098541 , version 2 (11-09-2023)

Identifiants

Citer

Thomas Vigouroux, Marius Bozga, Cristian Ene, Laurent Mounier. Function synthesis for maximizing model counting. 2023. ⟨hal-04098541v2⟩
73 Consultations
26 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More