Predicate Abstraction of ANSI-C Programs Using SAT
Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Clarke, Edmund [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2004 |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 2004 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Formal methods in system design - Kluwer Academic Publishers, 1992, 25(2004), 2-3 vom: Sept., Seite 105-127 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2004 ; number:2-3 ; month:09 ; pages:105-127 |
| Links: |
|---|
| DOI / URN: |
10.1023/B:FORM.0000040025.89719.f3 |
|---|
| Katalog-ID: |
OLC2038956170 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2038956170 | ||
| 003 | DE-627 | ||
| 005 | 20230503061655.0 | ||
| 007 | tu | ||
| 008 | 200819s2004 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1023/B:FORM.0000040025.89719.f3 |2 doi | |
| 035 | |a (DE-627)OLC2038956170 | ||
| 035 | |a (DE-He213)B:FORM.0000040025.89719.f3-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 54.00 |2 bkl | ||
| 100 | 1 | |a Clarke, Edmund |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Predicate Abstraction of ANSI-C Programs Using SAT |
| 264 | 1 | |c 2004 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Kluwer Academic Publishers 2004 | ||
| 520 | |a Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. | ||
| 700 | 1 | |a Kroening, Daniel |4 aut | |
| 700 | 1 | |a Sharygina, Natasha |4 aut | |
| 700 | 1 | |a Yorav, Karen |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Formal methods in system design |d Kluwer Academic Publishers, 1992 |g 25(2004), 2-3 vom: Sept., Seite 105-127 |w (DE-627)165669160 |w (DE-600)1122555-5 |w (DE-576)032743114 |x 0925-9856 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2004 |g number:2-3 |g month:09 |g pages:105-127 |
| 856 | 4 | 1 | |u https://doi.org/10.1023/B:FORM.0000040025.89719.f3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2014 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4116 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4324 | ||
| 936 | b | k | |a 54.00 |q VZ |
| 951 | |a AR | ||
| 952 | |d 25 |j 2004 |e 2-3 |c 09 |h 105-127 | ||
| author_variant |
e c ec d k dk n s ns k y ky |
|---|---|
| matchkey_str |
article:09259856:2004----::rdctasrcinfnipo |
| hierarchy_sort_str |
2004 |
| bklnumber |
54.00 |
| publishDate |
2004 |
| allfields |
10.1023/B:FORM.0000040025.89719.f3 doi (DE-627)OLC2038956170 (DE-He213)B:FORM.0000040025.89719.f3-p DE-627 ger DE-627 rakwb eng 004 VZ 54.00 bkl Clarke, Edmund verfasserin aut Predicate Abstraction of ANSI-C Programs Using SAT 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. Kroening, Daniel aut Sharygina, Natasha aut Yorav, Karen aut Enthalten in Formal methods in system design Kluwer Academic Publishers, 1992 25(2004), 2-3 vom: Sept., Seite 105-127 (DE-627)165669160 (DE-600)1122555-5 (DE-576)032743114 0925-9856 nnns volume:25 year:2004 number:2-3 month:09 pages:105-127 https://doi.org/10.1023/B:FORM.0000040025.89719.f3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4307 GBV_ILN_4324 54.00 VZ AR 25 2004 2-3 09 105-127 |
| spelling |
10.1023/B:FORM.0000040025.89719.f3 doi (DE-627)OLC2038956170 (DE-He213)B:FORM.0000040025.89719.f3-p DE-627 ger DE-627 rakwb eng 004 VZ 54.00 bkl Clarke, Edmund verfasserin aut Predicate Abstraction of ANSI-C Programs Using SAT 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. Kroening, Daniel aut Sharygina, Natasha aut Yorav, Karen aut Enthalten in Formal methods in system design Kluwer Academic Publishers, 1992 25(2004), 2-3 vom: Sept., Seite 105-127 (DE-627)165669160 (DE-600)1122555-5 (DE-576)032743114 0925-9856 nnns volume:25 year:2004 number:2-3 month:09 pages:105-127 https://doi.org/10.1023/B:FORM.0000040025.89719.f3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4307 GBV_ILN_4324 54.00 VZ AR 25 2004 2-3 09 105-127 |
| allfields_unstemmed |
10.1023/B:FORM.0000040025.89719.f3 doi (DE-627)OLC2038956170 (DE-He213)B:FORM.0000040025.89719.f3-p DE-627 ger DE-627 rakwb eng 004 VZ 54.00 bkl Clarke, Edmund verfasserin aut Predicate Abstraction of ANSI-C Programs Using SAT 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. Kroening, Daniel aut Sharygina, Natasha aut Yorav, Karen aut Enthalten in Formal methods in system design Kluwer Academic Publishers, 1992 25(2004), 2-3 vom: Sept., Seite 105-127 (DE-627)165669160 (DE-600)1122555-5 (DE-576)032743114 0925-9856 nnns volume:25 year:2004 number:2-3 month:09 pages:105-127 https://doi.org/10.1023/B:FORM.0000040025.89719.f3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4307 GBV_ILN_4324 54.00 VZ AR 25 2004 2-3 09 105-127 |
| allfieldsGer |
10.1023/B:FORM.0000040025.89719.f3 doi (DE-627)OLC2038956170 (DE-He213)B:FORM.0000040025.89719.f3-p DE-627 ger DE-627 rakwb eng 004 VZ 54.00 bkl Clarke, Edmund verfasserin aut Predicate Abstraction of ANSI-C Programs Using SAT 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. Kroening, Daniel aut Sharygina, Natasha aut Yorav, Karen aut Enthalten in Formal methods in system design Kluwer Academic Publishers, 1992 25(2004), 2-3 vom: Sept., Seite 105-127 (DE-627)165669160 (DE-600)1122555-5 (DE-576)032743114 0925-9856 nnns volume:25 year:2004 number:2-3 month:09 pages:105-127 https://doi.org/10.1023/B:FORM.0000040025.89719.f3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4307 GBV_ILN_4324 54.00 VZ AR 25 2004 2-3 09 105-127 |
| allfieldsSound |
10.1023/B:FORM.0000040025.89719.f3 doi (DE-627)OLC2038956170 (DE-He213)B:FORM.0000040025.89719.f3-p DE-627 ger DE-627 rakwb eng 004 VZ 54.00 bkl Clarke, Edmund verfasserin aut Predicate Abstraction of ANSI-C Programs Using SAT 2004 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2004 Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. Kroening, Daniel aut Sharygina, Natasha aut Yorav, Karen aut Enthalten in Formal methods in system design Kluwer Academic Publishers, 1992 25(2004), 2-3 vom: Sept., Seite 105-127 (DE-627)165669160 (DE-600)1122555-5 (DE-576)032743114 0925-9856 nnns volume:25 year:2004 number:2-3 month:09 pages:105-127 https://doi.org/10.1023/B:FORM.0000040025.89719.f3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4307 GBV_ILN_4324 54.00 VZ AR 25 2004 2-3 09 105-127 |
| language |
English |
| source |
Enthalten in Formal methods in system design 25(2004), 2-3 vom: Sept., Seite 105-127 volume:25 year:2004 number:2-3 month:09 pages:105-127 |
| sourceStr |
Enthalten in Formal methods in system design 25(2004), 2-3 vom: Sept., Seite 105-127 volume:25 year:2004 number:2-3 month:09 pages:105-127 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Formal methods in system design |
| authorswithroles_txt_mv |
Clarke, Edmund @@aut@@ Kroening, Daniel @@aut@@ Sharygina, Natasha @@aut@@ Yorav, Karen @@aut@@ |
| publishDateDaySort_date |
2004-09-01T00:00:00Z |
| hierarchy_top_id |
165669160 |
| dewey-sort |
14 |
| id |
OLC2038956170 |
| 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">OLC2038956170</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503061655.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2004 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/B:FORM.0000040025.89719.f3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2038956170</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)B:FORM.0000040025.89719.f3-p</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="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clarke, Edmund</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Predicate Abstraction of ANSI-C Programs Using SAT</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2004</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 2004</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kroening, Daniel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sharygina, Natasha</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yorav, Karen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Formal methods in system design</subfield><subfield code="d">Kluwer Academic Publishers, 1992</subfield><subfield code="g">25(2004), 2-3 vom: Sept., Seite 105-127</subfield><subfield code="w">(DE-627)165669160</subfield><subfield code="w">(DE-600)1122555-5</subfield><subfield code="w">(DE-576)032743114</subfield><subfield code="x">0925-9856</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2004</subfield><subfield code="g">number:2-3</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:105-127</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/B:FORM.0000040025.89719.f3</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_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2004</subfield><subfield code="e">2-3</subfield><subfield code="c">09</subfield><subfield code="h">105-127</subfield></datafield></record></collection>
|
| author |
Clarke, Edmund |
| spellingShingle |
Clarke, Edmund ddc 004 bkl 54.00 Predicate Abstraction of ANSI-C Programs Using SAT |
| authorStr |
Clarke, Edmund |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)165669160 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0925-9856 |
| topic_title |
004 VZ 54.00 bkl Predicate Abstraction of ANSI-C Programs Using SAT |
| topic |
ddc 004 bkl 54.00 |
| topic_unstemmed |
ddc 004 bkl 54.00 |
| topic_browse |
ddc 004 bkl 54.00 |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Formal methods in system design |
| hierarchy_parent_id |
165669160 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Formal methods in system design |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)165669160 (DE-600)1122555-5 (DE-576)032743114 |
| title |
Predicate Abstraction of ANSI-C Programs Using SAT |
| ctrlnum |
(DE-627)OLC2038956170 (DE-He213)B:FORM.0000040025.89719.f3-p |
| title_full |
Predicate Abstraction of ANSI-C Programs Using SAT |
| author_sort |
Clarke, Edmund |
| journal |
Formal methods in system design |
| journalStr |
Formal methods in system design |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2004 |
| contenttype_str_mv |
txt |
| container_start_page |
105 |
| author_browse |
Clarke, Edmund Kroening, Daniel Sharygina, Natasha Yorav, Karen |
| container_volume |
25 |
| class |
004 VZ 54.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Clarke, Edmund |
| doi_str_mv |
10.1023/B:FORM.0000040025.89719.f3 |
| dewey-full |
004 |
| title_sort |
predicate abstraction of ansi-c programs using sat |
| title_auth |
Predicate Abstraction of ANSI-C Programs Using SAT |
| abstract |
Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. © Kluwer Academic Publishers 2004 |
| abstractGer |
Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. © Kluwer Academic Publishers 2004 |
| abstract_unstemmed |
Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques. © Kluwer Academic Publishers 2004 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2244 GBV_ILN_4116 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4307 GBV_ILN_4324 |
| container_issue |
2-3 |
| title_short |
Predicate Abstraction of ANSI-C Programs Using SAT |
| url |
https://doi.org/10.1023/B:FORM.0000040025.89719.f3 |
| remote_bool |
false |
| author2 |
Kroening, Daniel Sharygina, Natasha Yorav, Karen |
| author2Str |
Kroening, Daniel Sharygina, Natasha Yorav, Karen |
| ppnlink |
165669160 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1023/B:FORM.0000040025.89719.f3 |
| up_date |
2024-07-03T20:59:43.073Z |
| _version_ |
1803593064723251200 |
| 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">OLC2038956170</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503061655.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2004 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/B:FORM.0000040025.89719.f3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2038956170</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)B:FORM.0000040025.89719.f3-p</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="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clarke, Edmund</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Predicate Abstraction of ANSI-C Programs Using SAT</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2004</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 2004</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kroening, Daniel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sharygina, Natasha</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yorav, Karen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Formal methods in system design</subfield><subfield code="d">Kluwer Academic Publishers, 1992</subfield><subfield code="g">25(2004), 2-3 vom: Sept., Seite 105-127</subfield><subfield code="w">(DE-627)165669160</subfield><subfield code="w">(DE-600)1122555-5</subfield><subfield code="w">(DE-576)032743114</subfield><subfield code="x">0925-9856</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2004</subfield><subfield code="g">number:2-3</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:105-127</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/B:FORM.0000040025.89719.f3</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_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2004</subfield><subfield code="e">2-3</subfield><subfield code="c">09</subfield><subfield code="h">105-127</subfield></datafield></record></collection>
|
| score |
7.4007425 |