An abstraction refinement approach combining precise and approximated techniques
Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sharygina, Natasha [verfasserIn] Tonetta, Stefano [verfasserIn] Tsitovich, Aliaksei [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: International Journal on Software Tools for Technology Transfer - Springer-Verlag, 1997, 14(2011), 1 vom: 17. Feb., Seite 1-14 |
|---|---|
| Übergeordnetes Werk: |
volume:14 ; year:2011 ; number:1 ; day:17 ; month:02 ; pages:1-14 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-011-0185-y |
|---|
| Katalog-ID: |
SPR008004870 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR008004870 | ||
| 003 | DE-627 | ||
| 005 | 20201124023049.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201005s2011 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-011-0185-y |2 doi | |
| 035 | |a (DE-627)SPR008004870 | ||
| 035 | |a (SPR)s10009-011-0185-y-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Sharygina, Natasha |e verfasserin |4 aut | |
| 245 | 1 | 3 | |a An abstraction refinement approach combining precise and approximated techniques |
| 264 | 1 | |c 2011 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. | ||
| 650 | 4 | |a Predicate abstraction |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Precise abstraction |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Approximated abstraction |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a CEGAR |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Tonetta, Stefano |e verfasserin |4 aut | |
| 700 | 1 | |a Tsitovich, Aliaksei |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International Journal on Software Tools for Technology Transfer |d Springer-Verlag, 1997 |g 14(2011), 1 vom: 17. Feb., Seite 1-14 |w (DE-627)SPR008001103 |7 nnns |
| 773 | 1 | 8 | |g volume:14 |g year:2011 |g number:1 |g day:17 |g month:02 |g pages:1-14 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s10009-011-0185-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 14 |j 2011 |e 1 |b 17 |c 02 |h 1-14 | ||
| author_variant |
n s ns s t st a t at |
|---|---|
| matchkey_str |
sharyginanatashatonettastefanotsitovicha:2011----:nbtatorfnmnapoccmiigrcsadpr |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s10009-011-0185-y doi (DE-627)SPR008004870 (SPR)s10009-011-0185-y-e DE-627 ger DE-627 rakwb eng Sharygina, Natasha verfasserin aut An abstraction refinement approach combining precise and approximated techniques 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. Predicate abstraction (dpeaa)DE-He213 Precise abstraction (dpeaa)DE-He213 Approximated abstraction (dpeaa)DE-He213 CEGAR (dpeaa)DE-He213 Tonetta, Stefano verfasserin aut Tsitovich, Aliaksei verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 14(2011), 1 vom: 17. Feb., Seite 1-14 (DE-627)SPR008001103 nnns volume:14 year:2011 number:1 day:17 month:02 pages:1-14 https://dx.doi.org/10.1007/s10009-011-0185-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 14 2011 1 17 02 1-14 |
| spelling |
10.1007/s10009-011-0185-y doi (DE-627)SPR008004870 (SPR)s10009-011-0185-y-e DE-627 ger DE-627 rakwb eng Sharygina, Natasha verfasserin aut An abstraction refinement approach combining precise and approximated techniques 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. Predicate abstraction (dpeaa)DE-He213 Precise abstraction (dpeaa)DE-He213 Approximated abstraction (dpeaa)DE-He213 CEGAR (dpeaa)DE-He213 Tonetta, Stefano verfasserin aut Tsitovich, Aliaksei verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 14(2011), 1 vom: 17. Feb., Seite 1-14 (DE-627)SPR008001103 nnns volume:14 year:2011 number:1 day:17 month:02 pages:1-14 https://dx.doi.org/10.1007/s10009-011-0185-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 14 2011 1 17 02 1-14 |
| allfields_unstemmed |
10.1007/s10009-011-0185-y doi (DE-627)SPR008004870 (SPR)s10009-011-0185-y-e DE-627 ger DE-627 rakwb eng Sharygina, Natasha verfasserin aut An abstraction refinement approach combining precise and approximated techniques 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. Predicate abstraction (dpeaa)DE-He213 Precise abstraction (dpeaa)DE-He213 Approximated abstraction (dpeaa)DE-He213 CEGAR (dpeaa)DE-He213 Tonetta, Stefano verfasserin aut Tsitovich, Aliaksei verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 14(2011), 1 vom: 17. Feb., Seite 1-14 (DE-627)SPR008001103 nnns volume:14 year:2011 number:1 day:17 month:02 pages:1-14 https://dx.doi.org/10.1007/s10009-011-0185-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 14 2011 1 17 02 1-14 |
| allfieldsGer |
10.1007/s10009-011-0185-y doi (DE-627)SPR008004870 (SPR)s10009-011-0185-y-e DE-627 ger DE-627 rakwb eng Sharygina, Natasha verfasserin aut An abstraction refinement approach combining precise and approximated techniques 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. Predicate abstraction (dpeaa)DE-He213 Precise abstraction (dpeaa)DE-He213 Approximated abstraction (dpeaa)DE-He213 CEGAR (dpeaa)DE-He213 Tonetta, Stefano verfasserin aut Tsitovich, Aliaksei verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 14(2011), 1 vom: 17. Feb., Seite 1-14 (DE-627)SPR008001103 nnns volume:14 year:2011 number:1 day:17 month:02 pages:1-14 https://dx.doi.org/10.1007/s10009-011-0185-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 14 2011 1 17 02 1-14 |
| allfieldsSound |
10.1007/s10009-011-0185-y doi (DE-627)SPR008004870 (SPR)s10009-011-0185-y-e DE-627 ger DE-627 rakwb eng Sharygina, Natasha verfasserin aut An abstraction refinement approach combining precise and approximated techniques 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. Predicate abstraction (dpeaa)DE-He213 Precise abstraction (dpeaa)DE-He213 Approximated abstraction (dpeaa)DE-He213 CEGAR (dpeaa)DE-He213 Tonetta, Stefano verfasserin aut Tsitovich, Aliaksei verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 14(2011), 1 vom: 17. Feb., Seite 1-14 (DE-627)SPR008001103 nnns volume:14 year:2011 number:1 day:17 month:02 pages:1-14 https://dx.doi.org/10.1007/s10009-011-0185-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 14 2011 1 17 02 1-14 |
| language |
English |
| source |
Enthalten in International Journal on Software Tools for Technology Transfer 14(2011), 1 vom: 17. Feb., Seite 1-14 volume:14 year:2011 number:1 day:17 month:02 pages:1-14 |
| sourceStr |
Enthalten in International Journal on Software Tools for Technology Transfer 14(2011), 1 vom: 17. Feb., Seite 1-14 volume:14 year:2011 number:1 day:17 month:02 pages:1-14 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Predicate abstraction Precise abstraction Approximated abstraction CEGAR |
| isfreeaccess_bool |
false |
| container_title |
International Journal on Software Tools for Technology Transfer |
| authorswithroles_txt_mv |
Sharygina, Natasha @@aut@@ Tonetta, Stefano @@aut@@ Tsitovich, Aliaksei @@aut@@ |
| publishDateDaySort_date |
2011-02-17T00:00:00Z |
| hierarchy_top_id |
SPR008001103 |
| id |
SPR008004870 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR008004870</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124023049.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2011 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-011-0185-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR008004870</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-011-0185-y-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sharygina, Natasha</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="3"><subfield code="a">An abstraction refinement approach combining precise and approximated techniques</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Predicate abstraction</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Precise abstraction</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximated abstraction</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CEGAR</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tonetta, Stefano</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsitovich, Aliaksei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International Journal on Software Tools for Technology Transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">14(2011), 1 vom: 17. Feb., Seite 1-14</subfield><subfield code="w">(DE-627)SPR008001103</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:1</subfield><subfield code="g">day:17</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:1-14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-011-0185-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2011</subfield><subfield code="e">1</subfield><subfield code="b">17</subfield><subfield code="c">02</subfield><subfield code="h">1-14</subfield></datafield></record></collection>
|
| author |
Sharygina, Natasha |
| spellingShingle |
Sharygina, Natasha misc Predicate abstraction misc Precise abstraction misc Approximated abstraction misc CEGAR An abstraction refinement approach combining precise and approximated techniques |
| authorStr |
Sharygina, Natasha |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR008001103 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
An abstraction refinement approach combining precise and approximated techniques Predicate abstraction (dpeaa)DE-He213 Precise abstraction (dpeaa)DE-He213 Approximated abstraction (dpeaa)DE-He213 CEGAR (dpeaa)DE-He213 |
| topic |
misc Predicate abstraction misc Precise abstraction misc Approximated abstraction misc CEGAR |
| topic_unstemmed |
misc Predicate abstraction misc Precise abstraction misc Approximated abstraction misc CEGAR |
| topic_browse |
misc Predicate abstraction misc Precise abstraction misc Approximated abstraction misc CEGAR |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
International Journal on Software Tools for Technology Transfer |
| hierarchy_parent_id |
SPR008001103 |
| hierarchy_top_title |
International Journal on Software Tools for Technology Transfer |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR008001103 |
| title |
An abstraction refinement approach combining precise and approximated techniques |
| ctrlnum |
(DE-627)SPR008004870 (SPR)s10009-011-0185-y-e |
| title_full |
An abstraction refinement approach combining precise and approximated techniques |
| author_sort |
Sharygina, Natasha |
| journal |
International Journal on Software Tools for Technology Transfer |
| journalStr |
International Journal on Software Tools for Technology Transfer |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
1 |
| author_browse |
Sharygina, Natasha Tonetta, Stefano Tsitovich, Aliaksei |
| container_volume |
14 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Sharygina, Natasha |
| doi_str_mv |
10.1007/s10009-011-0185-y |
| author2-role |
verfasserin |
| title_sort |
abstraction refinement approach combining precise and approximated techniques |
| title_auth |
An abstraction refinement approach combining precise and approximated techniques |
| abstract |
Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. |
| abstractGer |
Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. |
| abstract_unstemmed |
Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
1 |
| title_short |
An abstraction refinement approach combining precise and approximated techniques |
| url |
https://dx.doi.org/10.1007/s10009-011-0185-y |
| remote_bool |
true |
| author2 |
Tonetta, Stefano Tsitovich, Aliaksei |
| author2Str |
Tonetta, Stefano Tsitovich, Aliaksei |
| ppnlink |
SPR008001103 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-011-0185-y |
| up_date |
2024-07-03T16:42:47.624Z |
| _version_ |
1803576900452352000 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR008004870</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124023049.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2011 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-011-0185-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR008004870</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-011-0185-y-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sharygina, Natasha</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="3"><subfield code="a">An abstraction refinement approach combining precise and approximated techniques</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and affordable number of states. It produces a conservative over-approximation where concrete states are grouped together according to a given set of predicates. A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive. Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost. However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart. The refinement loop can become prohibitively expensive for large programs. This paper proposes a new approach that employs both precise (slow) and approximated (fast) abstraction techniques within one abstraction-refinement loop. It allows computing the abstraction quickly, but keeps it precise enough to avoid too many refinement iterations. We implemented the new algorithm in a state-of-the-art software model checker. Our tests with various real-life benchmarks show that the new approach almost systematically outperforms both precise and imprecise techniques.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Predicate abstraction</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Precise abstraction</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximated abstraction</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CEGAR</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tonetta, Stefano</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsitovich, Aliaksei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International Journal on Software Tools for Technology Transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">14(2011), 1 vom: 17. Feb., Seite 1-14</subfield><subfield code="w">(DE-627)SPR008001103</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:1</subfield><subfield code="g">day:17</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:1-14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-011-0185-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2011</subfield><subfield code="e">1</subfield><subfield code="b">17</subfield><subfield code="c">02</subfield><subfield code="h">1-14</subfield></datafield></record></collection>
|
| score |
7.4002724 |