{"department":[{"_id":"ToHe"}],"status":"public","isi":1,"article_processing_charge":"No","author":[{"first_name":"Marek","last_name":"Baranowski","full_name":"Baranowski, Marek"},{"first_name":"Shaobo","full_name":"He, Shaobo","last_name":"He"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Nguyen, Thanh Son","last_name":"Nguyen","first_name":"Thanh Son"},{"first_name":"Zvonimir","last_name":"Rakamarić","full_name":"Rakamarić, Zvonimir"}],"year":"2020","type":"conference","conference":{"start_date":"2020-07-01","name":"IJCAR: International Joint Conference on Automated Reasoning","end_date":"2020-07-04","location":"Paris, France"},"citation":{"ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31.","ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>."},"date_created":"2020-08-02T22:00:59Z","intvolume":"     12166","alternative_title":["LNCS"],"scopus_import":"1","date_updated":"2023-08-22T08:27:25Z","publisher":"Springer Nature","volume":12166,"oa_version":"Published Version","day":"24","publication_status":"published","month":"06","abstract":[{"lang":"eng","text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks."}],"date_published":"2020-06-24T00:00:00Z","page":"13-31","oa":1,"language":[{"iso":"eng"}],"project":[{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.1007/978-3-030-51074-9_2","open_access":"1"}],"publication_identifier":{"isbn":["9783030510732"],"eissn":["16113349"],"issn":["03029743"]},"_id":"8194","doi":"10.1007/978-3-030-51074-9_2","publication":"Automated Reasoning","quality_controlled":"1","external_id":{"isi":["000884318000002"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"An SMT theory of fixed-point arithmetic"}