A Framework for the Verification of Certifying Computations
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually involves intricate mathematical theorems. Certifying algorithms compute in addition to each output a witness certifying that...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Alkassar, Eyad Böhme, Sascha Mehlhorn, Kurt Rizkallah, Christine |
| description | Formal verification of complex algorithms is challenging. Verifying their
implementations goes beyond the state of the art of current automatic
verification tools and usually involves intricate mathematical theorems.
Certifying algorithms compute in addition to each output a witness certifying
that the output is correct. A checker for such a witness is usually much
simpler than the original algorithm - yet it is all the user has to trust. The
verification of checkers is feasible with current tools and leads to
computations that can be completely trusted. We describe a framework to
seamlessly verify certifying computations. We use the automatic verifier VCC
for establishing the correctness of the checker and the interactive theorem
prover Isabelle/HOL for high-level mathematical properties of algorithms. We
demonstrate the effectiveness of our approach by presenting the verification of
typical examples of the industrial-level and widespread algorithmic library
LEDA. |
| doi_str_mv | 10.48550/arxiv.1301.7462 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1301_7462</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1301_7462</sourcerecordid><originalsourceid>FETCH-LOGICAL-a652-fd4e59d9216f4ef0b23d178c5cd3736584d51357d95f44e549c50772340433c23</originalsourceid><addsrcrecordid>eNotjz1PwzAURb0woMLOhPwHEmy_9-JETFVEAakSS8UaGduvtSB15YaP_nto6XSHe3V0jxA3WtXYEqk7V37SV61B6dpiYy7F_Vwuihvjdy7vknOR0ybK11gSJ--mlLcys-xjmRIf0nYt-zzuPqdTs78SF-w-9vH6nDOxWjys-qdq-fL43M-XlWvIVBwwUhc6oxvGyOrNQNC29eQDWGioxUAayIaOGP-m2HlS1hpAhQDewEzc_mNP54ddSaMrh-EoMRwl4BfSKUBr</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Framework for the Verification of Certifying Computations</title><source>arXiv.org</source><creator>Alkassar, Eyad ; Böhme, Sascha ; Mehlhorn, Kurt ; Rizkallah, Christine</creator><creatorcontrib>Alkassar, Eyad ; Böhme, Sascha ; Mehlhorn, Kurt ; Rizkallah, Christine</creatorcontrib><description>Formal verification of complex algorithms is challenging. Verifying their
implementations goes beyond the state of the art of current automatic
verification tools and usually involves intricate mathematical theorems.
Certifying algorithms compute in addition to each output a witness certifying
that the output is correct. A checker for such a witness is usually much
simpler than the original algorithm - yet it is all the user has to trust. The
verification of checkers is feasible with current tools and leads to
computations that can be completely trusted. We describe a framework to
seamlessly verify certifying computations. We use the automatic verifier VCC
for establishing the correctness of the checker and the interactive theorem
prover Isabelle/HOL for high-level mathematical properties of algorithms. We
demonstrate the effectiveness of our approach by presenting the verification of
typical examples of the industrial-level and widespread algorithmic library
LEDA.</description><identifier>DOI: 10.48550/arxiv.1301.7462</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Formal Languages and Automata Theory ; Computer Science - Logic in Computer Science</subject><creationdate>2013-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1301.7462$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1301.7462$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Alkassar, Eyad</creatorcontrib><creatorcontrib>Böhme, Sascha</creatorcontrib><creatorcontrib>Mehlhorn, Kurt</creatorcontrib><creatorcontrib>Rizkallah, Christine</creatorcontrib><title>A Framework for the Verification of Certifying Computations</title><description>Formal verification of complex algorithms is challenging. Verifying their
implementations goes beyond the state of the art of current automatic
verification tools and usually involves intricate mathematical theorems.
Certifying algorithms compute in addition to each output a witness certifying
that the output is correct. A checker for such a witness is usually much
simpler than the original algorithm - yet it is all the user has to trust. The
verification of checkers is feasible with current tools and leads to
computations that can be completely trusted. We describe a framework to
seamlessly verify certifying computations. We use the automatic verifier VCC
for establishing the correctness of the checker and the interactive theorem
prover Isabelle/HOL for high-level mathematical properties of algorithms. We
demonstrate the effectiveness of our approach by presenting the verification of
typical examples of the industrial-level and widespread algorithmic library
LEDA.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Formal Languages and Automata Theory</subject><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjz1PwzAURb0woMLOhPwHEmy_9-JETFVEAakSS8UaGduvtSB15YaP_nto6XSHe3V0jxA3WtXYEqk7V37SV61B6dpiYy7F_Vwuihvjdy7vknOR0ybK11gSJ--mlLcys-xjmRIf0nYt-zzuPqdTs78SF-w-9vH6nDOxWjys-qdq-fL43M-XlWvIVBwwUhc6oxvGyOrNQNC29eQDWGioxUAayIaOGP-m2HlS1hpAhQDewEzc_mNP54ddSaMrh-EoMRwl4BfSKUBr</recordid><startdate>20130130</startdate><enddate>20130130</enddate><creator>Alkassar, Eyad</creator><creator>Böhme, Sascha</creator><creator>Mehlhorn, Kurt</creator><creator>Rizkallah, Christine</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20130130</creationdate><title>A Framework for the Verification of Certifying Computations</title><author>Alkassar, Eyad ; Böhme, Sascha ; Mehlhorn, Kurt ; Rizkallah, Christine</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a652-fd4e59d9216f4ef0b23d178c5cd3736584d51357d95f44e549c50772340433c23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Formal Languages and Automata Theory</topic><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Alkassar, Eyad</creatorcontrib><creatorcontrib>Böhme, Sascha</creatorcontrib><creatorcontrib>Mehlhorn, Kurt</creatorcontrib><creatorcontrib>Rizkallah, Christine</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Alkassar, Eyad</au><au>Böhme, Sascha</au><au>Mehlhorn, Kurt</au><au>Rizkallah, Christine</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Framework for the Verification of Certifying Computations</atitle><date>2013-01-30</date><risdate>2013</risdate><abstract>Formal verification of complex algorithms is challenging. Verifying their
implementations goes beyond the state of the art of current automatic
verification tools and usually involves intricate mathematical theorems.
Certifying algorithms compute in addition to each output a witness certifying
that the output is correct. A checker for such a witness is usually much
simpler than the original algorithm - yet it is all the user has to trust. The
verification of checkers is feasible with current tools and leads to
computations that can be completely trusted. We describe a framework to
seamlessly verify certifying computations. We use the automatic verifier VCC
for establishing the correctness of the checker and the interactive theorem
prover Isabelle/HOL for high-level mathematical properties of algorithms. We
demonstrate the effectiveness of our approach by presenting the verification of
typical examples of the industrial-level and widespread algorithmic library
LEDA.</abstract><doi>10.48550/arxiv.1301.7462</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1301.7462 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1301_7462 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Computer Science - Formal Languages and Automata Theory Computer Science - Logic in Computer Science |
| title | A Framework for the Verification of Certifying Computations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T15%3A33%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Framework%20for%20the%20Verification%20of%20Certifying%20Computations&rft.au=Alkassar,%20Eyad&rft.date=2013-01-30&rft_id=info:doi/10.48550/arxiv.1301.7462&rft_dat=%3Carxiv_GOX%3E1301_7462%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |