{"id":"https://openalex.org/W2943553270","doi":null,"title":"Deductive Program Analysis with First-Order Theorem Provers","display_name":"Deductive Program Analysis with First-Order Theorem Provers","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2943553270","mag":"2943553270"},"language":"en","primary_location":{"id":"pmh:oai:research.chalmers.se:509928","doi":null,"is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/509928","pdf_url":"https://research.chalmers.se/en/publication/509928","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.chalmers.se/en/publication/509928","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011013779","display_name":"Simon Robillard","orcid":"https://orcid.org/0000-0003-4751-380X","observed_orcids":["https://orcid.org/0000-0003-4751-380X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Simon Robillard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5011013779"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.006399999838322401,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/functional-verification","display_name":"functional verification","score":0.777999997138977},{"id":"https://openalex.org/keywords/termination-analysis","display_name":"termination analysis","score":0.9810000061988831},{"id":"https://openalex.org/keywords/invariant-generation","display_name":"invariant generation","score":0.925000011920929},{"id":"https://openalex.org/keywords/superposition-calculus","display_name":"superposition calculus","score":0.9179999828338623},{"id":"https://openalex.org/keywords/data-types","display_name":"data types","score":0.7940000295639038},{"id":"https://openalex.org/keywords/theory-extension","display_name":"theory extension","score":0.8399999737739563},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"automated reasoning","score":0.3790000081062317}],"concepts":[{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.8079294562339783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6536616683006287},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.6002430319786072},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6000251770019531},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5690576434135437},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5001342296600342},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4694523215293884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45377662777900696},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.44328010082244873},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4418783187866211},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.43214553594589233},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.426271915435791},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.4256367087364197},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.31046587228775024},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25602591037750244},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.16089719533920288},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:research.chalmers.se:509928","doi":null,"is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/509928","pdf_url":"https://research.chalmers.se/en/publication/509928","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:2943553270","doi":null,"is_oa":false,"landing_page_url":"https://research.chalmers.se/publication/509928/file/509928_Fulltext.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:research.chalmers.se:509928","doi":null,"is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/509928","pdf_url":"https://research.chalmers.se/en/publication/509928","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2574638813","display_name":"Symbolic Computation and Automated Reasoning for Program Analysis","funder_award_id":"639270","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G6991017272","display_name":null,"funder_award_id":"S11409-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2943553270.pdf","grobid_xml":"https://content.openalex.org/works/W2943553270.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2569846767","https://openalex.org/W2494123147","https://openalex.org/W2906781832","https://openalex.org/W6965344063","https://openalex.org/W2892684501","https://openalex.org/W3084664354","https://openalex.org/W6946062047","https://openalex.org/W2344230910","https://openalex.org/W2810262843","https://openalex.org/W2073935239"],"abstract_inverted_index":{"Software":[0],"is":[1,14,106],"ubiquitous":[2],"in":[3,38,69,179],"nearly":[4],"all":[5],"aspects":[6],"of":[7,54,72,83,86,103,163],"human":[8],"life,":[9],"including":[10],"safety-critical":[11],"activities.":[12],"It":[13],"therefore":[15],"crucial":[16],"to":[17,36,46,61,96,109,120,138,147,156,175],"analyze":[18],"programs":[19,88,131],"and":[20,49,75,100,105,126,151,165],"provide":[21],"strong":[22],"guarantees":[23],"that":[24],"they":[25,42],"perform":[26,176],"as":[27,41,192,194],"expected.":[28],"Automated":[29],"theorem":[30,64,115],"provers":[31,65,141,181],"are":[32,154],"increasingly":[33],"popular":[34],"tools":[35],"assist":[37],"this":[39,187],"task,":[40],"can":[43,93],"be":[44,94,183],"used":[45,95],"automatically":[47],"discover":[48],"prove":[50],"some":[51],"semantic":[52],"properties":[53,102],"programs.":[55,158],"This":[56,91],"thesis":[57],"explores":[58],"new":[59,200],"ways":[60],"use":[62],"automated":[63,114],"for":[66,129],"first-order":[67,80,161],"logic":[68,81],"the":[70,84,144,160,196],"context":[71],"program":[73,110],"analysis":[74,111,125],"verification.Firstly,":[76],"we":[77,135],"present":[78],"a":[79,170],"encoding":[82,92],"semantics":[85],"imperative":[87],"containing":[89],"loops.":[90],"express":[97],"both":[98],"functional":[99,122],"temporal":[101],"loops,":[104],"particularly":[107],"suited":[108],"with":[112,199],"an":[113],"prover.":[116],"We":[117,185],"employ":[118],"it":[119],"automate":[121],"verification,":[123],"termination":[124],"invariant":[127],"generation":[128],"iterative":[130],"operating":[132],"over":[133],"arrays.Secondly,":[134],"describe":[136],"how":[137],"extend":[139],"theorems":[140],"based":[142],"on":[143],"superposition":[145,197],"calculus":[146,198],"reason":[148],"about":[149],"datatypes":[150,164],"codatatypes,":[152],"which":[153],"central":[155],"many":[157],"As":[159],"theory":[162,177,190],"codatatypes":[166],"does":[167],"not":[168],"have":[169],"finite":[171],"axiomatization,":[172],"traditional":[173],"means":[174],"reasoning":[178],"superposition-based":[180],"cannot":[182],"used.":[184],"overcome":[186],"by":[188],"introducing":[189],"extensions":[191],"well":[193],"augmenting":[195],"rules.":[201]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2019-05-09T00:00:00"}
