Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Sellami, Yanis"'
We describe a system to prove properties of programs. The key feature of this approach is a method to automatically synthesize inductive invariants of the loops contained in the program. The method is generic, i.e., it applies to a large set of progr
Externí odkaz:
http://arxiv.org/abs/1906.11033
The clausal logical consequences of a formula are called its implicates. The generation of these implicates has several applications, such as the identification of missing hypotheses in a logical specification. We present a procedure that generates t
Externí odkaz:
http://arxiv.org/abs/1807.04557
Autor:
Sellami, Yanis
Publikováno v:
Data Structures and Algorithms [cs.DS]. Université Grenoble Alpes [2020-..], 2020. English. ⟨NNT : 2020GRALM018⟩
This thesis introduces a generic method to compute the prime implicates of a logical formula, i.e., the most general clausal consequences of a given logical formula, in any given decidable theory. The principle used is to recursively add to an initia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::f339f76577a1094bd55348e0e61ab695
https://tel.archives-ouvertes.fr/tel-02990726/document
https://tel.archives-ouvertes.fr/tel-02990726/document
Autor:
Sellami, Yanis
Publikováno v:
Data Structures and Algorithms [cs.DS]. Université Grenoble Alpes [2020-..], 2020. English. ⟨NNT : 2020GRALM018⟩
This thesis introduces a generic method to compute the prime implicates of a logical formula, i.e., the most general clausal consequences of a given logical formula, in any given decidable theory. The principle used is to recursively add to an initia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::f339f76577a1094bd55348e0e61ab695
https://tel.archives-ouvertes.fr/tel-02990726/document
https://tel.archives-ouvertes.fr/tel-02990726/document