Combining Lists with Non-stably Infinite Theories
Identifieur interne : 006285 ( Main/Exploration ); précédent : 006284; suivant : 006286Combining Lists with Non-stably Infinite Theories
Auteurs : Franz Baader [Allemagne] ; Andrei Voronkov [Royaume-Uni]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
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 ifT 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.
Url:
DOI: 10.1007/978-3-540-32275-7_4
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002775
- to stream Istex, to step Curation: 002742
- to stream Istex, to step Checkpoint: 001599
- to stream Main, to step Merge: 006510
- to stream Main, to step Curation: 006285
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Combining Lists with Non-stably Infinite Theories</title>
<author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name>
</author>
<author><name sortKey="Voronkov, Andrei" sort="Voronkov, Andrei" uniqKey="Voronkov A" first="Andrei" last="Voronkov">Andrei Voronkov</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:A8490D560218E401AF6033FC261F12910FD05BC1</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/978-3-540-32275-7_4</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-8F5NSKSQ-L/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002775</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002775</idno>
<idno type="wicri:Area/Istex/Curation">002742</idno>
<idno type="wicri:Area/Istex/Checkpoint">001599</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001599</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Baader F:combining:lists:with</idno>
<idno type="wicri:Area/Main/Merge">006510</idno>
<idno type="wicri:Area/Main/Curation">006285</idno>
<idno type="wicri:Area/Main/Exploration">006285</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Combining Lists with Non-stably Infinite Theories</title>
<author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Theoretical Computer Science, TU Dresden</wicri:regionArea>
<wicri:noRegion>TU Dresden</wicri:noRegion>
<wicri:noRegion>TU Dresden</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Voronkov, Andrei" sort="Voronkov, Andrei" uniqKey="Voronkov A" first="Andrei" last="Voronkov">Andrei Voronkov</name>
<affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country>
<wicri:regionArea>University of Manchester</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country>
</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></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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 ifT 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>Allemagne</li>
<li>Royaume-Uni</li>
</country>
</list>
<tree><country name="Allemagne"><noRegion><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name>
</noRegion>
<name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name>
</country>
<country name="Royaume-Uni"><noRegion><name sortKey="Voronkov, Andrei" sort="Voronkov, Andrei" uniqKey="Voronkov A" first="Andrei" last="Voronkov">Andrei Voronkov</name>
</noRegion>
<name sortKey="Voronkov, Andrei" sort="Voronkov, Andrei" uniqKey="Voronkov A" first="Andrei" last="Voronkov">Andrei Voronkov</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 006285 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006285 | 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:A8490D560218E401AF6033FC261F12910FD05BC1 |texte= Combining Lists with Non-stably Infinite Theories }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |