A separation logic for resource distribution
Identifieur interne :
000682 ( PascalFrancis/Corpus );
précédent :
000681;
suivant :
000683
A separation logic for resource distribution
Auteurs : Nicolas Biri ;
Didier GalmicheSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0234385
Descripteurs français
- Pascal (Inist)
- Informatique théorique,
Développement logiciel,
Localisation,
Structure donnée arborescente,
Décidabilité,
Vérification programme,
Démonstration théorème,
Méthode arborescente,
Monoïde,
Modèle logique,
Satisfaction,
Déduction,
Vérification modèle,
Calcul séquent.
English descriptors
- KwdEn :
- Computer theory,
Decidability,
Deduction,
Localization,
Logic model,
Monoid,
Program verification,
Satisfaction,
Sequent calculus,
Software development,
Symbolic trajectory evaluation,
Theorem proving,
Tree data structures,
Tree structured method.
Abstract
We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2914 |
|---|
| A08 | 01 | 1 | ENG | @1 A separation logic for resource distribution |
|---|
| A09 | 01 | 1 | ENG | @1 FST TCS 2003 : foundations of software technology and theoretical computer science : Mumbai, 15-17 December 2003 |
|---|
| A11 | 01 | 1 | | @1 BIRI (Nicolas) |
|---|
| A11 | 02 | 1 | | @1 GALMICHE (Didier) |
|---|
| A12 | 01 | 1 | | @1 PANDYA (Paritosh K.) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 RADHAKRISHNAN (Jaikumar) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA - Université Henri Poincaré @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. |
|---|
| A20 | | | | @1 23-37 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-20680-9 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117812920030 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 16 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0234385 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach. |
|---|
| C02 | 01 | X | | @0 001D02A01 |
|---|
| C03 | 01 | X | FRE | @0 Informatique théorique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Computer theory @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Informática teórica @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Développement logiciel @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Software development @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Desarrollo logicial @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Localisation @5 09 |
|---|
| C03 | 03 | X | ENG | @0 Localization @5 09 |
|---|
| C03 | 03 | X | SPA | @0 Localización @5 09 |
|---|
| C03 | 04 | 3 | FRE | @0 Structure donnée arborescente @5 10 |
|---|
| C03 | 04 | 3 | ENG | @0 Tree data structures @5 10 |
|---|
| C03 | 05 | X | FRE | @0 Décidabilité @5 11 |
|---|
| C03 | 05 | X | ENG | @0 Decidability @5 11 |
|---|
| C03 | 05 | X | SPA | @0 Decidibilidad @5 11 |
|---|
| C03 | 06 | X | FRE | @0 Vérification programme @5 12 |
|---|
| C03 | 06 | X | ENG | @0 Program verification @5 12 |
|---|
| C03 | 06 | X | SPA | @0 Verificación programa @5 12 |
|---|
| C03 | 07 | X | FRE | @0 Démonstration théorème @5 13 |
|---|
| C03 | 07 | X | ENG | @0 Theorem proving @5 13 |
|---|
| C03 | 07 | X | SPA | @0 Demostración teorema @5 13 |
|---|
| C03 | 08 | X | FRE | @0 Méthode arborescente @5 18 |
|---|
| C03 | 08 | X | ENG | @0 Tree structured method @5 18 |
|---|
| C03 | 08 | X | SPA | @0 Método arborescente @5 18 |
|---|
| C03 | 09 | X | FRE | @0 Monoïde @5 19 |
|---|
| C03 | 09 | X | ENG | @0 Monoid @5 19 |
|---|
| C03 | 09 | X | SPA | @0 Monoide @5 19 |
|---|
| C03 | 10 | X | FRE | @0 Modèle logique @5 20 |
|---|
| C03 | 10 | X | ENG | @0 Logic model @5 20 |
|---|
| C03 | 10 | X | SPA | @0 Modelo lógico @5 20 |
|---|
| C03 | 11 | X | FRE | @0 Satisfaction @5 21 |
|---|
| C03 | 11 | X | ENG | @0 Satisfaction @5 21 |
|---|
| C03 | 11 | X | SPA | @0 Satisfacción @5 21 |
|---|
| C03 | 12 | X | FRE | @0 Déduction @5 22 |
|---|
| C03 | 12 | X | ENG | @0 Deduction @5 22 |
|---|
| C03 | 12 | X | SPA | @0 Deducción @5 22 |
|---|
| C03 | 13 | X | FRE | @0 Vérification modèle @4 CD @5 96 |
|---|
| C03 | 13 | X | ENG | @0 Symbolic trajectory evaluation @4 CD @5 96 |
|---|
| C03 | 14 | X | FRE | @0 Calcul séquent @4 CD @5 97 |
|---|
| C03 | 14 | X | ENG | @0 Sequent calculus @4 CD @5 97 |
|---|
| C03 | 14 | X | SPA | @0 Càlculo sequente @4 CD @5 97 |
|---|
| N21 | | | | @1 152 |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Foundations of software technology and theoretical computer science. Conference @2 23 @3 Mumbai IND @4 2003-12-15 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0234385 INIST |
|---|
| ET : | A separation logic for resource distribution |
|---|
| AU : | BIRI (Nicolas); GALMICHE (Didier); PANDYA (Paritosh K.); RADHAKRISHNAN (Jaikumar) |
|---|
| AF : | LORIA - Université Henri Poincaré/54506 Vandœuvre-lès-Nancy /France (1 aut., 2 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2914; Pp. 23-37; Bibl. 16 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach. |
|---|
| CC : | 001D02A01 |
|---|
| FD : | Informatique théorique; Développement logiciel; Localisation; Structure donnée arborescente; Décidabilité; Vérification programme; Démonstration théorème; Méthode arborescente; Monoïde; Modèle logique; Satisfaction; Déduction; Vérification modèle; Calcul séquent |
|---|
| ED : | Computer theory; Software development; Localization; Tree data structures; Decidability; Program verification; Theorem proving; Tree structured method; Monoid; Logic model; Satisfaction; Deduction; Symbolic trajectory evaluation; Sequent calculus |
|---|
| SD : | Informática teórica; Desarrollo logicial; Localización; Decidibilidad; Verificación programa; Demostración teorema; Método arborescente; Monoide; Modelo lógico; Satisfacción; Deducción; Càlculo sequente |
|---|
| LO : | INIST-16343.354000117812920030 |
|---|
| ID : | 04-0234385 |
|---|
Links to Exploration step
Pascal:04-0234385
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A separation logic for resource distribution</title>
<author><name sortKey="Biri, Nicolas" sort="Biri, Nicolas" uniqKey="Biri N" first="Nicolas" last="Biri">Nicolas Biri</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0234385</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0234385 INIST</idno>
<idno type="RBID">Pascal:04-0234385</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000682</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A separation logic for resource distribution</title>
<author><name sortKey="Biri, Nicolas" sort="Biri, Nicolas" uniqKey="Biri N" first="Nicolas" last="Biri">Nicolas Biri</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term>
<term>Decidability</term>
<term>Deduction</term>
<term>Localization</term>
<term>Logic model</term>
<term>Monoid</term>
<term>Program verification</term>
<term>Satisfaction</term>
<term>Sequent calculus</term>
<term>Software development</term>
<term>Symbolic trajectory evaluation</term>
<term>Theorem proving</term>
<term>Tree data structures</term>
<term>Tree structured method</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Développement logiciel</term>
<term>Localisation</term>
<term>Structure donnée arborescente</term>
<term>Décidabilité</term>
<term>Vérification programme</term>
<term>Démonstration théorème</term>
<term>Méthode arborescente</term>
<term>Monoïde</term>
<term>Modèle logique</term>
<term>Satisfaction</term>
<term>Déduction</term>
<term>Vérification modèle</term>
<term>Calcul séquent</term>
</keywords><front><div type="abstract" xml:lang="en">We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2914</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A separation logic for resource distribution</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>FST TCS 2003 : foundations of software technology and theoretical computer science : Mumbai, 15-17 December 2003</s1>
</fA09><fA11 i1="01" i2="1"><s1>BIRI (Nicolas)</s1>
</fA11><fA11 i1="02" i2="1"><s1>GALMICHE (Didier)</s1>
</fA11><fA12 i1="01" i2="1"><s1>PANDYA (Paritosh K.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>RADHAKRISHNAN (Jaikumar)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>23-37</s1>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-20680-9</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117812920030</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>16 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0234385</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A01</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Développement logiciel</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Software development</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Desarrollo logicial</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Localisation</s0>
<s5>09</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Localization</s0>
<s5>09</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Localización</s0>
<s5>09</s5>
</fC03><fC03 i1="04" i2="3" l="FRE"><s0>Structure donnée arborescente</s0>
<s5>10</s5>
</fC03><fC03 i1="04" i2="3" l="ENG"><s0>Tree data structures</s0>
<s5>10</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Decidability</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>11</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Vérification programme</s0>
<s5>12</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Program verification</s0>
<s5>12</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Verificación programa</s0>
<s5>12</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>13</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>13</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>13</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Méthode arborescente</s0>
<s5>18</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Tree structured method</s0>
<s5>18</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Método arborescente</s0>
<s5>18</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Monoïde</s0>
<s5>19</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Monoid</s0>
<s5>19</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Monoide</s0>
<s5>19</s5>
</fC03><fC03 i1="10" i2="X" l="FRE"><s0>Modèle logique</s0>
<s5>20</s5>
</fC03><fC03 i1="10" i2="X" l="ENG"><s0>Logic model</s0>
<s5>20</s5>
</fC03><fC03 i1="10" i2="X" l="SPA"><s0>Modelo lógico</s0>
<s5>20</s5>
</fC03><fC03 i1="11" i2="X" l="FRE"><s0>Satisfaction</s0>
<s5>21</s5>
</fC03><fC03 i1="11" i2="X" l="ENG"><s0>Satisfaction</s0>
<s5>21</s5>
</fC03><fC03 i1="11" i2="X" l="SPA"><s0>Satisfacción</s0>
<s5>21</s5>
</fC03><fC03 i1="12" i2="X" l="FRE"><s0>Déduction</s0>
<s5>22</s5>
</fC03><fC03 i1="12" i2="X" l="ENG"><s0>Deduction</s0>
<s5>22</s5>
</fC03><fC03 i1="12" i2="X" l="SPA"><s0>Deducción</s0>
<s5>22</s5>
</fC03><fC03 i1="13" i2="X" l="FRE"><s0>Vérification modèle</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="13" i2="X" l="ENG"><s0>Symbolic trajectory evaluation</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="14" i2="X" l="FRE"><s0>Calcul séquent</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fC03 i1="14" i2="X" l="ENG"><s0>Sequent calculus</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fC03 i1="14" i2="X" l="SPA"><s0>Càlculo sequente</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fN21><s1>152</s1>
</fN21><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Foundations of software technology and theoretical computer science. Conference</s1>
<s2>23</s2>
<s3>Mumbai IND</s3>
<s4>2003-12-15</s4>
</fA30><server><NO>PASCAL 04-0234385 INIST</NO>
<ET>A separation logic for resource distribution</ET>
<AU>BIRI (Nicolas); GALMICHE (Didier); PANDYA (Paritosh K.); RADHAKRISHNAN (Jaikumar)</AU>
<AF>LORIA - Université Henri Poincaré/54506 Vandœuvre-lès-Nancy /France (1 aut., 2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2914; Pp. 23-37; Bibl. 16 ref.</SO>
<LA>Anglais</LA>
<EA>We define a separation logic (BI-Loc) that is an extension of the Bunched Implications (BI) logic with a modality for locations. Moreover, we propose a general data structure, called resource tree, that is a node-labelled tree in which nodes contain resources that belong to a partial monoid. We also define a resource tree model for this logic that allows to reason and prove properties on resource trees. We study the decidability by model checking of the satisfaction and the validity in this separation logic and also introduce a sequent calculus for deciding validity by deduction w.r.t. a resource model. Then, we relate the separation logic and resource trees to some applications and finally define a sequent calculus for BI-Loc dedicated to a theorem proving approach.</EA>
<CC>001D02A01</CC>
<FD>Informatique théorique; Développement logiciel; Localisation; Structure donnée arborescente; Décidabilité; Vérification programme; Démonstration théorème; Méthode arborescente; Monoïde; Modèle logique; Satisfaction; Déduction; Vérification modèle; Calcul séquent</FD>
<ED>Computer theory; Software development; Localization; Tree data structures; Decidability; Program verification; Theorem proving; Tree structured method; Monoid; Logic model; Satisfaction; Deduction; Symbolic trajectory evaluation; Sequent calculus</ED>
<SD>Informática teórica; Desarrollo logicial; Localización; Decidibilidad; Verificación programa; Demostración teorema; Método arborescente; Monoide; Modelo lógico; Satisfacción; Deducción; Càlculo sequente</SD>
<LO>INIST-16343.354000117812920030</LO>
<ID>04-0234385</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000682 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000682 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0234385
|texte= A separation logic for resource distribution
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
