Automated verification by induction with associative-commutative operators
Identifieur interne :
000D26 ( PascalFrancis/Corpus );
précédent :
000D25;
suivant :
000D27
Automated verification by induction with associative-commutative operators
Auteurs : N. Berregeb ;
A. Bouhoula ;
M. RusinowtichSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 1996.
RBID : Pascal:96-0468540
Descripteurs français
English descriptors
Abstract
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets,... are ubiquitous in software and hardware verification. These AC operators are difficult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for verification tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical verification problems than well known tools like NQTHM, LP or PVS. We also believe that our approach can easily be integrated as an efficient tactic in other proof systems.
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 1102 |
|---|
| A08 | 01 | 1 | ENG | @1 Automated verification by induction with associative-commutative operators |
|---|
| A09 | 01 | 1 | ENG | @1 CAV : computer aided verification : New Brunswick NJ, July 31 - August 3, 1996 |
|---|
| A11 | 01 | 1 | | @1 BERREGEB (N.) |
|---|
| A11 | 02 | 1 | | @1 BOUHOULA (A.) |
|---|
| A11 | 03 | 1 | | @1 RUSINOWTICH (M.) |
|---|
| A12 | 01 | 1 | | @1 ALUR (Rajeev) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 HENZINGER (Thomas A.) @9 ed. |
|---|
| A14 | 01 | | | @1 INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 220-231 |
|---|
| A21 | | | | @1 1996 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000060634330190 |
|---|
| A44 | | | | @0 0000 @1 © 1996 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 15 ref. |
|---|
| A47 | 01 | 1 | | @0 96-0468540 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets,... are ubiquitous in software and hardware verification. These AC operators are difficult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for verification tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical verification problems than well known tools like NQTHM, LP or PVS. We also believe that our approach can easily be integrated as an efficient tactic in other proof systems. |
|---|
| C02 | 01 | X | | @0 001D02C02 |
|---|
| C02 | 02 | X | | @0 001D02A05 |
|---|
| C02 | 03 | X | | @0 001D03F06A |
|---|
| C03 | 01 | X | FRE | @0 Vérification @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Verification @5 01 |
|---|
| C03 | 01 | X | GER | @0 Eichen @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Verificación @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Automate fini @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Finite automaton @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Autómata estado finito @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Additionneur @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Adder @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Adicionador @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Démonstration théorème @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Theorem proving @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Demostración teorema @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Règle inférence @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Inference rule @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Regla inferencia @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Réécriture @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Rewriting @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Reescritura @5 06 |
|---|
| C03 | 07 | X | FRE | @0 Unification @5 07 |
|---|
| C03 | 07 | X | ENG | @0 Unification @5 07 |
|---|
| C03 | 07 | X | SPA | @0 Unificación @5 07 |
|---|
| N21 | | | | @1 323 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Computer aided verification. International conference @2 8 @3 New Brunswick NJ USA @4 1996-07-31 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 96-0468540 INIST |
|---|
| ET : | Automated verification by induction with associative-commutative operators |
|---|
| AU : | BERREGEB (N.); BOUHOULA (A.); RUSINOWTICH (M.); ALUR (Rajeev); HENZINGER (Thomas A.) |
|---|
| AF : | INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101/54602 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1102; Pp. 220-231; Bibl. 15 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets,... are ubiquitous in software and hardware verification. These AC operators are difficult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for verification tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical verification problems than well known tools like NQTHM, LP or PVS. We also believe that our approach can easily be integrated as an efficient tactic in other proof systems. |
|---|
| CC : | 001D02C02; 001D02A05; 001D03F06A |
|---|
| FD : | Vérification; Automate fini; Additionneur; Démonstration théorème; Règle inférence; Réécriture; Unification |
|---|
| ED : | Verification; Finite automaton; Adder; Theorem proving; Inference rule; Rewriting; Unification |
|---|
| GD : | Eichen |
|---|
| SD : | Verificación; Autómata estado finito; Adicionador; Demostración teorema; Regla inferencia; Reescritura; Unificación |
|---|
| LO : | INIST-16343.354000060634330190 |
|---|
| ID : | 96-0468540 |
|---|
Links to Exploration step
Pascal:96-0468540
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Automated verification by induction with associative-commutative operators</title>
<author><name sortKey="Berregeb, N" sort="Berregeb, N" uniqKey="Berregeb N" first="N." last="Berregeb">N. Berregeb</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Bouhoula, A" sort="Bouhoula, A" uniqKey="Bouhoula A" first="A." last="Bouhoula">A. Bouhoula</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Rusinowtich, M" sort="Rusinowtich, M" uniqKey="Rusinowtich M" first="M." last="Rusinowtich">M. Rusinowtich</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">96-0468540</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 96-0468540 INIST</idno>
<idno type="RBID">Pascal:96-0468540</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D26</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Automated verification by induction with associative-commutative operators</title>
<author><name sortKey="Berregeb, N" sort="Berregeb, N" uniqKey="Berregeb N" first="N." last="Berregeb">N. Berregeb</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Bouhoula, A" sort="Bouhoula, A" uniqKey="Bouhoula A" first="A." last="Bouhoula">A. Bouhoula</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Rusinowtich, M" sort="Rusinowtich, M" uniqKey="Rusinowtich M" first="M." last="Rusinowtich">M. Rusinowtich</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 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="1996">1996</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>Adder</term>
<term>Finite automaton</term>
<term>Inference rule</term>
<term>Rewriting</term>
<term>Theorem proving</term>
<term>Unification</term>
<term>Verification</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Vérification</term>
<term>Automate fini</term>
<term>Additionneur</term>
<term>Démonstration théorème</term>
<term>Règle inférence</term>
<term>Réécriture</term>
<term>Unification</term>
</keywords><front><div type="abstract" xml:lang="en">Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets,... are ubiquitous in software and hardware verification. These AC operators are difficult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for verification tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical verification problems than well known tools like NQTHM, LP or PVS. We also believe that our approach can easily be integrated as an efficient tactic in other proof systems.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1102</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Automated verification by induction with associative-commutative operators</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>CAV : computer aided verification : New Brunswick NJ, July 31 - August 3, 1996</s1>
</fA09><fA11 i1="01" i2="1"><s1>BERREGEB (N.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>BOUHOULA (A.)</s1>
</fA11><fA11 i1="03" i2="1"><s1>RUSINOWTICH (M.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>ALUR (Rajeev)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>HENZINGER (Thomas A.)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>220-231</s1>
</fA20><fA21><s1>1996</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000060634330190</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1996 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>15 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>96-0468540</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><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets,... are ubiquitous in software and hardware verification. These AC operators are difficult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for verification tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical verification problems than well known tools like NQTHM, LP or PVS. We also believe that our approach can easily be integrated as an efficient tactic in other proof systems.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C02</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02><fC02 i1="03" i2="X"><s0>001D03F06A</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Vérification</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Verification</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="GER"><s0>Eichen</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Verificación</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Automate fini</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Finite automaton</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Autómata estado finito</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Additionneur</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Adder</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Adicionador</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Règle inférence</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Inference rule</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Regla inferencia</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>06</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Unification</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Unification</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Unificación</s0>
<s5>07</s5>
</fC03><fN21><s1>323</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Computer aided verification. International conference</s1>
<s2>8</s2>
<s3>New Brunswick NJ USA</s3>
<s4>1996-07-31</s4>
</fA30><server><NO>PASCAL 96-0468540 INIST</NO>
<ET>Automated verification by induction with associative-commutative operators</ET>
<AU>BERREGEB (N.); BOUHOULA (A.); RUSINOWTICH (M.); ALUR (Rajeev); HENZINGER (Thomas A.)</AU>
<AF>INRIA Lorraine & CRIN, Campus Scientifique, 615, rue du Jardin Botanique - B.P. 101/54602 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1102; Pp. 220-231; Bibl. 15 ref.</SO>
<LA>Anglais</LA>
<EA>Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets,... are ubiquitous in software and hardware verification. These AC operators are difficult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for verification tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical verification problems than well known tools like NQTHM, LP or PVS. We also believe that our approach can easily be integrated as an efficient tactic in other proof systems.</EA>
<CC>001D02C02; 001D02A05; 001D03F06A</CC>
<FD>Vérification; Automate fini; Additionneur; Démonstration théorème; Règle inférence; Réécriture; Unification</FD>
<ED>Verification; Finite automaton; Adder; Theorem proving; Inference rule; Rewriting; Unification</ED>
<GD>Eichen</GD>
<SD>Verificación; Autómata estado finito; Adicionador; Demostración teorema; Regla inferencia; Reescritura; Unificación</SD>
<LO>INIST-16343.354000060634330190</LO>
<ID>96-0468540</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 000D26 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000D26 | 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:96-0468540
|texte= Automated verification by induction with associative-commutative operators
}}
| 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 |  |
