{"id":"https://openalex.org/W2897230829","doi":"https://doi.org/10.23919/fmcad.2018.8603009","title":"Template-Based Verification of Heap-Manipulating Programs","display_name":"Template-Based Verification of Heap-Manipulating Programs","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2897230829","doi":"https://doi.org/10.23919/fmcad.2018.8603009","mag":"2897230829"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2018.8603009","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2018.8603009","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Template-based_verification_of_heap-manipulating_programs/23461112","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041166887","display_name":"Viktor Mal\u00edk","orcid":"https://orcid.org/0000-0002-0608-0748"},"institutions":[{"id":"https://openalex.org/I4210141904","display_name":"EduInnovation","ror":"https://ror.org/03s3qsz11","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210141904"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Viktor Malik","raw_affiliation_strings":["IT4Innovations Centre of Excellence, FIT BUT, CZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT4Innovations Centre of Excellence, FIT BUT, CZ","institution_ids":["https://openalex.org/I4210141904"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036499962","display_name":"Martin Hru\u0161ka","orcid":"https://orcid.org/0000-0003-2318-0940"},"institutions":[{"id":"https://openalex.org/I4210141904","display_name":"EduInnovation","ror":"https://ror.org/03s3qsz11","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210141904"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Hruska","raw_affiliation_strings":["IT4Innovations Centre of Excellence, FIT BUT, CZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT4Innovations Centre of Excellence, FIT BUT, CZ","institution_ids":["https://openalex.org/I4210141904"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066022930","display_name":"Peter Schrammel","orcid":"https://orcid.org/0000-0002-5713-1381"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Schrammel","raw_affiliation_strings":["Diffblue Ltd, Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Diffblue Ltd, Oxford, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086446392","display_name":"Tom\u00e1\u0161 Vojnar","orcid":"https://orcid.org/0000-0002-2746-8792"},"institutions":[{"id":"https://openalex.org/I4210141904","display_name":"EduInnovation","ror":"https://ror.org/03s3qsz11","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210141904"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tomas Vojnar","raw_affiliation_strings":["IT4Innovations Centre of Excellence, FIT BUT, CZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT4Innovations Centre of Excellence, FIT BUT, CZ","institution_ids":["https://openalex.org/I4210141904"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"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.9987000226974487,"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.9987000226974487,"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/T10260","display_name":"Software Engineering Research","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.843145489692688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7853946089744568},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6821649074554443},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.6215693950653076},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5885528922080994},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5722573399543762},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.529276430606842},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4701319634914398},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4543328881263733},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4395725429058075},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.4120123088359833},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.3794668912887573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37896308302879333}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.843145489692688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7853946089744568},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6821649074554443},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.6215693950653076},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5885528922080994},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5722573399543762},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.529276430606842},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4701319634914398},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4543328881263733},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4395725429058075},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.4120123088359833},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3794668912887573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37896308302879333}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23919/fmcad.2018.8603009","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2018.8603009","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/23461112","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Template-based_verification_of_heap-manipulating_programs/23461112","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},{"id":"pmh:oai:sro.sussex.ac.uk:78280","is_oa":true,"landing_page_url":"http://sro.sussex.ac.uk/78280/1/paper.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400129","display_name":"Sussex Research Online (University of Sussex)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162608824","host_organization_name":"University of Sussex","host_organization_lineage":["https://openalex.org/I162608824"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/23461112","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Template-based_verification_of_heap-manipulating_programs/23461112","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1001614398","https://openalex.org/W1508482211","https://openalex.org/W1517071433","https://openalex.org/W1522742464","https://openalex.org/W1580779595","https://openalex.org/W1581674879","https://openalex.org/W1592587615","https://openalex.org/W1686717288","https://openalex.org/W1826991911","https://openalex.org/W1839583963","https://openalex.org/W1976401986","https://openalex.org/W1976979256","https://openalex.org/W1985242567","https://openalex.org/W2004419599","https://openalex.org/W2013050211","https://openalex.org/W2014764321","https://openalex.org/W2043100293","https://openalex.org/W2045388381","https://openalex.org/W2097698142","https://openalex.org/W2123631714","https://openalex.org/W2129538349","https://openalex.org/W2137628566","https://openalex.org/W2138245690","https://openalex.org/W2161253570","https://openalex.org/W2170577595","https://openalex.org/W2211800868","https://openalex.org/W2232378406","https://openalex.org/W2348183150","https://openalex.org/W2570552138","https://openalex.org/W2797196027","https://openalex.org/W2962805785","https://openalex.org/W4238420531","https://openalex.org/W4241317396","https://openalex.org/W4312281318","https://openalex.org/W6653849975","https://openalex.org/W6678663716","https://openalex.org/W6679495168"],"related_works":["https://openalex.org/W1652311832","https://openalex.org/W2462453872","https://openalex.org/W2166247150","https://openalex.org/W2135396778","https://openalex.org/W4243252198","https://openalex.org/W2243428364","https://openalex.org/W3207171446","https://openalex.org/W2118300983","https://openalex.org/W1933894333","https://openalex.org/W1588132240"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,45,68],"shape":[3,29],"analysis":[4,7,93],"suitable":[5],"for":[6],"engines":[8],"that":[9,26,131,147],"perform":[10,132],"automatic":[11],"invariant":[12],"inference":[13],"using":[14],"an":[15,22],"SMT":[16],"solver.":[17],"The":[18,88,117],"proposed":[19],"solution":[20,118],"includes":[21],"abstract":[23,54,58],"template":[24],"domain":[25,60],"encodes":[27],"the":[28,31,85,92,123,133,139],"of":[30,53,81,108,138],"program":[32],"heap":[33,59,82],"based":[34,42],"on":[35,43,152],"logical":[36],"formulae":[37],"over":[38],"bit-vectors.":[39],"It":[40],"is":[41],"computing":[44],"points-to":[46],"relation":[47],"between":[48],"pointers":[49],"and":[50,79,101,126,161],"symbolic":[51],"addresses":[52],"memory":[55,99],"objects.":[56],"Our":[57],"can":[61,94],"be":[62,95],"combined":[63,155],"with":[64],"value":[65],"domains":[66],"in":[67,122,135],"straightforward":[69],"manner,":[70],"which":[71],"particularly":[72],"allows":[73],"us":[74],"to":[75,97],"reason":[76],"about":[77,157],"shapes":[78],"contents":[80],"structures":[83,160],"at":[84],"same":[86],"time.":[87],"information":[89],"obtained":[90],"from":[91],"used":[96],"prove":[98],"safety":[100],"reachability":[102],"properties,":[103],"expressed":[104],"by":[105],"user":[106],"assertions,":[107],"programs":[109],"manipulating":[110],"dynamic":[111],"data":[112,159],"structures,":[113],"mainly":[114],"linked":[115],"lists.":[116],"has":[119],"been":[120],"implemented":[121],"2LS":[124,148],"framework":[125],"compared":[127],"against":[128],"state-of-the-art":[129],"tools":[130,151],"best":[134],"heap-related":[136],"categories":[137],"well-known":[140],"Software":[141],"Verification":[142],"Competition":[143],"(SV-COMP).":[144],"Results":[145],"show":[146],"outperforms":[149],"these":[150],"benchmarks":[153],"requiring":[154],"reasoning":[156],"unbounded":[158],"their":[162],"numerical":[163],"contents.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}