{"id":"https://openalex.org/W4253681328","doi":"https://doi.org/10.1145/2103656.2103690","title":"Static and user-extensible proof checking","display_name":"Static and user-extensible proof checking","publication_year":2012,"publication_date":"2012-01-24","ids":{"openalex":"https://openalex.org/W4253681328","doi":"https://doi.org/10.1145/2103656.2103690"},"language":"en","primary_location":{"id":"doi:10.1145/2103656.2103690","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2103656.2103690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045436150","display_name":"Antonis Stampoulis","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Antonis Stampoulis","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070627140","display_name":"Zhong Shao","orcid":"https://orcid.org/0000-0001-8184-7649"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhong Shao","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":2.8619,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92372789,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9962999820709229,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9962999820709229,"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/T11424","display_name":"Security and Verification in Computing","score":0.9952999949455261,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9657999873161316,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8627032041549683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8360300064086914},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5470874309539795},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.5439297556877136},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5254741907119751},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.4870493710041046},{"id":"https://openalex.org/keywords/scripting-language","display_name":"Scripting language","score":0.4654095470905304},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4300113022327423},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4246561527252197},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36057764291763306},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.3529745936393738}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8627032041549683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8360300064086914},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5470874309539795},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.5439297556877136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5254741907119751},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.4870493710041046},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.4654095470905304},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4300113022327423},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4246561527252197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36057764291763306},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.3529745936393738},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2103656.2103690","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2103656.2103690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1497011154","https://openalex.org/W1585533089","https://openalex.org/W1608751598","https://openalex.org/W1701372208","https://openalex.org/W1943070836","https://openalex.org/W1988177568","https://openalex.org/W2011757033","https://openalex.org/W2023035194","https://openalex.org/W2122626710","https://openalex.org/W2128057448","https://openalex.org/W2136310957","https://openalex.org/W2147137665","https://openalex.org/W2499178352","https://openalex.org/W4214826241","https://openalex.org/W4246191294","https://openalex.org/W4250846042","https://openalex.org/W4253681328","https://openalex.org/W4393246986","https://openalex.org/W6604894765","https://openalex.org/W6635266351"],"related_works":["https://openalex.org/W2099785256","https://openalex.org/W353523607","https://openalex.org/W3100311625","https://openalex.org/W4385763783","https://openalex.org/W4323929316","https://openalex.org/W187835144","https://openalex.org/W3196023996","https://openalex.org/W4389158536","https://openalex.org/W2408514828","https://openalex.org/W1598473030"],"abstract_inverted_index":{"Despite":[0],"recent":[1],"successes,":[2],"large-scale":[3],"proof":[4,7,33,57,102,177,188,207],"development":[5],"within":[6],"assistants":[8],"remains":[9],"an":[10,169],"arcane":[11],"art":[12],"that":[13,19,38,82,124],"is":[14,37,50,105,108],"extremely":[15],"time-consuming.":[16],"We":[17],"argue":[18],"this":[20,49,141,156,161],"can":[21,135],"be":[22,62,136],"attributed":[23],"to":[24,41,52,69,90,94,138,148,184,197],"two":[25,166],"profound":[26],"shortcomings":[27],"in":[28,201],"the":[29,53,56,97,151,202,214,222],"architecture":[30],"of":[31,46,55,100,128,194,205],"modern":[32,101],"assistants.":[34,103,208],"The":[35],"first":[36],"proofs":[39],"need":[40],"include":[42],"a":[43,198,217],"large":[44],"amount":[45],"minute":[47],"detail;":[48],"due":[51],"rigidity":[54],"checking":[58,193],"process,":[59],"which":[60],"cannot":[61],"extended":[63],"with":[64],"domain-specific":[65],"knowledge.":[66],"In":[67,155],"order":[68],"avoid":[70],"these":[71,180],"details,":[72],"we":[73,158],"rely":[74],"on":[75,160,213],"developing":[76],"and":[77,92,116,133,164,173,190,221],"using":[78],"tactics,":[79,195],"specialized":[80],"procedures":[81],"produce":[83],"proofs.":[84],"Unfortunately,":[85],"tactics":[86],"are":[87,211],"both":[88,186],"hard":[89,93],"write":[91],"use,":[95],"revealing":[96],"second":[98,142],"shortcoming":[99],"This":[104],"because":[106],"there":[107],"no":[109],"static":[110,176,192],"knowledge":[111],"about":[112],"their":[113],"expected":[114],"use":[115],"behavior.":[117],"As":[118],"has":[119],"recently":[120],"been":[121],"demonstrated,":[122],"languages":[123],"allow":[125],"type-safe":[126],"manipulation":[127],"proofs,":[129],"like":[130],"Beluga,":[131],"Delphin":[132],"VeriML,":[134],"used":[137],"partly":[139],"mitigate":[140],"issue,":[143],"by":[144],"assigning":[145],"rich":[146,223],"types":[147],"tactics.":[149],"Still,":[150],"architectural":[152],"issues":[153],"remain.":[154],"paper,":[157],"build":[159],"existing":[162],"work,":[163],"demonstrate":[165],"novel":[167],"ideas:":[168],"extensible":[170],"conversion":[171],"rule":[172],"support":[174,185],"for":[175],"scripts.":[178],"Together,":[179],"ideas":[181,210],"enable":[182],"us":[183],"user-extensible":[187],"checking,":[189],"sophisticated":[191],"leading":[196],"new":[199],"point":[200],"design":[203],"space":[204],"future":[206],"Both":[209],"based":[212],"interplay":[215],"between":[216],"light-weight":[218],"staging":[219],"construct":[220],"type":[224],"information":[225],"available.":[226]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}