Normalizable Horn clauses, strongly recognizable relations, and Spi
Identifieur interne :
000C41 ( PascalFrancis/Corpus );
précédent :
000C40;
suivant :
000C42
Normalizable Horn clauses, strongly recognizable relations, and Spi
Auteurs : Flemming Nielson ;
Hanne Riis Nielson ;
Helmut SeidlSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2002.
RBID : Pascal:03-0334255
Descripteurs français
English descriptors
Abstract
We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2477 |
|---|
| A08 | 01 | 1 | ENG | @1 Normalizable Horn clauses, strongly recognizable relations, and Spi |
|---|
| A09 | 01 | 1 | ENG | @1 SAS 2002 : static analysis : Madrid, 17-20 September 2002 |
|---|
| A11 | 01 | 1 | | @1 NIELSON (Flemming) |
|---|
| A11 | 02 | 1 | | @1 NIELSON (Hanne Riis) |
|---|
| A11 | 03 | 1 | | @1 SEIDL (Helmut) |
|---|
| A12 | 01 | 1 | | @1 HERMENEGILDO (Manuel V.) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 PUEBLA (German) @9 ed. |
|---|
| A14 | 01 | | | @1 Informatics and Mathematical Modelling, Technical University of Denmark @2 2800 Kongens Lyngby @3 DNK @Z 1 aut. @Z 2 aut. |
|---|
| A14 | 02 | | | @1 Universität Trier, FB IV - Informatik @2 54286 Trier @3 DEU @Z 3 aut. |
|---|
| A20 | | | | @1 20-35 |
|---|
| A21 | | | | @1 2002 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-44235-9 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000108467320020 |
|---|
| A44 | | | | @0 0000 @1 © 2003 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 18 ref. |
|---|
| A47 | 01 | 1 | | @0 03-0334255 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14]. |
|---|
| C02 | 01 | X | | @0 001D02A02 |
|---|
| C03 | 01 | X | FRE | @0 Fermeture transitive @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Transitive closure @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Cerradura transitiva @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Analyse programme @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Program analysis @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Análisis programa @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Temps polynomial @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Polynomial time @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Tiempo polinomial @5 03 |
|---|
| C03 | 04 | 3 | FRE | @0 Clause Horn @5 04 |
|---|
| C03 | 04 | 3 | ENG | @0 Horn clauses @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Spi calcul @4 CD @5 96 |
|---|
| C03 | 05 | X | ENG | @0 Spi calculus @4 CD @5 96 |
|---|
| N21 | | | | @1 230 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International symposium on static analysis @3 Madrid ESP @4 2002-09-17 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 03-0334255 INIST |
|---|
| ET : | Normalizable Horn clauses, strongly recognizable relations, and Spi |
|---|
| AU : | NIELSON (Flemming); NIELSON (Hanne Riis); SEIDL (Helmut); HERMENEGILDO (Manuel V.); PUEBLA (German) |
|---|
| AF : | Informatics and Mathematical Modelling, Technical University of Denmark/2800 Kongens Lyngby/Danemark (1 aut., 2 aut.); Universität Trier, FB IV - Informatik/54286 Trier/Allemagne (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2477; Pp. 20-35; Bibl. 18 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14]. |
|---|
| CC : | 001D02A02 |
|---|
| FD : | Fermeture transitive; Analyse programme; Temps polynomial; Clause Horn; Spi calcul |
|---|
| ED : | Transitive closure; Program analysis; Polynomial time; Horn clauses; Spi calculus |
|---|
| SD : | Cerradura transitiva; Análisis programa; Tiempo polinomial |
|---|
| LO : | INIST-16343.354000108467320020 |
|---|
| ID : | 03-0334255 |
|---|
Links to Exploration step
Pascal:03-0334255
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Normalizable Horn clauses, strongly recognizable relations, and Spi</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
<affiliation><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, Technical University of Denmark</s1>
<s2>2800 Kongens Lyngby</s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name>
<affiliation><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, Technical University of Denmark</s1>
<s2>2800 Kongens Lyngby</s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation><inist:fA14 i1="02"><s1>Universität Trier, FB IV - Informatik</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0334255</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0334255 INIST</idno>
<idno type="RBID">Pascal:03-0334255</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C41</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Normalizable Horn clauses, strongly recognizable relations, and Spi</title>
<author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name>
<affiliation><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, Technical University of Denmark</s1>
<s2>2800 Kongens Lyngby</s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name>
<affiliation><inist:fA14 i1="01"><s1>Informatics and Mathematical Modelling, Technical University of Denmark</s1>
<s2>2800 Kongens Lyngby</s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation><inist:fA14 i1="02"><s1>Universität Trier, FB IV - Informatik</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14><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><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Horn clauses</term>
<term>Polynomial time</term>
<term>Program analysis</term>
<term>Spi calculus</term>
<term>Transitive closure</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Fermeture transitive</term>
<term>Analyse programme</term>
<term>Temps polynomial</term>
<term>Clause Horn</term>
<term>Spi calcul</term>
</keywords><front><div type="abstract" xml:lang="en">We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2477</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Normalizable Horn clauses, strongly recognizable relations, and Spi</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>SAS 2002 : static analysis : Madrid, 17-20 September 2002</s1>
</fA09><fA11 i1="01" i2="1"><s1>NIELSON (Flemming)</s1>
</fA11><fA11 i1="02" i2="1"><s1>NIELSON (Hanne Riis)</s1>
</fA11><fA11 i1="03" i2="1"><s1>SEIDL (Helmut)</s1>
</fA11><fA12 i1="01" i2="1"><s1>HERMENEGILDO (Manuel V.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>PUEBLA (German)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Informatics and Mathematical Modelling, Technical University of Denmark</s1>
<s2>2800 Kongens Lyngby</s2>
<s3>DNK</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="02"><s1>Universität Trier, FB IV - Informatik</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>20-35</s1>
</fA20><fA21><s1>2002</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-44235-9</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108467320020</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>18 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>03-0334255</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Fermeture transitive</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Transitive closure</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Cerradura transitiva</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Analyse programme</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Program analysis</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Análisis programa</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Temps polynomial</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Polynomial time</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Tiempo polinomial</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="3" l="FRE"><s0>Clause Horn</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="3" l="ENG"><s0>Horn clauses</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Spi calcul</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Spi calculus</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>230</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>International symposium on static analysis</s1>
<s3>Madrid ESP</s3>
<s4>2002-09-17</s4>
</fA30><server><NO>PASCAL 03-0334255 INIST</NO>
<ET>Normalizable Horn clauses, strongly recognizable relations, and Spi</ET>
<AU>NIELSON (Flemming); NIELSON (Hanne Riis); SEIDL (Helmut); HERMENEGILDO (Manuel V.); PUEBLA (German)</AU>
<AF>Informatics and Mathematical Modelling, Technical University of Denmark/2800 Kongens Lyngby/Danemark (1 aut., 2 aut.); Universität Trier, FB IV - Informatik/54286 Trier/Allemagne (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2477; Pp. 20-35; Bibl. 18 ref.</SO>
<LA>Anglais</LA>
<EA>We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].</EA>
<CC>001D02A02</CC>
<FD>Fermeture transitive; Analyse programme; Temps polynomial; Clause Horn; Spi calcul</FD>
<ED>Transitive closure; Program analysis; Polynomial time; Horn clauses; Spi calculus</ED>
<SD>Cerradura transitiva; Análisis programa; Tiempo polinomial</SD>
<LO>INIST-16343.354000108467320020</LO>
<ID>03-0334255</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C41 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C41 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:03-0334255
|texte= Normalizable Horn clauses, strongly recognizable relations, and Spi
}}
| 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 |  |
