Combining lists with non-stably infinite theories
Identifieur interne : 006375 ( Main/Exploration ); précédent : 006374; suivant : 006376Combining lists with non-stably infinite theories
Auteurs : Pascal Fontaine [France] ; Silvio Ranise [France] ; Calogero G. Zarba [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle.
English descriptors
- KwdEn :
Abstract
In program verification one has often to reason about lists over elements of a given nature. Thus, it becomes important to be able to combine the theory of lists with a generic theory T modeling the elements. This combination can be achieved using the Nelson-Oppen method only if T is stably infinite. The goal of this paper is to relax the stable-infiniteness requirement More specifically, we provide a new method that is able to combine the theory of lists with any theory T of the elements, regardless of whether T is stably infinite or not. The crux of our combination method is to guess an arrangement over a set of variables that is larger than the one considered by Nelson and Oppen. Furthermore, our results entail that. it is also possible to combine T with the more general theory of lists with a length function.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000553
- to stream PascalFrancis, to step Curation: 000485
- to stream PascalFrancis, to step Checkpoint: 000510
- to stream Main, to step Merge: 006647
- to stream Main, to step Curation: 006375
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Combining lists with non-stably infinite theories</title>
<author><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and 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 and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Zarba, Calogero G" sort="Zarba, Calogero G" uniqKey="Zarba C" first="Calogero G." last="Zarba">Calogero G. Zarba</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0291230</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0291230 INIST</idno>
<idno type="RBID">Pascal:05-0291230</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000553</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000485</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000510</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000510</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Fontaine P:combining:lists:with</idno>
<idno type="wicri:Area/Main/Merge">006647</idno>
<idno type="wicri:Area/Main/Curation">006375</idno>
<idno type="wicri:Area/Main/Exploration">006375</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Combining lists with non-stably infinite theories</title>
<author><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and 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 and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Zarba, Calogero G" sort="Zarba, Calogero G" uniqKey="Zarba C" first="Calogero G." last="Zarba">Calogero G. Zarba</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and 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>Artificial intelligence</term>
<term>List processing</term>
<term>Logical programming</term>
<term>Modeling</term>
<term>Program verification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Intelligence artificielle</term>
<term>Traitement liste</term>
<term>Vérification programme</term>
<term>Modélisation</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In program verification one has often to reason about lists over elements of a given nature. Thus, it becomes important to be able to combine the theory of lists with a generic theory T modeling the elements. This combination can be achieved using the Nelson-Oppen method only if T is stably infinite. The goal of this paper is to relax the stable-infiniteness requirement More specifically, we provide a new method that is able to combine the theory of lists with any theory T of the elements, regardless of whether T is stably infinite or not. The crux of our combination method is to guess an arrangement over a set of variables that is larger than the one considered by Nelson and Oppen. Furthermore, our results entail that. it is also possible to combine T with the more general theory of lists with a length function.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
</list>
<tree><country name="France"><noRegion><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
</noRegion>
<name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<name sortKey="Zarba, Calogero G" sort="Zarba, Calogero G" uniqKey="Zarba C" first="Calogero G." last="Zarba">Calogero G. Zarba</name>
</country>
</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 006375 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006375 | 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é= Pascal:05-0291230 |texte= Combining lists with non-stably infinite theories }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |