Haoze Wu

Orcid: 0000-0002-5077-144X

Affiliations:
  • Stanford University, Department of Computer Science, CA, USA
  • Davidson College, Department of Mathematics and Computer Science, NC, USA


According to our database1, Haoze Wu authored at least 24 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Marabou 2.0: A Versatile Formal Analyzer of Neural Networks.
CoRR, 2024

Towards Efficient Verification of Quantized Neural Networks.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Global optimization of objective functions represented by ReLU networks.
Mach. Learn., October, 2023

Verifying MILP Certificates with SMT Solvers.
CoRR, 2023

Lemur: Integrating Large Language Models in Automated Program Verification.
CoRR, 2023

VeriX: Towards Verified Explainability of Deep Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Soy: An Efficient MILP Solver for Piecewise-Affine Systems.
IROS, 2023

Lightweight Online Learning for Sets of Related Problems in Automated Reasoning.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

Convex Bounds on the Softmax Function with Applications to Robustness Verification.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Scalable verification of GNN-based job schedulers.
Proc. ACM Program. Lang., 2022

Proof-Stitch: Proof Combination for Divide and Conquer SAT Solvers.
CoRR, 2022

Toward Certified Robustness Against Real-World Distribution Shifts.
CoRR, 2022

Efficient Neural Network Analysis with Sum-of-Infeasibilities.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

On Optimizing Back-Substitution Methods for Neural Network Verification.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

2021
An SMT-Based Approach for Verifying Binarized Neural Networks.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

DeepCert: Verification of Contextually Relevant Robustness for Neural Network Image Classifiers.
Proceedings of the Computer Safety, Reliability, and Security, 2021

SAT Solving in the Serverless Cloud.
Proceedings of the Formal Methods in Computer Aided Design, 2021

2020
Parallelization Techniques for Verifying Neural Networks.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

2019
Learning to Generate Industrial SAT Instances.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

G2SAT: Learning to Generate SAT Formulas.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

The Marabou Framework for Verification and Analysis of Deep Neural Networks.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2017
Improve SAT-solving with Machine Learning.
CoRR, 2017

Improving SAT-solving with Machine Learning.
Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education, 2017


  Loading...