Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives
Identifieur interne : 003772 ( Istex/Corpus ); précédent : 003771; suivant : 003773Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives
Auteurs : Marie-Claude GaudelSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The formal specification of abstract data types using axioms was proposed about fifteen years ago by several authors. It has become the basis of the so-called algebraic specification methods. Numerous algebraic specification languages have been designed and experimented and several specification languages make use of the algebraic approach to specify data types. This paper reports the experience of the author in the design of the PLUSS specification language and in using it for various case studies: PLUSS has evolved a lot since its beginning and will still evolve. A rationale for its past evolution and a discussion of some possible future changes is given. Moreover, some lessons learned from the case studies on the advantages and drawbacks of algebraic specifications are reported.
Url:
DOI: 10.1007/3-540-55210-3_169
Links to Exploration step
ISTEX:E8756B1BBE7F4E78F9EB6A9A3DBD1811AA6BF671Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title><author><name sortKey="Gaudel, Marie Claude" sort="Gaudel, Marie Claude" uniqKey="Gaudel M" first="Marie-Claude" last="Gaudel">Marie-Claude Gaudel</name><affiliation><mods:affiliation>LRI, Université de Paris-Sud et CNRS (UA 410), Bâtiment 490, 91405, Orsay cedex, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E8756B1BBE7F4E78F9EB6A9A3DBD1811AA6BF671</idno><date when="1992" year="1992">1992</date><idno type="doi">10.1007/3-540-55210-3_169</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-K3CLDF3B-D/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003772</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003772</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title><author><name sortKey="Gaudel, Marie Claude" sort="Gaudel, Marie Claude" uniqKey="Gaudel M" first="Marie-Claude" last="Gaudel">Marie-Claude Gaudel</name><affiliation><mods:affiliation>LRI, Université de Paris-Sud et CNRS (UA 410), Bâtiment 490, 91405, Orsay cedex, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The formal specification of abstract data types using axioms was proposed about fifteen years ago by several authors. It has become the basis of the so-called algebraic specification methods. Numerous algebraic specification languages have been designed and experimented and several specification languages make use of the algebraic approach to specify data types. This paper reports the experience of the author in the design of the PLUSS specification language and in using it for various case studies: PLUSS has evolved a lot since its beginning and will still evolve. A rationale for its past evolution and a discussion of some possible future changes is given. Moreover, some lessons learned from the case studies on the advantages and drawbacks of algebraic specifications are reported.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Marie-Claude Gaudel</name><affiliations><json:string>LRI, Université de Paris-Sud et CNRS (UA 410), Bâtiment 490, 91405, Orsay cedex, France</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-K3CLDF3B-D</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: The formal specification of abstract data types using axioms was proposed about fifteen years ago by several authors. It has become the basis of the so-called algebraic specification methods. Numerous algebraic specification languages have been designed and experimented and several specification languages make use of the algebraic approach to specify data types. This paper reports the experience of the author in the design of the PLUSS specification language and in using it for various case studies: PLUSS has evolved a lot since its beginning and will still evolve. A rationale for its past evolution and a discussion of some possible future changes is given. Moreover, some lessons learned from the case studies on the advantages and drawbacks of algebraic specifications are reported.</abstract><qualityIndicators><score>8.476</score><pdfWordCount>5836</pdfWordCount><pdfCharCount>27224</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>18</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>123</abstractWordCount><abstractCharCount>802</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title><chapterId><json:string>1</json:string><json:string>Chap1</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1992</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item></editor></serie><host><title>STACS 92</title><language><json:string>unknown</json:string></language><copyrightDate>1992</copyrightDate><doi><json:string>10.1007/3-540-55210-3</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-46775-5</json:string></eisbn><bookId><json:string>3540552103</json:string></bookId><isbn><json:string>978-3-540-55210-9</json:string></isbn><volume>577</volume><pages><first>1</first><last>18</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Alain Finkel</name></json:item><json:item><name>Matthias Jantzen</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Numerical Analysis</value></json:item><json:item><value>Combinatorics</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-K3CLDF3B-D</json:string></ark><publicationDate>1992</publicationDate><copyrightDate>1992</copyrightDate><doi><json:string>10.1007/3-540-55210-3_169</json:string></doi><id>E8756B1BBE7F4E78F9EB6A9A3DBD1811AA6BF671</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-K3CLDF3B-D/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-K3CLDF3B-D/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-K3CLDF3B-D/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1992">1992</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title><author><persName><forename type="first">Marie-Claude</forename><surname>Gaudel</surname></persName><affiliation><orgName type="institution">LRI, Université de Paris-Sud et CNRS (UA 410)</orgName><address><street>Bâtiment 490</street><postCode>91405</postCode><settlement>Orsay cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">E8756B1BBE7F4E78F9EB6A9A3DBD1811AA6BF671</idno><idno type="ark">ark:/67375/HCB-K3CLDF3B-D</idno><idno type="DOI">10.1007/3-540-55210-3_169</idno></analytic><monogr><title level="m" type="main">STACS 92</title><title level="m" type="sub">9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings</title><idno type="DOI">10.1007/3-540-55210-3</idno><idno type="book-id">3540552103</idno><idno type="ISBN">978-3-540-55210-9</idno><idno type="eISBN">978-3-540-46775-5</idno><idno type="chapter-id">Chap1</idno><editor><persName><forename type="first">Alain</forename><surname>Finkel</surname></persName></editor><editor><persName><forename type="first">Matthias</forename><surname>Jantzen</surname></persName></editor><imprint><biblScope unit="vol">577</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="18">18</biblScope><biblScope unit="chapter-count">56</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>The formal specification of abstract data types using axioms was proposed about fifteen years ago by several authors. It has become the basis of the so-called algebraic specification methods. Numerous algebraic specification languages have been designed and experimented and several specification languages make use of the algebraic approach to specify data types.</p><p>This paper reports the experience of the author in the design of the PLUSS specification language and in using it for various case studies: PLUSS has evolved a lot since its beginning and will still evolve. A rationale for its past evolution and a discussion of some possible future changes is given. Moreover, some lessons learned from the case studies on the advantages and drawbacks of algebraic specifications are reported.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16013</label><item><term type="Secondary" subtype="priority-1">Computation by Abstract Devices</term></item><label>I16021</label><item><term type="Secondary" subtype="priority-2">Algorithm Analysis and Problem Complexity</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-3">Logics and Meanings of Programs</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-4">Mathematical Logic and Formal Languages</term></item><label>M14050</label><item><term type="Secondary" subtype="priority-5">Numerical Analysis</term></item><label>M17009</label><item><term type="Secondary" subtype="priority-6">Combinatorics</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-K3CLDF3B-D/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540552103</BookID><BookTitle>STACS 92</BookTitle><BookSubTitle>9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings</BookSubTitle><BookVolumeNumber>577</BookVolumeNumber><BookDOI>10.1007/3-540-55210-3</BookDOI><BookTitleID>32575</BookTitleID><BookPrintISBN>978-3-540-55210-9</BookPrintISBN><BookElectronicISBN>978-3-540-46775-5</BookElectronicISBN><BookChapterCount>56</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1992</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="M14050" Priority="5" Type="Secondary">Numerical Analysis</BookSubject><BookSubject Code="M17009" Priority="6" Type="Secondary">Combinatorics</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Alain</GivenName><FamilyName>Finkel</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Matthias</GivenName><FamilyName>Jantzen</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap1" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>1</ChapterID><ChapterDOI>10.1007/3-540-55210-3_169</ChapterDOI><ChapterSequenceNumber>1</ChapterSequenceNumber><ChapterTitle Language="En">Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</ChapterTitle><ChapterFirstPage>1</ChapterFirstPage><ChapterLastPage>18</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1992</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>2</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540552103</BookID><BookTitle>STACS 92</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Marie-Claude</GivenName><FamilyName>Gaudel</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgName>LRI, Université de Paris-Sud et CNRS (UA 410)</OrgName><OrgAddress><Street>Bâtiment 490</Street><Postcode>91405</Postcode><City>Orsay cedex</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The formal specification of abstract data types using axioms was proposed about fifteen years ago by several authors. It has become the basis of the so-called algebraic specification methods. Numerous algebraic specification languages have been designed and experimented and several specification languages make use of the algebraic approach to specify data types.</Para><Para>This paper reports the experience of the author in the design of the PLUSS specification language and in using it for various case studies: PLUSS has evolved a lot since its beginning and will still evolve. A rationale for its past evolution and a discussion of some possible future changes is given. Moreover, some lessons learned from the case studies on the advantages and drawbacks of algebraic specifications are reported.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives</title></titleInfo><name type="personal"><namePart type="given">Marie-Claude</namePart><namePart type="family">Gaudel</namePart><affiliation>LRI, Université de Paris-Sud et CNRS (UA 410), Bâtiment 490, 91405, Orsay cedex, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1992</dateIssued><copyrightDate encoding="w3cdtf">1992</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: The formal specification of abstract data types using axioms was proposed about fifteen years ago by several authors. It has become the basis of the so-called algebraic specification methods. Numerous algebraic specification languages have been designed and experimented and several specification languages make use of the algebraic approach to specify data types. This paper reports the experience of the author in the design of the PLUSS specification language and in using it for various case studies: PLUSS has evolved a lot since its beginning and will still evolve. A rationale for its past evolution and a discussion of some possible future changes is given. Moreover, some lessons learned from the case studies on the advantages and drawbacks of algebraic specifications are reported.</abstract><relatedItem type="host"><titleInfo><title>STACS 92</title><subTitle>9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Alain</namePart><namePart type="family">Finkel</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Matthias</namePart><namePart type="family">Jantzen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1992</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="M14050">Numerical Analysis</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic></subject><identifier type="DOI">10.1007/3-540-55210-3</identifier><identifier type="ISBN">978-3-540-55210-9</identifier><identifier type="eISBN">978-3-540-46775-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">32575</identifier><identifier type="BookID">3540552103</identifier><identifier type="BookChapterCount">56</identifier><identifier type="BookVolumeNumber">577</identifier><part><date>1992</date><detail type="volume"><number>577</number><caption>vol.</caption></detail><extent unit="pages"><start>1</start><end>18</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1992</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1992</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1992</recordOrigin></recordInfo></relatedItem><identifier type="istex">E8756B1BBE7F4E78F9EB6A9A3DBD1811AA6BF671</identifier><identifier type="ark">ark:/67375/HCB-K3CLDF3B-D</identifier><identifier type="DOI">10.1007/3-540-55210-3_169</identifier><identifier type="ChapterID">1</identifier><identifier type="ChapterID">Chap1</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1992</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1992</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-K3CLDF3B-D/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003772 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003772 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E8756B1BBE7F4E78F9EB6A9A3DBD1811AA6BF671
|texte= Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives
}}
| This area was generated with Dilib version V0.6.33. |  |