Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification

Previously, gradual verification has been developed using overapproximating logics such as Hoare logic. We show that the static verification component of gradual verification is also connected to underapproximating logics like incorrectness logic. To do this, we use a novel definition of gradual ver...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zimmerman, Conrad, DiVincenzo, Jenna
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 Zimmerman, Conrad
DiVincenzo, Jenna
description Previously, gradual verification has been developed using overapproximating logics such as Hoare logic. We show that the static verification component of gradual verification is also connected to underapproximating logics like incorrectness logic. To do this, we use a novel definition of gradual verification and a novel gradualization of exact logic [Maksimovic et al. 2023] which we call gradual exact logic. Further, we show that Hoare logic, incorrectness logic, and gradual verification can be defined in terms of gradual exact logic. We hope that this connection can be used to develop tools and techniques that apply to both gradual verification and bug-finding. For example, we envision that techniques defined in terms of exact logic can be directly applied to verification, bug-finding, and gradual verification, using the principles of gradual typing [Garcia et al. 2016].
doi_str_mv 10.48550/arxiv.2412.00339
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_00339</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_00339</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_003393</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jMwMDa25GSIci9KTClNzFFwrUhMLlHwyU_PTLZSCM3LTKvMzEtX8MhPLEqFiCok5qUoeOYl5xcVpSaX5KUWF0PFyzITFWCmhKUWZaZlJieWZObn8TCwpiXmFKfyQmluBnk31xBnD12wK-ILijJzE4sq40GuiQe7xpiwCgBI4j-f</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification</title><source>arXiv.org</source><creator>Zimmerman, Conrad ; DiVincenzo, Jenna</creator><creatorcontrib>Zimmerman, Conrad ; DiVincenzo, Jenna</creatorcontrib><description>Previously, gradual verification has been developed using overapproximating logics such as Hoare logic. We show that the static verification component of gradual verification is also connected to underapproximating logics like incorrectness logic. To do this, we use a novel definition of gradual verification and a novel gradualization of exact logic [Maksimovic et al. 2023] which we call gradual exact logic. Further, we show that Hoare logic, incorrectness logic, and gradual verification can be defined in terms of gradual exact logic. We hope that this connection can be used to develop tools and techniques that apply to both gradual verification and bug-finding. For example, we envision that techniques defined in terms of exact logic can be directly applied to verification, bug-finding, and gradual verification, using the principles of gradual typing [Garcia et al. 2016].</description><identifier>DOI: 10.48550/arxiv.2412.00339</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science ; Computer Science - Programming Languages</subject><creationdate>2024-11</creationdate><rights>http://creativecommons.org/licenses/by/4.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/2412.00339$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.00339$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Zimmerman, Conrad</creatorcontrib><creatorcontrib>DiVincenzo, Jenna</creatorcontrib><title>Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification</title><description>Previously, gradual verification has been developed using overapproximating logics such as Hoare logic. We show that the static verification component of gradual verification is also connected to underapproximating logics like incorrectness logic. To do this, we use a novel definition of gradual verification and a novel gradualization of exact logic [Maksimovic et al. 2023] which we call gradual exact logic. Further, we show that Hoare logic, incorrectness logic, and gradual verification can be defined in terms of gradual exact logic. We hope that this connection can be used to develop tools and techniques that apply to both gradual verification and bug-finding. For example, we envision that techniques defined in terms of exact logic can be directly applied to verification, bug-finding, and gradual verification, using the principles of gradual typing [Garcia et al. 2016].</description><subject>Computer Science - Logic in Computer Science</subject><subject>Computer Science - Programming Languages</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jMwMDa25GSIci9KTClNzFFwrUhMLlHwyU_PTLZSCM3LTKvMzEtX8MhPLEqFiCok5qUoeOYl5xcVpSaX5KUWF0PFyzITFWCmhKUWZaZlJieWZObn8TCwpiXmFKfyQmluBnk31xBnD12wK-ILijJzE4sq40GuiQe7xpiwCgBI4j-f</recordid><startdate>20241129</startdate><enddate>20241129</enddate><creator>Zimmerman, Conrad</creator><creator>DiVincenzo, Jenna</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20241129</creationdate><title>Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification</title><author>Zimmerman, Conrad ; DiVincenzo, Jenna</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_003393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Computer Science - Programming Languages</topic><toplevel>online_resources</toplevel><creatorcontrib>Zimmerman, Conrad</creatorcontrib><creatorcontrib>DiVincenzo, Jenna</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zimmerman, Conrad</au><au>DiVincenzo, Jenna</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification</atitle><date>2024-11-29</date><risdate>2024</risdate><abstract>Previously, gradual verification has been developed using overapproximating logics such as Hoare logic. We show that the static verification component of gradual verification is also connected to underapproximating logics like incorrectness logic. To do this, we use a novel definition of gradual verification and a novel gradualization of exact logic [Maksimovic et al. 2023] which we call gradual exact logic. Further, we show that Hoare logic, incorrectness logic, and gradual verification can be defined in terms of gradual exact logic. We hope that this connection can be used to develop tools and techniques that apply to both gradual verification and bug-finding. For example, we envision that techniques defined in terms of exact logic can be directly applied to verification, bug-finding, and gradual verification, using the principles of gradual typing [Garcia et al. 2016].</abstract><doi>10.48550/arxiv.2412.00339</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2412.00339
ispartof
issn
language eng
recordid cdi_arxiv_primary_2412_00339
source arXiv.org
subjects Computer Science - Logic in Computer Science
Computer Science - Programming Languages
title Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T17%3A56%3A55IST&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=Gradual%20Exact%20Logic:%20Unifying%20Hoare%20Logic%20and%20Incorrectness%20Logic%20via%20Gradual%20Verification&rft.au=Zimmerman,%20Conrad&rft.date=2024-11-29&rft_id=info:doi/10.48550/arxiv.2412.00339&rft_dat=%3Carxiv_GOX%3E2412_00339%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