The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques
Identifieur interne : 004A98 ( Hal/Curation ); précédent : 004A97; suivant : 004A99The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques
Auteurs : Juergen Rilling [Canada] ; Ahmed Seffah [Canada] ; Christophe Bouthier [France]Source :
English descriptors
- mix :
Abstract
The goal of software visualization is to acquire sufficient knowledge about a software system by identifying program artifacts and understanding their relationships. Graphical representations have long been recognized as having an important impact in improving the comprehension of source code. In this paper, we present several visualization techniques that we combine with analytical source code analysis to reduce the amount and, therefore, the complexity of data that has to be displayed. In particular, we focus on static and dynamic program slicing and apply this source code analysis technique on treemaps, Hyperbolic trees, and UML based visualization techniques to support programmers in creating better mental models of the source code. We also introduce our CONCEPT prototype and describe how the presented approaches can be applied to reduce the information complexity for particular source code comprehension applications.
Url:
DOI: 10.1109/VISSOF.2002.1019798
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :004A98
Links to Exploration step
Hal:inria-00100746Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques</title><author><name sortKey="Rilling, Juergen" sort="Rilling, Juergen" uniqKey="Rilling J" first="Juergen" last="Rilling">Juergen Rilling</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-82231" status="VALID"><orgName>Department of Computer Science [Calgary]</orgName><orgName type="acronym">CPSC</orgName><desc><address><addrLine>University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4</addrLine><country key="CA"></country></address><ref type="url">http://www.cpsc.ucalgary.ca/</ref></desc><listRelation><relation active="#struct-106219" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-106219" type="direct"><org type="institution" xml:id="struct-106219" status="VALID"><orgName>University of Calgary</orgName><desc><address><addrLine>2500 University Dr NW Calgary, Alberta, T2N 1N4</addrLine><country key="CA"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Canada</country><placeName><settlement type="city">Calgary</settlement><region type="state">Alberta</region></placeName><orgName type="university">Université de Calgary</orgName></affiliation></author><author><name sortKey="Seffah, Ahmed" sort="Seffah, Ahmed" uniqKey="Seffah A" first="Ahmed" last="Seffah">Ahmed Seffah</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-82231" status="VALID"><orgName>Department of Computer Science [Calgary]</orgName><orgName type="acronym">CPSC</orgName><desc><address><addrLine>University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4</addrLine><country key="CA"></country></address><ref type="url">http://www.cpsc.ucalgary.ca/</ref></desc><listRelation><relation active="#struct-106219" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-106219" type="direct"><org type="institution" xml:id="struct-106219" status="VALID"><orgName>University of Calgary</orgName><desc><address><addrLine>2500 University Dr NW Calgary, Alberta, T2N 1N4</addrLine><country key="CA"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Canada</country><placeName><settlement type="city">Calgary</settlement><region type="state">Alberta</region></placeName><orgName type="university">Université de Calgary</orgName></affiliation></author><author><name sortKey="Bouthier, Christophe" sort="Bouthier, Christophe" uniqKey="Bouthier C" first="Christophe" last="Bouthier">Christophe Bouthier</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2349" status="OLD"><idno type="RNSR">199918294U</idno><orgName>Environment for cooperation</orgName><orgName type="acronym">ECOO</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/ecoo</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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><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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</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/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00100746</idno><idno type="halId">inria-00100746</idno><idno type="halUri">https://hal.inria.fr/inria-00100746</idno><idno type="url">https://hal.inria.fr/inria-00100746</idno><idno type="doi">10.1109/VISSOF.2002.1019798</idno><date when="2002">2002</date><idno type="wicri:Area/Hal/Corpus">004A98</idno><idno type="wicri:Area/Hal/Curation">004A98</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques</title><author><name sortKey="Rilling, Juergen" sort="Rilling, Juergen" uniqKey="Rilling J" first="Juergen" last="Rilling">Juergen Rilling</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-82231" status="VALID"><orgName>Department of Computer Science [Calgary]</orgName><orgName type="acronym">CPSC</orgName><desc><address><addrLine>University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4</addrLine><country key="CA"></country></address><ref type="url">http://www.cpsc.ucalgary.ca/</ref></desc><listRelation><relation active="#struct-106219" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-106219" type="direct"><org type="institution" xml:id="struct-106219" status="VALID"><orgName>University of Calgary</orgName><desc><address><addrLine>2500 University Dr NW Calgary, Alberta, T2N 1N4</addrLine><country key="CA"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Canada</country><placeName><settlement type="city">Calgary</settlement><region type="state">Alberta</region></placeName><orgName type="university">Université de Calgary</orgName></affiliation></author><author><name sortKey="Seffah, Ahmed" sort="Seffah, Ahmed" uniqKey="Seffah A" first="Ahmed" last="Seffah">Ahmed Seffah</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-82231" status="VALID"><orgName>Department of Computer Science [Calgary]</orgName><orgName type="acronym">CPSC</orgName><desc><address><addrLine>University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4</addrLine><country key="CA"></country></address><ref type="url">http://www.cpsc.ucalgary.ca/</ref></desc><listRelation><relation active="#struct-106219" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-106219" type="direct"><org type="institution" xml:id="struct-106219" status="VALID"><orgName>University of Calgary</orgName><desc><address><addrLine>2500 University Dr NW Calgary, Alberta, T2N 1N4</addrLine><country key="CA"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Canada</country><placeName><settlement type="city">Calgary</settlement><region type="state">Alberta</region></placeName><orgName type="university">Université de Calgary</orgName></affiliation></author><author><name sortKey="Bouthier, Christophe" sort="Bouthier, Christophe" uniqKey="Bouthier C" first="Christophe" last="Bouthier">Christophe Bouthier</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2349" status="OLD"><idno type="RNSR">199918294U</idno><orgName>Environment for cooperation</orgName><orgName type="acronym">ECOO</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/ecoo</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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><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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</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/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author></analytic><idno type="DOI">10.1109/VISSOF.2002.1019798</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>analyse de code source</term><term>arbre hyperbolique</term><term>hyperbolic tree</term><term>software visualization</term><term>source code analysis</term><term>treemap</term><term>visualisation de logiciel</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The goal of software visualization is to acquire sufficient knowledge about a software system by identifying program artifacts and understanding their relationships. Graphical representations have long been recognized as having an important impact in improving the comprehension of source code. In this paper, we present several visualization techniques that we combine with analytical source code analysis to reduce the amount and, therefore, the complexity of data that has to be displayed. In particular, we focus on static and dynamic program slicing and apply this source code analysis technique on treemaps, Hyperbolic trees, and UML based visualization techniques to support programmers in creating better mental models of the source code. We also introduce our CONCEPT prototype and describe how the presented approaches can be applied to reduce the information complexity for particular source code comprehension applications.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques</title><author role="aut"><persName><forename type="first">Juergen</forename><surname>Rilling</surname></persName><email></email><idno type="halauthor">131978</idno><orgName ref="#struct-365169"></orgName><affiliation ref="#struct-82231"></affiliation></author><author role="aut"><persName><forename type="first">Ahmed</forename><surname>Seffah</surname></persName><email></email><idno type="halauthor">131979</idno><orgName ref="#struct-365169"></orgName><affiliation ref="#struct-82231"></affiliation></author><author role="aut"><persName><forename type="first">Christophe</forename><surname>Bouthier</surname></persName><email>bouthier@loria.fr</email><idno type="halauthor">131038</idno><orgName ref="#struct-441569"></orgName><affiliation ref="#struct-2349"></affiliation></author><editor role="depositor"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 14:50:13</date><date type="whenModified">2016-05-19 01:09:08</date><date type="whenReleased">2006-09-28 15:22:47</date><date type="whenProduced">2002</date></edition><respStmt><resp>contributor</resp><name key="108626"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">inria-00100746</idno><idno type="halUri">https://hal.inria.fr/inria-00100746</idno><idno type="halBibtex">rilling:inria-00100746</idno><idno type="halRefHtml">1st International Workshop on Visualizing Software for Understanding and Analysis - VISSOFT'2002, 2002, Paris, France, IEEE, pp.90-99, 2002, 1st International Workshop on Visualizing Software for Understanding and Analysis. <10.1109/VISSOF.2002.1019798></idno><idno type="halRef">1st International Workshop on Visualizing Software for Understanding and Analysis - VISSOFT'2002, 2002, Paris, France, IEEE, pp.90-99, 2002, 1st International Workshop on Visualizing Software for Understanding and Analysis. <10.1109/VISSOF.2002.1019798></idno></publicationStmt><seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</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-NSS" p="LORIA">Réseaux, systèmes et services</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno></seriesStmt><notesStmt><note type="commentary">Colloque avec actes et comité de lecture. internationale./http://ieeexplore.ieee.org/</note><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">The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques</title><author role="aut"><persName><forename type="first">Juergen</forename><surname>Rilling</surname></persName><idno type="halAuthorId">131978</idno><orgName ref="#struct-365169"></orgName><affiliation ref="#struct-82231"></affiliation></author><author role="aut"><persName><forename type="first">Ahmed</forename><surname>Seffah</surname></persName><idno type="halAuthorId">131979</idno><orgName ref="#struct-365169"></orgName><affiliation ref="#struct-82231"></affiliation></author><author role="aut"><persName><forename type="first">Christophe</forename><surname>Bouthier</surname></persName><email>bouthier@loria.fr</email><idno type="halAuthorId">131038</idno><orgName ref="#struct-441569"></orgName><affiliation ref="#struct-2349"></affiliation></author></analytic><monogr><idno type="localRef">A02-R-049 || rilling02a</idno><meeting><title>1st International Workshop on Visualizing Software for Understanding and Analysis - VISSOFT'2002</title><date type="start">2002</date><settlement>Paris, France</settlement></meeting><respStmt><resp>conferenceOrganizer</resp><name>IEEE</name></respStmt><imprint><publisher>IEEE</publisher><biblScope unit="serie">1st International Workshop on Visualizing Software for Understanding and Analysis</biblScope><biblScope unit="pp">90-99</biblScope><date type="datePub">2002</date></imprint></monogr><idno type="doi">10.1109/VISSOF.2002.1019798</idno></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">visualisation de logiciel</term><term xml:lang="en">hyperbolic tree</term><term xml:lang="en">software visualization</term><term xml:lang="en">source code analysis</term><term xml:lang="en">treemap</term><term xml:lang="en">analyse de code source</term><term xml:lang="en">arbre hyperbolique</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halTypology" n="COMM">Conference papers</classCode></textClass><abstract xml:lang="en">The goal of software visualization is to acquire sufficient knowledge about a software system by identifying program artifacts and understanding their relationships. Graphical representations have long been recognized as having an important impact in improving the comprehension of source code. In this paper, we present several visualization techniques that we combine with analytical source code analysis to reduce the amount and, therefore, the complexity of data that has to be displayed. In particular, we focus on static and dynamic program slicing and apply this source code analysis technique on treemaps, Hyperbolic trees, and UML based visualization techniques to support programmers in creating better mental models of the source code. We also introduce our CONCEPT prototype and describe how the presented approaches can be applied to reduce the information complexity for particular source code comprehension applications.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004A98 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 004A98 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Curation
|type= RBID
|clé= Hal:inria-00100746
|texte= The CONCEPT Project Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques
}}
| This area was generated with Dilib version V0.6.33. |  |