Automatic Complexity Analysis
Identifieur interne : 001001 ( Istex/Curation ); précédent : 001000; suivant : 001002Automatic Complexity Analysis
Auteurs : Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2002.
Abstract
Abstract: We consider the problem of automating the derivation of tight asymptotic complexity bounds for solving Horn clauses. Clearly, the solving time crucially depends on the “sparseness” of the computed relations. Therefore, our asymptotic runtime analysis is accompanied by an asymptotic sparsity calculus together with an asymptotic sparsity analysis. The technical problem here is that least fixpoint iteration fails on asymptotic complexity expressions: the intuitive reason is that O(1)+ srO(1) = O(1) but O(1) + ⋯ + O(1) may return any value.
Url:
DOI: 10.1007/3-540-45927-8_18
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001112
Links to Exploration step
ISTEX:EB7186CC090D19320A84864F0CB4065CC4B95D28Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Automatic Complexity Analysis</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
<affiliation wicri:level="1"><mods:affiliation>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby, Denmark</mods:affiliation>
<country xml:lang="fr">Danemark</country>
<wicri:regionArea>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: nielson@imm.dtu.dk</mods:affiliation>
<country wicri:rule="url">Danemark</country>
</affiliation>
</author>
<author><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name>
<affiliation wicri:level="1"><mods:affiliation>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby, Denmark</mods:affiliation>
<country xml:lang="fr">Danemark</country>
<wicri:regionArea>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: riis@imm.dtu.dk</mods:affiliation>
<country wicri:rule="url">Danemark</country>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation wicri:level="1"><mods:affiliation>Fachbereich IV — Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Fachbereich IV — Informatik, Universität Trier, D-54286, Trier</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: seidl@uni-trier.de</mods:affiliation>
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:EB7186CC090D19320A84864F0CB4065CC4B95D28</idno>
<date when="2002" year="2002">2002</date>
<idno type="doi">10.1007/3-540-45927-8_18</idno>
<idno type="url">https://api.istex.fr/document/EB7186CC090D19320A84864F0CB4065CC4B95D28/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001112</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001112</idno>
<idno type="wicri:Area/Istex/Curation">001001</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Automatic Complexity Analysis</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
<affiliation wicri:level="1"><mods:affiliation>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby, Denmark</mods:affiliation>
<country xml:lang="fr">Danemark</country>
<wicri:regionArea>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: nielson@imm.dtu.dk</mods:affiliation>
<country wicri:rule="url">Danemark</country>
</affiliation>
</author>
<author><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name>
<affiliation wicri:level="1"><mods:affiliation>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby, Denmark</mods:affiliation>
<country xml:lang="fr">Danemark</country>
<wicri:regionArea>Informatics and Mathematical Modelling, The Technical University of Denmark, DK-2800, Kongens Lyngby</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: riis@imm.dtu.dk</mods:affiliation>
<country wicri:rule="url">Danemark</country>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation wicri:level="1"><mods:affiliation>Fachbereich IV — Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Fachbereich IV — Informatik, Universität Trier, D-54286, Trier</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: seidl@uni-trier.de</mods:affiliation>
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2002</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">EB7186CC090D19320A84864F0CB4065CC4B95D28</idno>
<idno type="DOI">10.1007/3-540-45927-8_18</idno>
<idno type="ChapterID">18</idno>
<idno type="ChapterID">Chap18</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We consider the problem of automating the derivation of tight asymptotic complexity bounds for solving Horn clauses. Clearly, the solving time crucially depends on the “sparseness” of the computed relations. Therefore, our asymptotic runtime analysis is accompanied by an asymptotic sparsity calculus together with an asymptotic sparsity analysis. The technical problem here is that least fixpoint iteration fails on asymptotic complexity expressions: the intuitive reason is that O(1)+ srO(1) = O(1) but O(1) + ⋯ + O(1) may return any value.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001001 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001001 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= Istex |étape= Curation |type= RBID |clé= ISTEX:EB7186CC090D19320A84864F0CB4065CC4B95D28 |texte= Automatic Complexity Analysis }}
This area was generated with Dilib version V0.6.31. |