Computational challenges in bounded model checking
Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC i...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Clarke, Edmund [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2005 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag 2005 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal on software tools for technology transfer - Springer Berlin Heidelberg, 1997, 7(2005), 2 vom: 15. Feb., Seite 174-183 |
|---|---|
| Übergeordnetes Werk: |
volume:7 ; year:2005 ; number:2 ; day:15 ; month:02 ; pages:174-183 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-004-0182-5 |
|---|
| Katalog-ID: |
OLC2051501009 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2051501009 | ||
| 003 | DE-627 | ||
| 005 | 20230502154912.0 | ||
| 007 | tu | ||
| 008 | 200819s2005 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-004-0182-5 |2 doi | |
| 035 | |a (DE-627)OLC2051501009 | ||
| 035 | |a (DE-He213)s10009-004-0182-5-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Clarke, Edmund |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Computational challenges in bounded model checking |
| 264 | 1 | |c 2005 | |
| 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 © Springer-Verlag 2005 | ||
| 520 | |a Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. | ||
| 650 | 4 | |a Bonded-Model-checking | |
| 650 | 4 | |a Complexity | |
| 650 | 4 | |a Completeness-Threshold | |
| 700 | 1 | |a Kroening, Daniel |4 aut | |
| 700 | 1 | |a Ouaknine, Joël |4 aut | |
| 700 | 1 | |a Strichman, Ofer |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International journal on software tools for technology transfer |d Springer Berlin Heidelberg, 1997 |g 7(2005), 2 vom: 15. Feb., Seite 174-183 |w (DE-627)244783365 |w (DE-600)1429686-X |w (DE-576)077448456 |x 1433-2779 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:2005 |g number:2 |g day:15 |g month:02 |g pages:174-183 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10009-004-0182-5 |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_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 2005 |e 2 |b 15 |c 02 |h 174-183 | ||
| author_variant |
e c ec d k dk j o jo o s os |
|---|---|
| matchkey_str |
article:14332779:2005----::opttoacalneibudd |
| hierarchy_sort_str |
2005 |
| publishDate |
2005 |
| allfields |
10.1007/s10009-004-0182-5 doi (DE-627)OLC2051501009 (DE-He213)s10009-004-0182-5-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Computational challenges in bounded model checking 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2005 Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. Bonded-Model-checking Complexity Completeness-Threshold Kroening, Daniel aut Ouaknine, Joël aut Strichman, Ofer aut Enthalten in International journal on software tools for technology transfer Springer Berlin Heidelberg, 1997 7(2005), 2 vom: 15. Feb., Seite 174-183 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:7 year:2005 number:2 day:15 month:02 pages:174-183 https://doi.org/10.1007/s10009-004-0182-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 7 2005 2 15 02 174-183 |
| spelling |
10.1007/s10009-004-0182-5 doi (DE-627)OLC2051501009 (DE-He213)s10009-004-0182-5-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Computational challenges in bounded model checking 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2005 Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. Bonded-Model-checking Complexity Completeness-Threshold Kroening, Daniel aut Ouaknine, Joël aut Strichman, Ofer aut Enthalten in International journal on software tools for technology transfer Springer Berlin Heidelberg, 1997 7(2005), 2 vom: 15. Feb., Seite 174-183 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:7 year:2005 number:2 day:15 month:02 pages:174-183 https://doi.org/10.1007/s10009-004-0182-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 7 2005 2 15 02 174-183 |
| allfields_unstemmed |
10.1007/s10009-004-0182-5 doi (DE-627)OLC2051501009 (DE-He213)s10009-004-0182-5-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Computational challenges in bounded model checking 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2005 Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. Bonded-Model-checking Complexity Completeness-Threshold Kroening, Daniel aut Ouaknine, Joël aut Strichman, Ofer aut Enthalten in International journal on software tools for technology transfer Springer Berlin Heidelberg, 1997 7(2005), 2 vom: 15. Feb., Seite 174-183 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:7 year:2005 number:2 day:15 month:02 pages:174-183 https://doi.org/10.1007/s10009-004-0182-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 7 2005 2 15 02 174-183 |
| allfieldsGer |
10.1007/s10009-004-0182-5 doi (DE-627)OLC2051501009 (DE-He213)s10009-004-0182-5-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Computational challenges in bounded model checking 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2005 Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. Bonded-Model-checking Complexity Completeness-Threshold Kroening, Daniel aut Ouaknine, Joël aut Strichman, Ofer aut Enthalten in International journal on software tools for technology transfer Springer Berlin Heidelberg, 1997 7(2005), 2 vom: 15. Feb., Seite 174-183 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:7 year:2005 number:2 day:15 month:02 pages:174-183 https://doi.org/10.1007/s10009-004-0182-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 7 2005 2 15 02 174-183 |
| allfieldsSound |
10.1007/s10009-004-0182-5 doi (DE-627)OLC2051501009 (DE-He213)s10009-004-0182-5-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Computational challenges in bounded model checking 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2005 Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. Bonded-Model-checking Complexity Completeness-Threshold Kroening, Daniel aut Ouaknine, Joël aut Strichman, Ofer aut Enthalten in International journal on software tools for technology transfer Springer Berlin Heidelberg, 1997 7(2005), 2 vom: 15. Feb., Seite 174-183 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:7 year:2005 number:2 day:15 month:02 pages:174-183 https://doi.org/10.1007/s10009-004-0182-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 7 2005 2 15 02 174-183 |
| language |
English |
| source |
Enthalten in International journal on software tools for technology transfer 7(2005), 2 vom: 15. Feb., Seite 174-183 volume:7 year:2005 number:2 day:15 month:02 pages:174-183 |
| sourceStr |
Enthalten in International journal on software tools for technology transfer 7(2005), 2 vom: 15. Feb., Seite 174-183 volume:7 year:2005 number:2 day:15 month:02 pages:174-183 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Bonded-Model-checking Complexity Completeness-Threshold |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
International journal on software tools for technology transfer |
| authorswithroles_txt_mv |
Clarke, Edmund @@aut@@ Kroening, Daniel @@aut@@ Ouaknine, Joël @@aut@@ Strichman, Ofer @@aut@@ |
| publishDateDaySort_date |
2005-02-15T00:00:00Z |
| hierarchy_top_id |
244783365 |
| dewey-sort |
14 |
| id |
OLC2051501009 |
| 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">OLC2051501009</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502154912.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-004-0182-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051501009</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10009-004-0182-5-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="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">Computational challenges in bounded model checking</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2005</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">© Springer-Verlag 2005</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bonded-Model-checking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Completeness-Threshold</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">Ouaknine, Joël</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Strichman, Ofer</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 Berlin Heidelberg, 1997</subfield><subfield code="g">7(2005), 2 vom: 15. Feb., Seite 174-183</subfield><subfield code="w">(DE-627)244783365</subfield><subfield code="w">(DE-600)1429686-X</subfield><subfield code="w">(DE-576)077448456</subfield><subfield code="x">1433-2779</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:2</subfield><subfield code="g">day:15</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:174-183</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10009-004-0182-5</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_40</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_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</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_4277</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_4306</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2005</subfield><subfield code="e">2</subfield><subfield code="b">15</subfield><subfield code="c">02</subfield><subfield code="h">174-183</subfield></datafield></record></collection>
|
| author |
Clarke, Edmund |
| spellingShingle |
Clarke, Edmund ddc 004 misc Bonded-Model-checking misc Complexity misc Completeness-Threshold Computational challenges in bounded model checking |
| authorStr |
Clarke, Edmund |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)244783365 |
| 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 |
1433-2779 |
| topic_title |
004 VZ Computational challenges in bounded model checking Bonded-Model-checking Complexity Completeness-Threshold |
| topic |
ddc 004 misc Bonded-Model-checking misc Complexity misc Completeness-Threshold |
| topic_unstemmed |
ddc 004 misc Bonded-Model-checking misc Complexity misc Completeness-Threshold |
| topic_browse |
ddc 004 misc Bonded-Model-checking misc Complexity misc Completeness-Threshold |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
International journal on software tools for technology transfer |
| hierarchy_parent_id |
244783365 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
International journal on software tools for technology transfer |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 |
| title |
Computational challenges in bounded model checking |
| ctrlnum |
(DE-627)OLC2051501009 (DE-He213)s10009-004-0182-5-p |
| title_full |
Computational challenges in bounded model checking |
| author_sort |
Clarke, Edmund |
| journal |
International journal on software tools for technology transfer |
| journalStr |
International journal on software tools for technology transfer |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2005 |
| contenttype_str_mv |
txt |
| container_start_page |
174 |
| author_browse |
Clarke, Edmund Kroening, Daniel Ouaknine, Joël Strichman, Ofer |
| container_volume |
7 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Clarke, Edmund |
| doi_str_mv |
10.1007/s10009-004-0182-5 |
| dewey-full |
004 |
| title_sort |
computational challenges in bounded model checking |
| title_auth |
Computational challenges in bounded model checking |
| abstract |
Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. © Springer-Verlag 2005 |
| abstractGer |
Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. © Springer-Verlag 2005 |
| abstract_unstemmed |
Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. © Springer-Verlag 2005 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 |
| container_issue |
2 |
| title_short |
Computational challenges in bounded model checking |
| url |
https://doi.org/10.1007/s10009-004-0182-5 |
| remote_bool |
false |
| author2 |
Kroening, Daniel Ouaknine, Joël Strichman, Ofer |
| author2Str |
Kroening, Daniel Ouaknine, Joël Strichman, Ofer |
| ppnlink |
244783365 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-004-0182-5 |
| up_date |
2024-07-04T04:35:53.995Z |
| _version_ |
1803621765206769664 |
| 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">OLC2051501009</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502154912.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-004-0182-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051501009</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10009-004-0182-5-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="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">Computational challenges in bounded model checking</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2005</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">© Springer-Verlag 2005</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bonded-Model-checking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Completeness-Threshold</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">Ouaknine, Joël</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Strichman, Ofer</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 Berlin Heidelberg, 1997</subfield><subfield code="g">7(2005), 2 vom: 15. Feb., Seite 174-183</subfield><subfield code="w">(DE-627)244783365</subfield><subfield code="w">(DE-600)1429686-X</subfield><subfield code="w">(DE-576)077448456</subfield><subfield code="x">1433-2779</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:2</subfield><subfield code="g">day:15</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:174-183</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10009-004-0182-5</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_40</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_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</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_4277</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_4306</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2005</subfield><subfield code="e">2</subfield><subfield code="b">15</subfield><subfield code="c">02</subfield><subfield code="h">174-183</subfield></datafield></record></collection>
|
| score |
7.3985205 |