Marek Baranowski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Marek Baranowski has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Zvonimir Rakamarić
University of Utah
2 shared publications - Ganesh Gopalakrishnan
University of Utah, Salt Lake City, USA
1 shared publication - Mathias Lechner
Institute of Science and Technology IST Austria
1 shared publication Shaobo He
University of Utah
1 shared publication- Shaobo He
University of Utah
1 shared publication - Thanh Son Nguyen
University of Utah
1 shared publication
Latest Publications
- Open Access
- 1 May 2025
- Published by Springer Nature
- p. 239-256
Equivalence Checking of a libm Port
Recent advances in satisfiability modulo theories have brought practical software verification within reach. The advent of the LLVM project presents a common representation which allows verification between programs written in different languages such as C and Rust. New programming languages such as Rust often have less complete standard libraries. In this work, we explore using the SMACK software verifier to check the equivalence of math library routines from the libm library and their translations into native Rust programs.
- 1 May 2025
- Published by Springer Nature
- p. 239-256
Open AccessEquivalence Checking of a libm Port
Recent advances in satisfiability modulo theories have brought practical software verification within reach. The advent of the LLVM project presents a common representation which allows verification between programs written in different languages such as C and Rust. New programming languages such as Rust often have less complete standard libraries. In this work, we explore using the SMACK software verifier to check the equivalence of math library routines from the libm library and their translations into native Rust programs.
- 24 June 2020
- Published by Springer Nature
- Vol. 12166, 13-31
An SMT Theory of Fixed-Point Arithmetic
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.
- 24 June 2020
- Published by Springer Nature
- Vol. 12166, 13-31
An SMT Theory of Fixed-Point Arithmetic
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.