{"id":"https://openalex.org/W7165659789","doi":"https://doi.org/10.48550/arxiv.2606.22063","title":"Guarded Equivalence Predicates for Scalable Formal Hardware Information-Flow Verification","display_name":"Guarded Equivalence Predicates for Scalable Formal Hardware Information-Flow Verification","publication_year":2026,"publication_date":"2026-06-20","ids":{"openalex":"https://openalex.org/W7165659789","doi":"https://doi.org/10.48550/arxiv.2606.22063"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.22063","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22063","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.22063","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102685162","display_name":"Liangtao Dai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dai, Liangtao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139176240","display_name":"Yimin Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Yimin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138903233","display_name":"Melika Morsali","orcid":"https://orcid.org/0009-0005-8663-7516"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morsali, Melika","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5093834703","display_name":"Mircea STAN","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stan, Mircea R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.7231000065803528,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.7231000065803528,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.1973000019788742,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.029999999329447746,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7576000094413757},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.629800021648407},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.579800009727478},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5485000014305115},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.46939998865127563},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.4242999851703644},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.39480000734329224},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.39169999957084656},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.3806999921798706}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7843000292778015},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7576000094413757},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.629800021648407},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5817000269889832},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.579800009727478},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5485000014305115},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5037999749183655},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.46939998865127563},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.39480000734329224},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.3806999921798706},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.35019999742507935},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.3465000092983246},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3118000030517578},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.3027999997138977},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C2781140086","wikidata":"https://www.wikidata.org/wiki/Q557945","display_name":"Confusion","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.2524999976158142},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.22063","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22063","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.22063","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22063","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7406855821609497,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Formal":[0],"hardware":[1,104],"information-flow":[2,24],"verification":[3,25],"is":[4],"a":[5,41,91,117,141],"principled":[6],"way":[7],"to":[8,26,45,113,132,136,212],"rule":[9],"out":[10],"secret-dependent":[11],"functional":[12],"or":[13,124],"timing":[14],"observations,":[15],"but":[16,80],"scaling":[17],"such":[18,98],"proofs":[19,199],"remains":[20],"difficult.":[21],"Self-composition":[22],"reduces":[23],"safety":[27],"checking":[28],"over":[29],"two":[30,187,193],"circuit":[31],"copies,":[32],"creating":[33],"relational":[34,164],"proof":[35,208],"obligations":[36],"that":[37,86,97],"are":[38,68,87,161],"hard":[39],"for":[40],"generic":[42],"PDR":[43,188],"engine":[44],"discover":[46],"from":[47,163],"bit-level":[48],"logic":[49],"alone.":[50],"Recent":[51],"PDR-based":[52],"techniques":[53],"exploit":[54],"this":[55],"duplicated":[56],"structure":[57],"through":[58],"copy":[59],"symmetry":[60],"and":[61,169,186],"global":[62],"cross-copy":[63],"equivalence":[64,130],"predicates.":[65],"These":[66],"predicates":[67,131,191],"effective":[69],"when":[70],"corresponding":[71,152],"internal":[72,108],"signals":[73],"agree":[74,114],"throughout":[75],"the":[76,148,151,177,180],"reachable":[77],"state":[78],"space,":[79],"they":[81],"do":[82],"not":[83],"capture":[84],"equalities":[85],"relevant":[88],"only":[89,115,172],"in":[90,103],"specific":[92],"control":[93,118],"context.":[94],"We":[95,127],"observe":[96],"contextual":[99,143,194],"relations":[100,135],"arise":[101],"naturally":[102],"IFV":[105,184],"proofs:":[106],"an":[107,146,156,203],"signal":[109],"pair":[110],"may":[111],"need":[112],"within":[116,200],"phase,":[119],"transaction":[120],"window,":[121],"loop":[122],"state,":[123],"protocol":[125],"region.":[126],"introduce":[128],"guarded":[129,190],"expose":[133],"these":[134],"PDR.":[137],"Rather":[138],"than":[139],"treating":[140],"proposed":[142,162],"equality":[144],"as":[145,155],"assumption,":[147],"verifier":[149],"submits":[150],"mismatch":[153],"condition":[154],"auxiliary":[157],"blocking":[158],"obligation.":[159],"Guards":[160],"counterexamples-to-induction":[165],"using":[166],"CTI-local":[167],"extraction":[168],"state-split":[170],"search;":[171],"candidates":[173],"proved":[174],"unreachable":[175],"by":[176,210],"backend":[178],"affect":[179],"proof.":[181],"Across":[182],"12":[183],"benchmarks":[185],"backends,":[189],"convert":[192],"baseline":[195],"timeouts":[196],"into":[197],"completed":[198],"34.2--89.5s":[201],"under":[202],"1800s":[204],"limit,":[205],"while":[206],"reducing":[207],"time":[209],"up":[211],"10.8x":[213],"on":[214],"additional":[215],"benchmarks.":[216]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-24T00:00:00"}