Alex Ozdemir
Alex Ozdemir
Verified email at - Homepage
Cited by
Cited by
cvc5: A versatile and industrial-strength SMT solver
H Barbosa, C Barrett, M Brain, G Kremer, H Lachnitt, M Mann, ...
International Conference on Tools and Algorithms for the Construction and …, 2022
Scaling verifiable computation using efficient set accumulators
A Ozdemir, R Wahby, B Whitehat, D Boneh
29th USENIX Security Symposium (USENIX Security 20), 2075-2092, 2020
Parallelization techniques for verifying neural networks.
H Wu, A Ozdemir, A Zeljić, K Julian, A Irfan, D Gopinath, S Fouladi, G Katz, ...
CirC: Compiler infrastructure for proof systems, software verification, and more
A Ozdemir, F Brown, RS Wahby
2022 IEEE Symposium on Security and Privacy (SP), 2248-2266, 2022
Experimenting with collaborative zk-SNARKs: Zero-Knowledge proofs for distributed secrets
A Ozdemir, D Boneh
31st USENIX Security Symposium (USENIX Security 22), 4291-4308, 2022
Flexible proof production in an industrial-strength SMT solver
H Barbosa, A Reynolds, G Kremer, H Lachnitt, A Niemetz, A Nötzli, ...
International Joint Conference on Automated Reasoning, 15-35, 2022
Efficient functional commitments: How to commit to a private function
D Boneh, W Nguyen, A Ozdemir
Cryptology ePrint Archive, 2021
Silph: A framework for scalable and accurate generation of hybrid MPC protocols
E Chen, J Zhu, A Ozdemir, RS Wahby, F Brown, W Zheng
2023 IEEE Symposium on Security and Privacy (SP), 848-863, 2023
Satisfiability modulo finite fields
A Ozdemir, G Kremer, C Tinelli, C Barrett
International Conference on Computer Aided Verification, 163-186, 2023
Clustering the space of maximum parsimony reconciliations in the duplication-transfer-loss model
A Ozdemir, M Sheely, D Bork, R Cheng, R Hulett, J Sung, J Wang, ...
Algorithms for Computational Biology: 4th International Conference, AlCoB …, 2017
DRAT-based bit-vector proofs in CVC4
A Ozdemir, A Niemetz, M Preiner, Y Zohar, C Barrett
Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019
Bounded Verification for Finite-Field-Blasting: In a Compiler for Zero Knowledge Proofs
A Ozdemir, RS Wahby, F Brown, C Barrett
International Conference on Computer Aided Verification, 154-175, 2023
CVC5 at the SMT Competition 2022
H Barbosa, C Barrett, M Brain, G Kremer, H Lachnitt, A Mohamed, ...
Sat solving in the serverless cloud
A Ozdemir, H Wu, C Barrett
2021 Formal Methods in Computer Aided Design (FMCAD), 241-245, 2021
R2e2: Low-latency path tracing of terabyte-scale scenes using thousands of cloud cpus
S Fouladi, B Shacklett, F Poms, A Arora, A Ozdemir, D Raghavan, ...
ACM Transactions on Graphics (TOG) 41 (4), 1-12, 2022
zkPi: Proving Lean Theorems in Zero-Knowledge
E Laufer, A Ozdemir, D Boneh
Cryptology ePrint Archive, 2024
Generating and exploiting automated reasoning proof certificates
H Barbosa, C Barrett, B Cook, B Dutertre, G Kremer, H Lachnitt, A Niemetz, ...
Communications of the ACM 66 (10), 86-95, 2023
Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers.
AA Nair, S Chattopadhyay, H Wu, A Ozdemir, CW Barrett
FMCAD, 84-88, 2022
Split Gröbner Bases for Satisfiability Modulo Finite Fields
A Ozdemir, S Pailoor, A Bassa, K Ferles, C Barrett, I Dillig
Cryptology ePrint Archive, 2024
Top-Down/Bottom-Up Splay Duality and Generalized Top-Down Splay
A Ozdemir
The system can't perform the operation now. Try again later.
Articles 1–20