{"id":"https://openalex.org/W6890139991","doi":"https://doi.org/10.34727/2022/isbn.978-3-85448-053-2_45","title":"TRICERA Verifying C Programs Using the Theory of Heaps","display_name":"TRICERA Verifying C Programs Using the Theory of Heaps","publication_year":2022,"publication_date":"2022-10-01","ids":{"openalex":"https://openalex.org/W6890139991","doi":"https://doi.org/10.34727/2022/isbn.978-3-85448-053-2_45"},"language":"en","primary_location":{"id":"pmh:oai:DiVA.org:uu-510212","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-510212","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-510212","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Esen, Zafer","orcid":"https://orcid.org/0000-0002-1522-6673"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Esen, Zafer","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1522-6673","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ruemmer, Philipp","orcid":"https://orcid.org/0000-0002-2733-7098"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ruemmer, Philipp","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2733-7098","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.7365999817848206},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.4165000021457672},{"id":"https://openalex.org/keywords/software-verification","display_name":"Software verification","score":0.3815000057220459},{"id":"https://openalex.org/keywords/functional-verification","display_name":"Functional verification","score":0.34150001406669617},{"id":"https://openalex.org/keywords/interface","display_name":"Interface (matter)","score":0.3328999876976013},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.32499998807907104},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.31029999256134033}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7365999817848206},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7178999781608582},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6660000085830688},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.4165000021457672},{"id":"https://openalex.org/C33054407","wikidata":"https://www.wikidata.org/wiki/Q6504747","display_name":"Software verification","level":5,"score":0.3815000057220459},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3783999979496002},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.34150001406669617},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.3328999876976013},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.2597000002861023}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:DiVA.org:uu-510212","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-510212","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.34727/2022/isbn.978-3-85448-053-2_45","is_oa":true,"landing_page_url":"https://doi.org/10.34727/2022/isbn.978-3-85448-053-2_45","pdf_url":null,"source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:uu-510212","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-510212","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"TRICERA":[0],"is":[1],"an":[2,88],"automated,":[3],"open-source":[4],"verification":[5,62,71],"tool":[6,37],"for":[7,73],"C":[8],"programs":[9,23],"based":[10],"on":[11,25],"the":[12,36,43,49,60,65,91],"concept":[13],"of":[14,32,42,90,93],"Constrained":[15],"Horn":[16],"Clauses":[17],"(CHCs).":[18],"In":[19],"order":[20],"to":[21,38,48,55,77],"handle":[22],"operating":[24],"heap,":[26],"Tricera":[27],"applies":[28],"a":[29,56,79],"novel":[30],"theory":[31,92],"heaps,":[33,94],"which":[34],"enables":[35,70],"hand":[39],"off":[40],"most":[41],"required":[44],"heap":[45,81],"reasoning":[46],"directly":[47],"underlying":[50],"CHC":[51,67],"solver.":[52],"This":[53],"leads":[54],"cleaner":[57],"interface":[58],"between":[59],"language-specific":[61],"front-end":[63],"and":[64,69,95],"language-independent":[66],"back-end,":[68],"tools":[72],"different":[74],"programming":[75],"languages":[76],"share":[78],"common":[80],"back-end.":[82],"The":[83],"paper":[84],"introduces":[85],"Tricera,":[86],"gives":[87],"overview":[89],"presents":[96],"preliminary":[97],"experimental":[98],"results":[99],"using":[100],"SV-COMP":[101],"benchmarks.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3}],"updated_date":"2026-05-18T08:16:58.900851","created_date":"2025-10-10T00:00:00"}