Abstraction-Driven Verification of Array Programs
Identifieur interne : 006F52 ( Main/Merge ); précédent : 006F51; suivant : 006F53Abstraction-Driven Verification of Array Programs
Auteurs : David Déharbe [Brésil] ; Abdessamad Imine [France] ; Silvio Ranise [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We describe a refutation-based theorem proving algorithm capable of checking the satisfiability of non-ground formulae modulo (a combination of) theories. The key idea is the use of abstraction to drive the application of (i) ground satisfiability checking modulo theories axiomatized by equational clauses, (ii) Presburger arithmetic, and (iii) quantifier instantiation. A prototype implementation is used to discharge the proof obligations necessary to show the correctness of some typical programs manipulating arrays. On these benchmarks, the prototype automatically discharge more proof obligations than Simplify – the prover of reference for program checking – thereby confirming the viability of our approach.
Url:
DOI: 10.1007/978-3-540-30210-0_23
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F77
- to stream Istex, to step Curation: 000F62
- to stream Istex, to step Checkpoint: 001857
Links to Exploration step
ISTEX:431EA2D1BB13224E3E69D36991EA2E71B8C36934Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Abstraction-Driven Verification of Array Programs</title><author><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name></author><author><name sortKey="Imine, Abdessamad" sort="Imine, Abdessamad" uniqKey="Imine A" first="Abdessamad" last="Imine">Abdessamad Imine</name></author><author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:431EA2D1BB13224E3E69D36991EA2E71B8C36934</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-30210-0_23</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-KCLJJGGQ-X/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000F77</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000F77</idno><idno type="wicri:Area/Istex/Curation">000F62</idno><idno type="wicri:Area/Istex/Checkpoint">001857</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001857</idno><idno type="wicri:doubleKey">0302-9743:2004:Deharbe D:abstraction:driven:verification</idno><idno type="wicri:Area/Main/Merge">006F52</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Abstraction-Driven Verification of Array Programs</title><author><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name><affiliation wicri:level="1"><country xml:lang="fr">Brésil</country><wicri:regionArea>UFRN/DIMAp, Natal</wicri:regionArea><wicri:noRegion>Natal</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Brésil</country></affiliation></author><author><name sortKey="Imine, Abdessamad" sort="Imine, Abdessamad" uniqKey="Imine A" first="Abdessamad" last="Imine">Abdessamad Imine</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA & INRIA-Lorraine, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA & INRIA-Lorraine, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</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: We describe a refutation-based theorem proving algorithm capable of checking the satisfiability of non-ground formulae modulo (a combination of) theories. The key idea is the use of abstraction to drive the application of (i) ground satisfiability checking modulo theories axiomatized by equational clauses, (ii) Presburger arithmetic, and (iii) quantifier instantiation. A prototype implementation is used to discharge the proof obligations necessary to show the correctness of some typical programs manipulating arrays. On these benchmarks, the prototype automatically discharge more proof obligations than Simplify – the prover of reference for program checking – thereby confirming the viability of our approach.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006F52 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006F52 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:431EA2D1BB13224E3E69D36991EA2E71B8C36934
|texte= Abstraction-Driven Verification of Array Programs
}}
| This area was generated with Dilib version V0.6.33. |  |