Manipulating Algebraic Specifications with Term-based and Graph-based Representations
Identifieur interne : 003082 ( Hal/Corpus ); précédent : 003081; suivant : 003083Manipulating Algebraic Specifications with Term-based and Graph-based Representations
Auteurs : Anamaria Martins Moreira ; Christophe Ringeissen ; David Déharbe ; Gleydson LimaSource :
Descripteurs français
- mix :
Abstract
In an environment of continuous and rapid evolution, software design methodologies must incorporate techniques and tools that support changes in software artifacts. In the FERUS project, we are developing a tool targeted at software designers that integrates a collection of operations on algebraic specifications written in the CASL language. The scope of FERUS includes not only modification of existing specifications, but also creation or derivation of new specifications, as well as their proof and execution, which are realized through inter-operability with existing tools. As FERUS involves the manipulation of software specification and inter-operability with other tools, the question of choosing appropriate representation formats is important. In this paper, we discuss the advantages and limitations of ATerms as a manipulation and exchange format in the setting of FERUS. We also present a new, graph-like format, which offers complementary features to a term-based format. Moreover, we present visualization utilities for these formats.
Url:
Links to Exploration step
Hal:inria-00099983Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Manipulating Algebraic Specifications with Term-based and Graph-based Representations</title><author><name sortKey="Martins Moreira, Anamaria" sort="Martins Moreira, Anamaria" uniqKey="Martins Moreira A" first="Anamaria" last="Martins Moreira">Anamaria Martins Moreira</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2360" status="OLD"><idno type="RNSR">199221357D</idno><orgName>Constraints, automatic deduction and software properties proofs</orgName><orgName type="acronym">PROTHEO</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/protheo</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></affiliation></author><author><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name></author><author><name sortKey="Lima, Gleydson" sort="Lima, Gleydson" uniqKey="Lima G" first="Gleydson" last="Lima">Gleydson Lima</name></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00099983</idno><idno type="halId">inria-00099983</idno><idno type="halUri">https://hal.inria.fr/inria-00099983</idno><idno type="url">https://hal.inria.fr/inria-00099983</idno><date when="2004">2004</date><idno type="wicri:Area/Hal/Corpus">003082</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Manipulating Algebraic Specifications with Term-based and Graph-based Representations</title><author><name sortKey="Martins Moreira, Anamaria" sort="Martins Moreira, Anamaria" uniqKey="Martins Moreira A" first="Anamaria" last="Martins Moreira">Anamaria Martins Moreira</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2360" status="OLD"><idno type="RNSR">199221357D</idno><orgName>Constraints, automatic deduction and software properties proofs</orgName><orgName type="acronym">PROTHEO</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/protheo</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></affiliation></author><author><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name></author><author><name sortKey="Lima, Gleydson" sort="Lima, Gleydson" uniqKey="Lima G" first="Gleydson" last="Lima">Gleydson Lima</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>algebraic specification</term><term>casl</term><term>elan</term><term>formal specification</term><term>format d'échange</term><term>génie logiciel</term><term>interchange format</term><term>interopérabilité</term><term>réutilisation</term><term>software engineering</term><term>software reuse</term><term>spécification algébrique</term><term>spécification formelle</term><term>tool inter-operability</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In an environment of continuous and rapid evolution, software design methodologies must incorporate techniques and tools that support changes in software artifacts. In the FERUS project, we are developing a tool targeted at software designers that integrates a collection of operations on algebraic specifications written in the CASL language. The scope of FERUS includes not only modification of existing specifications, but also creation or derivation of new specifications, as well as their proof and execution, which are realized through inter-operability with existing tools. As FERUS involves the manipulation of software specification and inter-operability with other tools, the question of choosing appropriate representation formats is important. In this paper, we discuss the advantages and limitations of ATerms as a manipulation and exchange format in the setting of FERUS. We also present a new, graph-like format, which offers complementary features to a term-based format. Moreover, we present visualization utilities for these formats.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Manipulating Algebraic Specifications with Term-based and Graph-based Representations</title><author role="aut"><persName><forename type="first">Anamaria</forename><surname>Martins Moreira</surname></persName><email></email><idno type="halauthor">131233</idno><orgName ref="#struct-364951"></orgName></author><author role="aut"><persName><forename type="first">Christophe</forename><surname>Ringeissen</surname></persName><email></email><idno type="idhal">christophe-ringeissen</idno><idno type="halauthor">129590</idno><orgName ref="#struct-300009"></orgName><affiliation ref="#struct-2360"></affiliation></author><author role="aut"><persName><forename type="first">David</forename><surname>Déharbe</surname></persName><email></email><idno type="halauthor">131234</idno><orgName ref="#struct-364951"></orgName></author><author role="aut"><persName><forename type="first">Gleydson</forename><surname>Lima</surname></persName><email></email><idno type="halauthor">131235</idno><orgName ref="#struct-364951"></orgName></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 10:13:04</date><date type="whenModified">2016-05-19 01:09:37</date><date type="whenReleased">2006-09-28 15:22:46</date><date type="whenProduced">2004</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-00099983</idno><idno type="halUri">https://hal.inria.fr/inria-00099983</idno><idno type="halBibtex">martinsmoreira:inria-00099983</idno><idno type="halRefHtml">The Journal of Logic and Algebraic Programming, 2004, 59 (1-2), pp.63-87</idno><idno type="halRef">The Journal of Logic and Algebraic Programming, 2004, 59 (1-2), pp.63-87</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-FM" p="LORIA">Méthodes formelles</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</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">Special Issue on Annotated Terms (ATerms). Article dans revue scientifique avec comité de lecture. nationale.</note><note type="audience" n="3">National</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Manipulating Algebraic Specifications with Term-based and Graph-based Representations</title><author role="aut"><persName><forename type="first">Anamaria</forename><surname>Martins Moreira</surname></persName><idno type="halAuthorId">131233</idno><orgName ref="#struct-364951"></orgName></author><author role="aut"><persName><forename type="first">Christophe</forename><surname>Ringeissen</surname></persName><idno type="idHal">christophe-ringeissen</idno><idno type="halAuthorId">129590</idno><orgName ref="#struct-300009"></orgName><affiliation ref="#struct-2360"></affiliation></author><author role="aut"><persName><forename type="first">David</forename><surname>Déharbe</surname></persName><idno type="halAuthorId">131234</idno><orgName ref="#struct-364951"></orgName></author><author role="aut"><persName><forename type="first">Gleydson</forename><surname>Lima</surname></persName><idno type="halAuthorId">131235</idno><orgName ref="#struct-364951"></orgName></author></analytic><monogr><idno type="localRef">A04-R-184 || martins_moreira04a</idno><idno type="halJournalId" status="INCOMING">44310</idno><title level="j">The Journal of Logic and Algebraic Programming</title><imprint><biblScope unit="volume">59</biblScope><biblScope unit="issue">1-2</biblScope><biblScope unit="pp">63-87</biblScope><date type="datePub">2004</date></imprint></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="fr">génie logiciel</term><term xml:lang="fr">software engineering</term><term xml:lang="fr">formal specification</term><term xml:lang="fr">algebraic specification</term><term xml:lang="fr">software reuse</term><term xml:lang="fr">tool inter-operability</term><term xml:lang="fr">interchange format</term><term xml:lang="fr">casl</term><term xml:lang="fr">spécification formelle</term><term xml:lang="fr">spécification algébrique</term><term xml:lang="fr">réutilisation</term><term xml:lang="fr">interopérabilité</term><term xml:lang="fr">format d'échange</term><term xml:lang="fr">elan</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halTypology" n="ART">Journal articles</classCode></textClass><abstract xml:lang="en">In an environment of continuous and rapid evolution, software design methodologies must incorporate techniques and tools that support changes in software artifacts. In the FERUS project, we are developing a tool targeted at software designers that integrates a collection of operations on algebraic specifications written in the CASL language. The scope of FERUS includes not only modification of existing specifications, but also creation or derivation of new specifications, as well as their proof and execution, which are realized through inter-operability with existing tools. As FERUS involves the manipulation of software specification and inter-operability with other tools, the question of choosing appropriate representation formats is important. In this paper, we discuss the advantages and limitations of ATerms as a manipulation and exchange format in the setting of FERUS. We also present a new, graph-like format, which offers complementary features to a term-based format. Moreover, we present visualization utilities for these formats.</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 003082 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 003082 | 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:inria-00099983
|texte= Manipulating Algebraic Specifications with Term-based and Graph-based Representations
}}
| This area was generated with Dilib version V0.6.33. |  |