Zobrazeno 1 - 10
of 29
pro vyhledávání: '"reasoning modulo theories"'
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
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
Publikováno v:
37th IARCS Foundation on Software Technology and Theoretical Computer Science
37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩
37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩
International audience; We address the entailment problem for separation logic with symbolic heaps admitting list predicates and permissions for memory cells that are essential to express ownership of a heap region. In the permission-free case, the e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f753c5929d748b352fdce62ae44620f0
Autor:
Korovin, Konstantin
Publikováno v:
Automated Deduction - Cade-22; 2009, p163-166, 4p
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
Autor:
Fontaine, Pascal
Publikováno v:
Journal of Automated Reasoning; Oct2021, Vol. 65 Issue 7, p891-892, 2p
Autor:
Burel, Guillaume, Bury, Guillaume, Cauderlier, Raphaël, Delahaye, David, Halmagrand, Pierre, Hermant, Olivier
Publikováno v:
Journal of Automated Reasoning; Aug2020, Vol. 64 Issue 6, p1001-1050, 50p
Autor:
Echenim, M., Peltier, N.
Publikováno v:
Journal of Automated Reasoning; Feb2020, Vol. 64 Issue 2, p253-294, 42p
Autor:
Andrei Voronkov, Christoph Weidenbach
This Festschrift volume, published in memory of Harald Ganzinger, contains 17 papers from colleagues all over the world and covers all the fields to which Harald Ganzinger dedicated his work during his academic career. The volume begins with a comple
Publikováno v:
Formal Methods in System Design; Dec2017, Vol. 51 Issue 3, p500-532, 33p