On using temporal logic for refinement and compositional verification of concurrent systems
Identifieur interne : 00C814 ( Main/Exploration ); précédent : 00C813; suivant : 00C815On using temporal logic for refinement and compositional verification of concurrent systems
Auteurs : ABDELILLAH MOKKEDEM [France] ; D. MerySource :
- Theoretical computer science [ 0304-3975 ] ; 1995.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
A simple and elegant formulation of compositional proof systems for concurrent programs results from a refinement of temporal logic semantics. The refined temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs. Besides compositional verification, concurrent program design and implementation of a coarser-grained program by a finer-grained one, are easily practicable in the setting of the new temporal logic
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000D63
- to stream PascalFrancis, to step Curation: 000B31
- to stream PascalFrancis, to step Checkpoint: 000D27
- to stream Main, to step Merge: 00D076
- to stream Main, to step Curation: 00C814
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On using temporal logic for refinement and compositional verification of concurrent systems</title><author><name sortKey="Abdelillah Mokkedem" sort="Abdelillah Mokkedem" uniqKey="Abdelillah Mokkedem" last="Abdelillah Mokkedem">ABDELILLAH MOKKEDEM</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>CNRS-CRIN</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA-Lorraine</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Mery, D" sort="Mery, D" uniqKey="Mery D" first="D." last="Mery">D. Mery</name></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">95-0222589</idno><date when="1995">1995</date><idno type="stanalyst">PASCAL 95-0222589 INIST</idno><idno type="RBID">Pascal:95-0222589</idno><idno type="wicri:Area/PascalFrancis/Corpus">000D63</idno><idno type="wicri:Area/PascalFrancis/Curation">000B31</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000D27</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000D27</idno><idno type="wicri:doubleKey">0304-3975:1995:Abdelillah Mokkedem:on:using:temporal</idno><idno type="wicri:Area/Main/Merge">00D076</idno><idno type="wicri:Area/Main/Curation">00C814</idno><idno type="wicri:Area/Main/Exploration">00C814</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On using temporal logic for refinement and compositional verification of concurrent systems</title><author><name sortKey="Abdelillah Mokkedem" sort="Abdelillah Mokkedem" uniqKey="Abdelillah Mokkedem" last="Abdelillah Mokkedem">ABDELILLAH MOKKEDEM</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>CNRS-CRIN</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA-Lorraine</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Mery, D" sort="Mery, D" uniqKey="Mery D" first="D." last="Mery">D. Mery</name></author></analytic><series><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno><imprint><date when="1995">1995</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abstraction</term><term>Concurrent program</term><term>Formal semantics</term><term>Refinement</term><term>Temporal logic</term><term>Verification</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Programme concurrent</term><term>Logique temporelle</term><term>Sémantique formelle</term><term>Abstraction</term><term>Affinement</term><term>Vérification</term><term>Programme IPL</term><term>Logique MTL</term><term>Système preuve</term><term>Principe composition</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A simple and elegant formulation of compositional proof systems for concurrent programs results from a refinement of temporal logic semantics. The refined temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs. Besides compositional verification, concurrent program design and implementation of a coarser-grained program by a finer-grained one, are easily practicable in the setting of the new temporal logic</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><noCountry><name sortKey="Mery, D" sort="Mery, D" uniqKey="Mery D" first="D." last="Mery">D. Mery</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Abdelillah Mokkedem" sort="Abdelillah Mokkedem" uniqKey="Abdelillah Mokkedem" last="Abdelillah Mokkedem">ABDELILLAH MOKKEDEM</name></region><name sortKey="Abdelillah Mokkedem" sort="Abdelillah Mokkedem" uniqKey="Abdelillah Mokkedem" last="Abdelillah Mokkedem">ABDELILLAH MOKKEDEM</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C814 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C814 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:95-0222589
|texte= On using temporal logic for refinement and compositional verification of concurrent systems
}}
| This area was generated with Dilib version V0.6.33. |  |