InforLorV4, Hal, Corpus, bibRecord, 002077

Evolving graph-structures and their implicit computational complexity

Identifieur interne : 002077 ( Hal/Corpus ); précédent : 002076; suivant : 002078

Evolving graph-structures and their implicit computational complexity

Auteurs : Daniel Leivant ; Jean-Yves Marion

Source :

RBID : Hal:hal-00939484

Abstract

Dynamic data-structures are ubiquitous in programming, and they use extensively underlying directed multi-graph structures, such as labeled trees, DAGs, and objects. This paper adapts well-established static analysis methods, namely data ramification and language-based information flow security, to programs over such graph structures. Our programs support the creation, deletion, and updates of both vertices and edges, and are related to pointer machines. The main result states that a function over graph-structures is computable in polynomial time iff it is computed by a terminating program whose graph manipulation is ramified, provided all edges that are both created and read in a loop have the same label.

Url:

https://hal.inria.fr/hal-00939484

Links to Exploration step

Hal:hal-00939484

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Evolving graph-structures and their implicit computational complexity</title>
<author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-399115" status="INCOMING"><orgName>Department of computer science</orgName>
<desc><address><country key="US"></country>
</address>
</desc>
<listRelation><relation active="#struct-12958" type="direct"></relation>
<relation active="#struct-300689" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-12958" type="direct"><org type="laboratory" xml:id="struct-12958" status="VALID"><orgName>Computer Science Departement [Indiana]</orgName>
<desc><address><addrLine>Stright Hall, Room 319 210 South Tenth Street Indiana, PA 15705</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.iup.edu/compsci/default.aspx</ref>
</desc>
<listRelation><relation active="#struct-300689" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300689" type="indirect"><org type="institution" xml:id="struct-300689" status="VALID"><orgName>Indiana University [Bloomington]</orgName>
<desc><address><addrLine>107 S. Indiana AvenueBloomington, IN47405-7000</addrLine>
<country key="US"></country>
</address>
<ref type="url">https://www.indiana.edu/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-29797" status="VALID"><idno type="RNSR">200918992J</idno>
<orgName>Theoretical adverse computations, and safety</orgName>
<orgName type="acronym">CARTE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/carte</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00939484</idno>
<idno type="halId">hal-00939484</idno>
<idno type="halUri">https://hal.inria.fr/hal-00939484</idno>
<idno type="url">https://hal.inria.fr/hal-00939484</idno>
<date when="2013-07-01">2013-07-01</date>
<idno type="wicri:Area/Hal/Corpus">002077</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Evolving graph-structures and their implicit computational complexity</title>
<author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-399115" status="INCOMING"><orgName>Department of computer science</orgName>
<desc><address><country key="US"></country>
</address>
</desc>
<listRelation><relation active="#struct-12958" type="direct"></relation>
<relation active="#struct-300689" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-12958" type="direct"><org type="laboratory" xml:id="struct-12958" status="VALID"><orgName>Computer Science Departement [Indiana]</orgName>
<desc><address><addrLine>Stright Hall, Room 319 210 South Tenth Street Indiana, PA 15705</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.iup.edu/compsci/default.aspx</ref>
</desc>
<listRelation><relation active="#struct-300689" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300689" type="indirect"><org type="institution" xml:id="struct-300689" status="VALID"><orgName>Indiana University [Bloomington]</orgName>
<desc><address><addrLine>107 S. Indiana AvenueBloomington, IN47405-7000</addrLine>
<country key="US"></country>
</address>
<ref type="url">https://www.indiana.edu/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-29797" status="VALID"><idno type="RNSR">200918992J</idno>
<orgName>Theoretical adverse computations, and safety</orgName>
<orgName type="acronym">CARTE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/carte</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Dynamic data-structures are ubiquitous in programming, and they use extensively underlying directed multi-graph structures, such as labeled trees, DAGs, and objects. This paper adapts well-established static analysis methods, namely data ramification and language-based information flow security, to programs over such graph structures. Our programs support the creation, deletion, and updates of both vertices and edges, and are related to pointer machines. The main result states that a function over graph-structures is computable in polynomial time iff it is computed by a terminating program whose graph manipulation is ramified, provided all edges that are both created and read in a loop have the same label.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Evolving graph-structures and their implicit computational complexity</title>
<author role="aut"><persName><forename type="first">Daniel</forename>
<surname>Leivant</surname>
</persName>
<email></email>
<idno type="halauthor">130257</idno>
<orgName ref="#struct-300689"></orgName>
<affiliation ref="#struct-399115"></affiliation>
</author>
<author role="crp"><persName><forename type="first">Jean-Yves</forename>
<surname>Marion</surname>
</persName>
<email>jean-yves.marion@loria.fr</email>
<idno type="halauthor">979366</idno>
<orgName ref="#struct-413289"></orgName>
<affiliation ref="#struct-29797"></affiliation>
</author>
<editor role="depositor"><persName><forename>Jean-Yves</forename>
<surname>Marion</surname>
</persName>
<email>JEAN-YVES.MARION@LORIA.FR</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2014-01-30 19:01:46</date>
<date type="whenModified">2015-09-21 11:12:44</date>
<date type="whenReleased">2014-01-31 08:44:40</date>
<date type="whenProduced">2013-07-01</date>
<date type="whenEndEmbargoed">2014-01-30</date>
<ref type="file" target="https://hal.inria.fr/hal-00939484/document"><date notBefore="2014-01-30"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/hal-00939484/file/LeivantMarion.pdf"><date notBefore="2014-01-30"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="113627"><persName><forename>Jean-Yves</forename>
<surname>Marion</surname>
</persName>
<email>JEAN-YVES.MARION@LORIA.FR</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00939484</idno>
<idno type="halUri">https://hal.inria.fr/hal-00939484</idno>
<idno type="halBibtex">leivant:hal-00939484</idno>
<idno type="halRefHtml">ICALP, Jul 2013, RIGA, Latvia. SPRINGER, 7966, pp.349-360, 2013, LNCS; Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings,Part II</idno>
<idno type="halRef">ICALP, Jul 2013, RIGA, Latvia. SPRINGER, 7966, pp.349-360, 2013, LNCS; Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings,Part II</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Evolving graph-structures and their implicit computational complexity</title>
<author role="aut"><persName><forename type="first">Daniel</forename>
<surname>Leivant</surname>
</persName>
<idno type="halAuthorId">130257</idno>
<orgName ref="#struct-300689"></orgName>
<affiliation ref="#struct-399115"></affiliation>
</author>
<author role="crp"><persName><forename type="first">Jean-Yves</forename>
<surname>Marion</surname>
</persName>
<email>jean-yves.marion@loria.fr</email>
<idno type="halAuthorId">979366</idno>
<orgName ref="#struct-413289"></orgName>
<affiliation ref="#struct-29797"></affiliation>
</author>
</analytic>
<monogr><meeting><title>ICALP</title>
<date type="start">2013-07-01</date>
<settlement>RIGA</settlement>
<country key="LV">Latvia</country>
</meeting>
<imprint><publisher>SPRINGER</publisher>
<biblScope unit="serie"></biblScope>
<biblScope unit="volume">7966</biblScope>
<biblScope unit="pp">349-360</biblScope>
<date type="datePub">2013-04-30</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Dynamic data-structures are ubiquitous in programming, and they use extensively underlying directed multi-graph structures, such as labeled trees, DAGs, and objects. This paper adapts well-established static analysis methods, namely data ramification and language-based information flow security, to programs over such graph structures. Our programs support the creation, deletion, and updates of both vertices and edges, and are related to pointer machines. The main result states that a function over graph-structures is computable in polynomial time iff it is computed by a terminating program whose graph manipulation is ramified, provided all edges that are both created and read in a loop have the same label.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 002077 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:hal-00939484
   |texte=   Evolving graph-structures and their implicit computational complexity
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	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 la recherche en informatique en Lorraine

Evolving graph-structures and their implicit computational complexity

Evolving graph-structures and their implicit computational complexity

Source :

Abstract

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