On Superposition-Based Satisfiability Procedures and Their Combination
Identifieur interne : 006223 ( Main/Exploration ); précédent : 006222; suivant : 006224On Superposition-Based Satisfiability Procedures and Their Combination
Auteurs : Hélène Kirchner ; Silvio Ranise ; Christophe Ringeissen ; Duc Khanh TranSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Abstract: We study how to efficiently combine satisfiability procedures built by using a superposition calculus with satisfiability procedures for theories, for which the superposition calculus may not apply (e.g., for various decidable fragments of Arithmetic). Our starting point is the Nelson-Oppen combination method, where satisfiability procedures cooperate by exchanging entailed (disjunction of) equalities between variables. We show that the superposition calculus deduces sufficiently many such equalities for convex theories (e.g., the theory of equality and the theory of lists) and disjunction of equalities for non-convex theories (e.g., the theory of arrays) to guarantee the completeness of the combination method. Experimental results on proof obligations extracted from the certification of auto-generated aerospace software confirm the efficiency of the approach. Finally, we show how to make satisfiability procedures built by superposition both incremental and resettable by using a hierarchic variant of the Nelson-Oppen method.
Url:
DOI: 10.1007/11560647_39
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001C25
- to stream Istex, to step Curation: 001C04
- to stream Istex, to step Checkpoint: 001537
- to stream Main, to step Merge: 006448
- to stream PascalFrancis, to step Corpus: 000502
- to stream PascalFrancis, to step Curation: 000536
- to stream PascalFrancis, to step Checkpoint: 000472
- to stream Main, to step Merge: 006609
- to stream Main, to step Curation: 006223
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On Superposition-Based Satisfiability Procedures and Their Combination</title>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
</author>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
</author>
<author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc Khanh" last="Tran">Duc Khanh Tran</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:7A1E52999C1FAB925076D1745362A7FA87ADF41B</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11560647_39</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-F4KMZM70-Z/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001C25</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001C25</idno>
<idno type="wicri:Area/Istex/Curation">001C04</idno>
<idno type="wicri:Area/Istex/Checkpoint">001537</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001537</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Kirchner H:on:superposition:based</idno>
<idno type="wicri:Area/Main/Merge">006448</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:05-0479611</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000502</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000536</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000472</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000472</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Kirchner H:on:superposition:based</idno>
<idno type="wicri:Area/Main/Merge">006609</idno>
<idno type="wicri:Area/Main/Curation">006223</idno>
<idno type="wicri:Area/Main/Exploration">006223</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On Superposition-Based Satisfiability Procedures and Their Combination</title>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><wicri:noCountry code="subField"> </wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation><wicri:noCountry code="subField"> </wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation><wicri:noCountry code="subField"> </wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc Khanh" last="Tran">Duc Khanh Tran</name>
<affiliation><wicri:noCountry code="subField"> </wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Aerospace</term>
<term>Arithmetics</term>
<term>Certification</term>
<term>Decidability</term>
<term>Disjunction</term>
<term>List processing</term>
<term>Non convex analysis</term>
<term>Satisfiability</term>
<term>Superposition</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Analyse non convexe</term>
<term>Arithmétique</term>
<term>Aérospatiale</term>
<term>Certification</term>
<term>Disjonction</term>
<term>Décidabilité</term>
<term>Satisfiabilité</term>
<term>Superposition</term>
<term>Traitement liste</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We study how to efficiently combine satisfiability procedures built by using a superposition calculus with satisfiability procedures for theories, for which the superposition calculus may not apply (e.g., for various decidable fragments of Arithmetic). Our starting point is the Nelson-Oppen combination method, where satisfiability procedures cooperate by exchanging entailed (disjunction of) equalities between variables. We show that the superposition calculus deduces sufficiently many such equalities for convex theories (e.g., the theory of equality and the theory of lists) and disjunction of equalities for non-convex theories (e.g., the theory of arrays) to guarantee the completeness of the combination method. Experimental results on proof obligations extracted from the certification of auto-generated aerospace software confirm the efficiency of the approach. Finally, we show how to make satisfiability procedures built by superposition both incremental and resettable by using a hierarchic variant of the Nelson-Oppen method.</div>
</front>
</TEI>
<affiliations><list></list>
<tree><noCountry><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc Khanh" last="Tran">Duc Khanh Tran</name>
</noCountry>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006223 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006223 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:7A1E52999C1FAB925076D1745362A7FA87ADF41B |texte= On Superposition-Based Satisfiability Procedures and Their Combination }}
This area was generated with Dilib version V0.6.33. |