UnivTrevesV1, Main, Curation, bibRecord, 001E42

Control-Flow Analysis in Cubic Time

Identifieur interne : 001E42 ( Main/Curation ); précédent : 001E41; suivant : 001E43

Control-Flow Analysis in Cubic Time

Auteurs : Flemming Nielson [Danemark] ; Helmut Seidl [Allemagne]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.

RBID : ISTEX:D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB

Descripteurs français

Pascal (Inist)
- Analyse programme, Analyse temporelle, Champ écoulement, Clause Horn, Commande écoulement, Instrument musique, Méthode cas pire, Orienté objet, Pavage.

English descriptors

KwdEn :
- Flow control, Flow field, Horn clauses, Musical instrument, Object oriented, Program analysis, Tiling, Time analysis, Worst case method.

Abstract

Abstract: It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of control flow analysis to calculi of computation (like the π-calculus and the ambient calculus) have reported considerably higher complexities. In this paper we introduce two general techniques, the use of Horn clauses with sharing and the use of tiling of Horn clauses, for reducing the worst-case complexity of analyses. Applying these techniques to the π-calculus and the ambient calculus we reduce the complexity from O(n 5) to O(n 3) in both cases.

Url:

https://api.istex.fr/document/D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB/fulltext/pdf

DOI: 10.1007/3-540-45309-1_17

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

to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001185
to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001073
to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000C46
to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002116
to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000E42
to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000115
to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000C08
to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002164

Links to Exploration step

ISTEX:D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Control-Flow Analysis in Cubic Time</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45309-1_17</idno>
<idno type="url">https://api.istex.fr/document/D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001185</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001185</idno>
<idno type="wicri:Area/Istex/Curation">001073</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C46</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C46</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Nielson F:control:flow:analysis</idno>
<idno type="wicri:Area/Main/Merge">002116</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:01-0247617</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000E42</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000115</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000C08</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C08</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Nielson F:control:flow:analysis</idno>
<idno type="wicri:Area/Main/Merge">002164</idno>
<idno type="wicri:Area/Main/Curation">001E42</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Control-Flow Analysis in Cubic Time</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
<affiliation wicri:level="1"><country xml:lang="fr">Danemark</country>
<wicri:regionArea>Computer Science Department, Aarhus University, (Bldg. 540) Ny Munkegade, DK-8000, cAarhus C</wicri:regionArea>
<wicri:noRegion>cAarhus C</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><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"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>FB IV ― Informatik, Universität Trier, D-54286, Trier</wicri:regionArea>
<wicri:noRegion>54286, Trier</wicri:noRegion>
<wicri:noRegion>Trier</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB</idno>
<idno type="DOI">10.1007/3-540-45309-1_17</idno>
<idno type="ChapterID">17</idno>
<idno type="ChapterID">Chap17</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Flow control</term>
<term>Flow field</term>
<term>Horn clauses</term>
<term>Musical instrument</term>
<term>Object oriented</term>
<term>Program analysis</term>
<term>Tiling</term>
<term>Time analysis</term>
<term>Worst case method</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Analyse programme</term>
<term>Analyse temporelle</term>
<term>Champ écoulement</term>
<term>Clause Horn</term>
<term>Commande écoulement</term>
<term>Instrument musique</term>
<term>Méthode cas pire</term>
<term>Orienté objet</term>
<term>Pavage</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of control flow analysis to calculi of computation (like the π-calculus and the ambient calculus) have reported considerably higher complexities. In this paper we introduce two general techniques, the use of Horn clauses with sharing and the use of tiling of Horn clauses, for reducing the worst-case complexity of analyses. Applying these techniques to the π-calculus and the ambient calculus we reduce the complexity from O(n 5) to O(n 3) in both cases.</div>
</front>
</TEI>
<double idat="0302-9743:2001:Nielson F:control:flow:analysis"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Control-flow analysis in cubic time</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>Computer Science Department, Aarhus University (Bldg. 540), Ny Munkegade</s1>
<s2>8000 Aarhus </s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Danemark</country>
<wicri:noRegion>8000 Aarhus </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>FB IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 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">01-0247617</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0247617 INIST</idno>
<idno type="RBID">Pascal:01-0247617</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000E42</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000115</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000C08</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C08</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Nielson F:control:flow:analysis</idno>
<idno type="wicri:Area/Main/Merge">002164</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Control-flow analysis in cubic time</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>Computer Science Department, Aarhus University (Bldg. 540), Ny Munkegade</s1>
<s2>8000 Aarhus </s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Danemark</country>
<wicri:noRegion>8000 Aarhus </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>FB IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 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="2001">2001</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>Flow control</term>
<term>Flow field</term>
<term>Horn clauses</term>
<term>Musical instrument</term>
<term>Object oriented</term>
<term>Program analysis</term>
<term>Tiling</term>
<term>Time analysis</term>
<term>Worst case method</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Commande écoulement</term>
<term>Méthode cas pire</term>
<term>Clause Horn</term>
<term>Instrument musique</term>
<term>Champ écoulement</term>
<term>Analyse temporelle</term>
<term>Orienté objet</term>
<term>Analyse programme</term>
<term>Pavage</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of control flow analysis to calculi of computation (like the π-calculus and the ambient calculus) have reported considerably higher complexities. In this paper we introduce two general techniques, the use of Horn clauses with sharing and the use of tiling of Horn clauses, for reducing the worst-case complexity of analyses. Applying these techniques to the π-calculus and the ambient calculus we reduce the complexity from O(n<sup>5</sup>
) to O(n<sup>3</sup>
) in both cases.</div>
</front>
</TEI>
</INIST>
<ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Control-Flow Analysis in Cubic Time</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45309-1_17</idno>
<idno type="url">https://api.istex.fr/document/D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001185</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001185</idno>
<idno type="wicri:Area/Istex/Curation">001073</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C46</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C46</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Nielson F:control:flow:analysis</idno>
<idno type="wicri:Area/Main/Merge">002116</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Control-Flow Analysis in Cubic Time</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
<affiliation wicri:level="1"><country xml:lang="fr">Danemark</country>
<wicri:regionArea>Computer Science Department, Aarhus University, (Bldg. 540) Ny Munkegade, DK-8000, cAarhus C</wicri:regionArea>
<wicri:noRegion>cAarhus C</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><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"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>FB IV ― Informatik, Universität Trier, D-54286, Trier</wicri:regionArea>
<wicri:noRegion>54286, Trier</wicri:noRegion>
<wicri:noRegion>Trier</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB</idno>
<idno type="DOI">10.1007/3-540-45309-1_17</idno>
<idno type="ChapterID">17</idno>
<idno type="ChapterID">Chap17</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: It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of control flow analysis to calculi of computation (like the π-calculus and the ambient calculus) have reported considerably higher complexities. In this paper we introduce two general techniques, the use of Horn clauses with sharing and the use of tiling of Horn clauses, for reducing the worst-case complexity of analyses. Applying these techniques to the π-calculus and the ambient calculus we reduce the complexity from O(n 5) to O(n 3) in both cases.</div>
</front>
</TEI>
</ISTEX>
</double>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 001E42 | 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=   Curation
   |type=    RBID
   |clé=     ISTEX:D42CAB5F9BF46B05D6F00A8FDD9F10633AF967DB
   |texte=   Control-Flow Analysis in Cubic Time
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	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 l'Université de Trèves

Control-Flow Analysis in Cubic Time

Control-Flow Analysis in Cubic Time

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