Concurrent term rewriting as a model of computation
Identifieur interne : 001808 ( Istex/Curation ); précédent : 001807; suivant : 001809Concurrent term rewriting as a model of computation
Auteurs : Joseph Goguen [États-Unis] ; Claude Kirchner [États-Unis] ; José Meseguer [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A new model of computation, concurrent term rewriting, is proposed as a bridge between a class of easily programmed ultra high level languages and advanced massively concurrent architectures. At the highest level of abstraction, this model views computation as replacing selected subterms by others, at multiple sites concurrently. In this view, concurrent term rewriting provides a standard of correctness, and the choice between using trees or graphs to represent terms is a matter of convenience and efficiency. After introducing the basic concepts and properties of concurrent term rewriting, we discuss some basic implementation issues. A second, more concrete model of computation, called partitioned concurrent term rewriting, takes account of the fact that a (possibly very large) term may be partitioned into fragments that reside on different processors, with each processor concurrently rewriting its own fragment. A number of implementation and optimization issues are also discussed, including overlapping rewrites, rule ordering, compilation, and flow analysis. Concurrent E-strategies are introduced as a flexible control mechanism to optimize performance and facilitate systems programming tasks. All mathematical definitions are gathered in one appendix, while another describes the OBJ language used in examples.
Url:
DOI: 10.1007/3-540-18420-1_50
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001827
Links to Exploration step
ISTEX:682A01D8B97B1667E8D33D948C68A32CC6DF6620Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Concurrent term rewriting as a model of computation</title><author><name sortKey="Goguen, Joseph" sort="Goguen, Joseph" uniqKey="Goguen J" first="Joseph" last="Goguen">Joseph Goguen</name><affiliation wicri:level="2"><mods:affiliation>SRI International, 94025, Menlo Park, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>SRI International, 94025, Menlo Park</wicri:cityArea></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="2"><mods:affiliation>SRI International, 94025, Menlo Park, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>SRI International, 94025, Menlo Park</wicri:cityArea></affiliation></author><author><name sortKey="Meseguer, Jose" sort="Meseguer, Jose" uniqKey="Meseguer J" first="José" last="Meseguer">José Meseguer</name><affiliation wicri:level="2"><mods:affiliation>SRI International, 94025, Menlo Park, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>SRI International, 94025, Menlo Park</wicri:cityArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:682A01D8B97B1667E8D33D948C68A32CC6DF6620</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/3-540-18420-1_50</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-QLLBCQS5-V/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001827</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001827</idno><idno type="wicri:Area/Istex/Curation">001808</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Concurrent term rewriting as a model of computation</title><author><name sortKey="Goguen, Joseph" sort="Goguen, Joseph" uniqKey="Goguen J" first="Joseph" last="Goguen">Joseph Goguen</name><affiliation wicri:level="2"><mods:affiliation>SRI International, 94025, Menlo Park, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>SRI International, 94025, Menlo Park</wicri:cityArea></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="2"><mods:affiliation>SRI International, 94025, Menlo Park, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>SRI International, 94025, Menlo Park</wicri:cityArea></affiliation></author><author><name sortKey="Meseguer, Jose" sort="Meseguer, Jose" uniqKey="Meseguer J" first="José" last="Meseguer">José Meseguer</name><affiliation wicri:level="2"><mods:affiliation>SRI International, 94025, Menlo Park, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>SRI International, 94025, Menlo Park</wicri:cityArea></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: A new model of computation, concurrent term rewriting, is proposed as a bridge between a class of easily programmed ultra high level languages and advanced massively concurrent architectures. At the highest level of abstraction, this model views computation as replacing selected subterms by others, at multiple sites concurrently. In this view, concurrent term rewriting provides a standard of correctness, and the choice between using trees or graphs to represent terms is a matter of convenience and efficiency. After introducing the basic concepts and properties of concurrent term rewriting, we discuss some basic implementation issues. A second, more concrete model of computation, called partitioned concurrent term rewriting, takes account of the fact that a (possibly very large) term may be partitioned into fragments that reside on different processors, with each processor concurrently rewriting its own fragment. A number of implementation and optimization issues are also discussed, including overlapping rewrites, rule ordering, compilation, and flow analysis. Concurrent E-strategies are introduced as a flexible control mechanism to optimize performance and facilitate systems programming tasks. All mathematical definitions are gathered in one appendix, while another describes the OBJ language used in examples.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001808 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001808 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:682A01D8B97B1667E8D33D948C68A32CC6DF6620
|texte= Concurrent term rewriting as a model of computation
}}
| This area was generated with Dilib version V0.6.33. |  |