Zvonimir Rakamarić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zvonimir Rakamarić has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Ganesh Gopalakrishnan
University of Utah, Salt Lake City, USA
4 shared publications - Aleksandr Fedchin
Tufts University, Medford, USA
2 shared publications - Marek Baranowski
University of Utah
2 shared publications - Neha Rungta
Amazon Web Services, Seattle, USA
2 shared publications - Shaobo He
University of Utah
2 shared publications - Thanh Son Nguyen
University of Utah
2 shared publications
Latest Publications
- Open Access
- 26 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Probabilistic Machine Learning
- Vol. 1 (3) , 1-35
Automated Roundoff Error Analysis of Probabilistic Floating-Point Computations
We present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated with a random variable, and we prove that roundoff errors are generally close to being uncorrelated with their generating distribution. Based on these results, we propose a model of IEEE floating-point arithmetic for numerical expressions with probabilistic inputs and an algorithm for evaluating this model. Our algorithm provides rigorous bounds on the output and error distributions of arithmetic expressions over random variables, evaluated in the presence of roundoff errors. It keeps track of complex dependencies between random variables using an SMT solver, and is capable of providing sound but tight probabilistic bounds on roundoff errors using symbolic affine arithmetic. We implement the algorithm in the PAF tool, and evaluate it on FPBench, a standard benchmark suite for the analysis of roundoff errors in small kernels. Our evaluation shows that PAF computes tighter bounds than the current state of the art on almost all benchmarks.
- 26 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Probabilistic Machine Learning
- Vol. 1 (3) , 1-35
Open AccessAutomated Roundoff Error Analysis of Probabilistic Floating-Point Computations
We present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated with a random variable, and we prove that roundoff errors are generally close to being uncorrelated with their generating distribution. Based on these results, we propose a model of IEEE floating-point arithmetic for numerical expressions with probabilistic inputs and an algorithm for evaluating this model. Our algorithm provides rigorous bounds on the output and error distributions of arithmetic expressions over random variables, evaluated in the presence of roundoff errors. It keeps track of complex dependencies between random variables using an SMT solver, and is capable of providing sound but tight probabilistic bounds on roundoff errors using symbolic affine arithmetic. We implement the algorithm in the PAF tool, and evaluate it on FPBench, a standard benchmark suite for the analysis of roundoff errors in small kernels. Our evaluation shows that PAF computes tighter bounds than the current state of the art on almost all benchmarks.
- 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.
- 23 August 2022
- Published by Springer Nature
- p. 44-60
Synthesis of Rigorous Floating-Point Predicates
- Open Access
- 30 March 2022
- Published by Springer Nature
- p. 404-411
Better Counterexamples for Dafny
Dafny is a verification-aware programming language used at Amazon Web Services to develop critical components of their access management, storage, and cryptography infrastructures. The Dafny toolchain provides a verifier that can prove an implementation of a method satisfies its specification. When the underlying SMT solver cannot establish a proof, it generates a counterexample. These counterexamples are hard to understand and their interpretation is often a bottleneck in the proof debugging process. In this paper, we introduce an open-source tool that transforms counterexamples generated by the SMT solver to a more user-friendly format that maps to the Dafny syntax and is suitable for further processing. This new tool allows the Dafny developers to quickly identify the root cause of a problem with their proof, thereby speeding up the development of Dafny projects.
- 30 March 2022
- Published by Springer Nature
- p. 404-411
Open AccessBetter Counterexamples for Dafny
Dafny is a verification-aware programming language used at Amazon Web Services to develop critical components of their access management, storage, and cryptography infrastructures. The Dafny toolchain provides a verifier that can prove an implementation of a method satisfies its specification. When the underlying SMT solver cannot establish a proof, it generates a counterexample. These counterexamples are hard to understand and their interpretation is often a bottleneck in the proof debugging process. In this paper, we introduce an open-source tool that transforms counterexamples generated by the SMT solver to a more user-friendly format that maps to the Dafny syntax and is suitable for further processing. This new tool allows the Dafny developers to quickly identify the root cause of a problem with their proof, thereby speeding up the development of Dafny projects.
- 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.
- 9 August 2018
- Published by Springer Nature
- p. 89-109
Study of Integrating Random and Symbolic Testing for Object-Oriented Software
- 9 August 2018
- Published by Springer Nature
- p. 89-109
Study of Integrating Random and Symbolic Testing for Object-Oriented Software
- 4 May 2018
- Published by EasyChair in Kalpa Publications in Computing
Moving the Needle on Rigorous Floating-Point Precision Tuning
- 4 May 2018
- Published by EasyChair in Kalpa Publications in Computing
Moving the Needle on Rigorous Floating-Point Precision Tuning
- 18 July 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 60 (1) , 23-42
Verifying Relative Safety, Accuracy, and Termination for Program Approximations
- 18 July 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 60 (1) , 23-42
Verifying Relative Safety, Accuracy, and Termination for Program Approximations
- 1 May 2015
- Published by Springer Nature
- p. 317-331
Systematic Debugging of Concurrent Systems Using Coalesced Stack Trace Graphs
- 1 May 2015
- Published by Springer Nature
- p. 317-331
Systematic Debugging of Concurrent Systems Using Coalesced Stack Trace Graphs