SMT solvers: new oracles for the HOL theorem prover
Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques ava...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Weber, Tjark [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag 2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal on software tools for technology transfer - Springer-Verlag, 1997, 13(2011), 5 vom: 25. Feb., Seite 419-429 |
|---|---|
| Übergeordnetes Werk: |
volume:13 ; year:2011 ; number:5 ; day:25 ; month:02 ; pages:419-429 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-011-0188-8 |
|---|
| Katalog-ID: |
OLC2051503184 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2051503184 | ||
| 003 | DE-627 | ||
| 005 | 20230502154924.0 | ||
| 007 | tu | ||
| 008 | 200819s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-011-0188-8 |2 doi | |
| 035 | |a (DE-627)OLC2051503184 | ||
| 035 | |a (DE-He213)s10009-011-0188-8-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 Weber, Tjark |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a SMT solvers: new oracles for the HOL theorem prover |
| 264 | 1 | |c 2011 | |
| 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 2011 | ||
| 520 | |a Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. | ||
| 650 | 4 | |a Satisfiability Modulo Theories | |
| 650 | 4 | |a Interactive theorem proving | |
| 650 | 4 | |a Tool integration | |
| 773 | 0 | 8 | |i Enthalten in |t International journal on software tools for technology transfer |d Springer-Verlag, 1997 |g 13(2011), 5 vom: 25. Feb., Seite 419-429 |w (DE-627)244783365 |w (DE-600)1429686-X |w (DE-576)077448456 |x 1433-2779 |7 nnns |
| 773 | 1 | 8 | |g volume:13 |g year:2011 |g number:5 |g day:25 |g month:02 |g pages:419-429 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10009-011-0188-8 |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_70 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4247 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4305 | ||
| 951 | |a AR | ||
| 952 | |d 13 |j 2011 |e 5 |b 25 |c 02 |h 419-429 | ||
| author_variant |
t w tw |
|---|---|
| matchkey_str |
article:14332779:2011----::msleseoalsoteot |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s10009-011-0188-8 doi (DE-627)OLC2051503184 (DE-He213)s10009-011-0188-8-p DE-627 ger DE-627 rakwb eng 004 VZ Weber, Tjark verfasserin aut SMT solvers: new oracles for the HOL theorem prover 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2011 Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. Satisfiability Modulo Theories Interactive theorem proving Tool integration Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 13(2011), 5 vom: 25. Feb., Seite 419-429 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:13 year:2011 number:5 day:25 month:02 pages:419-429 https://doi.org/10.1007/s10009-011-0188-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 AR 13 2011 5 25 02 419-429 |
| spelling |
10.1007/s10009-011-0188-8 doi (DE-627)OLC2051503184 (DE-He213)s10009-011-0188-8-p DE-627 ger DE-627 rakwb eng 004 VZ Weber, Tjark verfasserin aut SMT solvers: new oracles for the HOL theorem prover 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2011 Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. Satisfiability Modulo Theories Interactive theorem proving Tool integration Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 13(2011), 5 vom: 25. Feb., Seite 419-429 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:13 year:2011 number:5 day:25 month:02 pages:419-429 https://doi.org/10.1007/s10009-011-0188-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 AR 13 2011 5 25 02 419-429 |
| allfields_unstemmed |
10.1007/s10009-011-0188-8 doi (DE-627)OLC2051503184 (DE-He213)s10009-011-0188-8-p DE-627 ger DE-627 rakwb eng 004 VZ Weber, Tjark verfasserin aut SMT solvers: new oracles for the HOL theorem prover 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2011 Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. Satisfiability Modulo Theories Interactive theorem proving Tool integration Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 13(2011), 5 vom: 25. Feb., Seite 419-429 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:13 year:2011 number:5 day:25 month:02 pages:419-429 https://doi.org/10.1007/s10009-011-0188-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 AR 13 2011 5 25 02 419-429 |
| allfieldsGer |
10.1007/s10009-011-0188-8 doi (DE-627)OLC2051503184 (DE-He213)s10009-011-0188-8-p DE-627 ger DE-627 rakwb eng 004 VZ Weber, Tjark verfasserin aut SMT solvers: new oracles for the HOL theorem prover 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2011 Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. Satisfiability Modulo Theories Interactive theorem proving Tool integration Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 13(2011), 5 vom: 25. Feb., Seite 419-429 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:13 year:2011 number:5 day:25 month:02 pages:419-429 https://doi.org/10.1007/s10009-011-0188-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 AR 13 2011 5 25 02 419-429 |
| allfieldsSound |
10.1007/s10009-011-0188-8 doi (DE-627)OLC2051503184 (DE-He213)s10009-011-0188-8-p DE-627 ger DE-627 rakwb eng 004 VZ Weber, Tjark verfasserin aut SMT solvers: new oracles for the HOL theorem prover 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2011 Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. Satisfiability Modulo Theories Interactive theorem proving Tool integration Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 13(2011), 5 vom: 25. Feb., Seite 419-429 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:13 year:2011 number:5 day:25 month:02 pages:419-429 https://doi.org/10.1007/s10009-011-0188-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 AR 13 2011 5 25 02 419-429 |
| language |
English |
| source |
Enthalten in International journal on software tools for technology transfer 13(2011), 5 vom: 25. Feb., Seite 419-429 volume:13 year:2011 number:5 day:25 month:02 pages:419-429 |
| sourceStr |
Enthalten in International journal on software tools for technology transfer 13(2011), 5 vom: 25. Feb., Seite 419-429 volume:13 year:2011 number:5 day:25 month:02 pages:419-429 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Satisfiability Modulo Theories Interactive theorem proving Tool integration |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
International journal on software tools for technology transfer |
| authorswithroles_txt_mv |
Weber, Tjark @@aut@@ |
| publishDateDaySort_date |
2011-02-25T00:00:00Z |
| hierarchy_top_id |
244783365 |
| dewey-sort |
14 |
| id |
OLC2051503184 |
| 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">OLC2051503184</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502154924.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-011-0188-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051503184</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10009-011-0188-8-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">Weber, Tjark</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">SMT solvers: new oracles for the HOL theorem prover</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">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 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Satisfiability Modulo Theories</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Interactive theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tool integration</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">13(2011), 5 vom: 25. Feb., Seite 419-429</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:13</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:5</subfield><subfield code="g">day:25</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:419-429</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10009-011-0188-8</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_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_4247</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">13</subfield><subfield code="j">2011</subfield><subfield code="e">5</subfield><subfield code="b">25</subfield><subfield code="c">02</subfield><subfield code="h">419-429</subfield></datafield></record></collection>
|
| author |
Weber, Tjark |
| spellingShingle |
Weber, Tjark ddc 004 misc Satisfiability Modulo Theories misc Interactive theorem proving misc Tool integration SMT solvers: new oracles for the HOL theorem prover |
| authorStr |
Weber, Tjark |
| 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 |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1433-2779 |
| topic_title |
004 VZ SMT solvers: new oracles for the HOL theorem prover Satisfiability Modulo Theories Interactive theorem proving Tool integration |
| topic |
ddc 004 misc Satisfiability Modulo Theories misc Interactive theorem proving misc Tool integration |
| topic_unstemmed |
ddc 004 misc Satisfiability Modulo Theories misc Interactive theorem proving misc Tool integration |
| topic_browse |
ddc 004 misc Satisfiability Modulo Theories misc Interactive theorem proving misc Tool integration |
| 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 |
SMT solvers: new oracles for the HOL theorem prover |
| ctrlnum |
(DE-627)OLC2051503184 (DE-He213)s10009-011-0188-8-p |
| title_full |
SMT solvers: new oracles for the HOL theorem prover |
| author_sort |
Weber, Tjark |
| 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 |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
419 |
| author_browse |
Weber, Tjark |
| container_volume |
13 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Weber, Tjark |
| doi_str_mv |
10.1007/s10009-011-0188-8 |
| dewey-full |
004 |
| title_sort |
smt solvers: new oracles for the hol theorem prover |
| title_auth |
SMT solvers: new oracles for the HOL theorem prover |
| abstract |
Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. © Springer-Verlag 2011 |
| abstractGer |
Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. © Springer-Verlag 2011 |
| abstract_unstemmed |
Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format. © Springer-Verlag 2011 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 |
| container_issue |
5 |
| title_short |
SMT solvers: new oracles for the HOL theorem prover |
| url |
https://doi.org/10.1007/s10009-011-0188-8 |
| remote_bool |
false |
| ppnlink |
244783365 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-011-0188-8 |
| up_date |
2024-07-04T04:36:11.738Z |
| _version_ |
1803621783818993664 |
| 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">OLC2051503184</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502154924.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-011-0188-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051503184</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10009-011-0188-8-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">Weber, Tjark</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">SMT solvers: new oracles for the HOL theorem prover</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">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 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices’s native input format with a translation to SMT-LIB format.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Satisfiability Modulo Theories</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Interactive theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tool integration</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">13(2011), 5 vom: 25. Feb., Seite 419-429</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:13</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:5</subfield><subfield code="g">day:25</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:419-429</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10009-011-0188-8</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_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_4247</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">13</subfield><subfield code="j">2011</subfield><subfield code="e">5</subfield><subfield code="b">25</subfield><subfield code="c">02</subfield><subfield code="h">419-429</subfield></datafield></record></collection>
|
| score |
7.4007034 |