Automatic complexity analysis
Identifieur interne : 001F87 ( Main/Merge ); précédent : 001F86; suivant : 001F88Automatic complexity analysis
Auteurs : Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2002.
Descripteurs français
- Pascal (Inist)
English descriptors
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)+ O(1) = O(1) but O(1) +...+ O(1) may return any value.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000D48
- to stream PascalFrancis, to step Curation: 000188
- to stream PascalFrancis, to step Checkpoint: 000B22
Links to Exploration step
Pascal:02-0318071Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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"><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, The Technical University of Denmark</s1><s2>2800 Kongens Lyngby</s2><s3>DNK</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Danemark</country><wicri:noRegion>2800 Kongens Lyngby</wicri:noRegion></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"><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, The Technical University of Denmark</s1><s2>2800 Kongens Lyngby</s2><s3>DNK</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Danemark</country><wicri:noRegion>2800 Kongens Lyngby</wicri:noRegion></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>3 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">02-0318071</idno><date when="2002">2002</date><idno type="stanalyst">PASCAL 02-0318071 INIST</idno><idno type="RBID">Pascal:02-0318071</idno><idno type="wicri:Area/PascalFrancis/Corpus">000D48</idno><idno type="wicri:Area/PascalFrancis/Curation">000188</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000B22</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B22</idno><idno type="wicri:doubleKey">0302-9743:2002:Nielson F:automatic:complexity:analysis</idno><idno type="wicri:Area/Main/Merge">001F87</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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"><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, The Technical University of Denmark</s1><s2>2800 Kongens Lyngby</s2><s3>DNK</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Danemark</country><wicri:noRegion>2800 Kongens Lyngby</wicri:noRegion></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"><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, The Technical University of Denmark</s1><s2>2800 Kongens Lyngby</s2><s3>DNK</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Danemark</country><wicri:noRegion>2800 Kongens Lyngby</wicri:noRegion></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>3 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</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="2002">2002</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>Asymptotic behavior</term><term>Automatic analysis</term><term>Horn clauses</term><term>Program analysis</term><term>Sparse matrix</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Clause Horn</term><term>Comportement asymptotique</term><term>Analyse automatique</term><term>Analyse programme</term><term>Matrice creuse</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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)+ O(1) = O(1) but O(1) +...+ O(1) may return any value.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Danemark</li></country></list><tree><country name="Danemark"><noRegion><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name></noRegion><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name></country><country name="Allemagne"><noRegion><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F87 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001F87 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Merge
|type= RBID
|clé= Pascal:02-0318071
|texte= Automatic complexity analysis
}}
| This area was generated with Dilib version V0.6.31. |  |