{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:14:58Z","timestamp":1740100498314,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012550","name":"National Research, Development and Innovation Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"NKFIH","doi-asserted-by":"publisher","award":["2019-2.1.3-NEMZ ECSEL-2019-00003"],"award-info":[{"award-number":["2019-2.1.3-NEMZ ECSEL-2019-00003"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1109\/ladc53747.2021.9672595","type":"proceedings-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T21:23:18Z","timestamp":1642454598000},"page":"01-08","source":"Crossref","is-referenced-by-count":2,"title":["Bitvector Support in the Theta Formal Verification Framework"],"prefix":"10.1109","author":[{"given":"Mihaly","family":"Dobos-Kovacs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akos","family":"Hajdu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andras","family":"Voros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2008.13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2003.1214874"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39570-8_11"},{"key":"ref13","first-page":"232","article-title":"Up-paal-a tool suite for automatic verification of real-time systems","author":"bengtsson","year":"0","journal-title":"International Workshop on Hybrid Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_14"},{"journal-title":"15th international sat-isfiability modulo theories competition (smt-comp 2020) Rules and procedures","year":"0","author":"barbosa","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106307"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108813"},{"key":"ref19","first-page":"1","article-title":"Strongest post-condition of unstructured programs","author":"grigore","year":"0","journal-title":"Proceedings of the 11th Inter-national Workshop on Formal Techniques for Java-like Programs"},{"key":"ref4","first-page":"14","article-title":"The smt-lib standard: Version 2.0","volume":"13","author":"barrett","year":"0","journal-title":"Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (Edinburgh England)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8_1"},{"journal-title":"Principles of Model Checking","year":"2008","author":"baier","key":"ref5"},{"key":"ref8","first-page":"447","author":"jhala","year":"2018","journal-title":"Predicate Abstraction for Program Verification"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_51"},{"key":"ref2","first-page":"305","author":"barrett","year":"2018","journal-title":"Workshop on Satisfiability Modulo Theories"},{"key":"ref1","first-page":"176","article-title":"Theta: a frame-work for abstraction refinement-based model checking","author":"t\u00f3th","year":"0","journal-title":"Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37057-1_11"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_38"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-019-09535-x"}],"event":{"name":"2021 10th Latin-American Symposium on Dependable Computing (LADC)","start":{"date-parts":[[2021,11,22]]},"location":"Florian\u00f3polis, Brazil","end":{"date-parts":[[2021,11,26]]}},"container-title":["2021 10th Latin-American Symposium on Dependable Computing (LADC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9672453\/9672552\/09672595.pdf?arnumber=9672595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:57:23Z","timestamp":1652201843000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9672595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/ladc53747.2021.9672595","relation":{},"subject":[],"published":{"date-parts":[[2021,11]]}}}