InforLorV4, PascalFrancis, Checkpoint, bibRecord, 000472

On superposition-based satisfiability procedures and their combination

Identifieur interne : 000472 ( PascalFrancis/Checkpoint ); précédent : 000471; suivant : 000473

On superposition-based satisfiability procedures and their combination

Auteurs : Hélène Kirchner [France] ; Silvio Ranise [France] ; Christophe Ringeissen [France] ; DUC KHANH TRAN [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2005.

RBID : Pascal:05-0479611

Descripteurs français

Pascal (Inist)
- Décidabilité, Traitement liste, Superposition, Satisfiabilité, Disjonction, Certification, Aérospatiale, Arithmétique, Analyse non convexe.

English descriptors

KwdEn :
- Aerospace, Arithmetics, Certification, Decidability, Disjunction, List processing, Non convex analysis, Satisfiability, Superposition.

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.

Affiliations:

France

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000502
to stream PascalFrancis, to step Curation: 000536

Links to Exploration step

Pascal:05-0479611

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Duc Khanh Tran" sort="Duc Khanh Tran" uniqKey="Duc Khanh Tran" last="Duc Khanh Tran">DUC KHANH TRAN</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0479611</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0479611 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>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Duc Khanh Tran" sort="Duc Khanh Tran" uniqKey="Duc Khanh Tran" last="Duc Khanh Tran">DUC KHANH TRAN</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<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>Décidabilité</term>
<term>Traitement liste</term>
<term>Superposition</term>
<term>Satisfiabilité</term>
<term>Disjonction</term>
<term>Certification</term>
<term>Aérospatiale</term>
<term>Arithmétique</term>
<term>Analyse non convexe</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>3722</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>On superposition-based satisfiability procedures and their combination</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Theoretical aspects of computing - ICTAC 2005 : Second international colloquium, Hanoi, Vietnam, October 17-21, 2005, proceedings</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>KIRCHNER (Hélène)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RANISE (Silvio)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RINGEISSEN (Christophe)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>DUC KHANH TRAN</s1>
</fA11>
<fA14 i1="01"><s1>LORIA & INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>594-608</s1>
</fA20>
<fA21><s1>2005</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-29107-5</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124518530390</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>16 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>05-0479611</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Decidability</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Traitement liste</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>List processing</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Tratamiento lista</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Superposition</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Superposition</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Superposición</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Satisfiabilité</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Satisfiability</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Satisfactibilidad</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Disjonction</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Disjunction</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Disyunción</s0>
<s5>20</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Certification</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Certification</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Certificación</s0>
<s5>21</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Aérospatiale</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Aerospace</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Aeroespacial</s0>
<s5>22</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Arithmétique</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Arithmetics</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Aritmética</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Analyse non convexe</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Non convex analysis</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Análisis no convexo</s0>
<s5>24</s5>
</fC03>
<fN21><s1>339</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ICTAC : international colloquium on theoretical aspects of computing</s1>
<s2>2</s2>
<s3>Hanoi VNM</s3>
<s4>2005-10-17</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
</country>
</list>
<tree><country name="France"><noRegion><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
</noRegion>
<name sortKey="Duc Khanh Tran" sort="Duc Khanh Tran" uniqKey="Duc Khanh Tran" last="Duc Khanh Tran">DUC KHANH TRAN</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>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000472 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000472 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:05-0479611
   |texte=   On superposition-based satisfiability procedures and their combination
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

On superposition-based satisfiability procedures and their combination

On superposition-based satisfiability procedures and their combination

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri