Get started
Author

Clark Barrett

Observed names: Barrett, Clark, Barrett, Clark W., C. Barrett, C.W. Barrett, CLARK BARRETT, Clark W. Barrett
Observed institutions: Brigham Young University, Truth Initiative, Microsoft (United States), SRI International, IBM (United States), Intel (United States), Infineon Technologies (Germany), Courant Institute of Mathematical Sciences, New York University, Stanford University
ORCID: 0000-0002-9522-3084
Observed ORCID: 0000-0002-9522-3084
OpenAlex ID: A5026961968
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
2017 · Guy Katz, Clark Barrett, et al. · Lecture notes in computer science · 1,652
Satisfiability Modulo Theories
2018 · Clark Barrett, Cesare Tinelli · Springer eBooks · 1,122
The SMT-LIB Standard Version 2.0
2010 · Clark Barrett, Aaron Stump, et al. · 698
CVC4
2011 · Clark Barrett, Christopher L. Conway, et al. · Lecture notes in computer science · 655
The Marabou Framework for Verification and Analysis of Deep Neural Networks
2019 · Guy Katz, Derek A. Huang, et al. · Lecture notes in computer science · 498
PDF
cvc5: A Versatile and Industrial-Strength SMT Solver
2022 · Haniel Barbosa, Clark Barrett, et al. · Lecture notes in computer science · 468
PDF
Algorithms for Verifying Deep Neural Networks
2020 · Changliu Liu, Tomer Arnon, et al. · Foundations and Trends® in Optimization · 333
PDF
CVC Lite: A New Implementation of the Cooperating Validity Checker
2004 · Clark Barrett, Sergey Berezin · Lecture notes in computer science · 273
PDF
CVC: A Cooperating Validity Checker
2002 · Aaron Stump, Clark W. Barrett, et al. · Lecture notes in computer science · 200
CVC3
2007 · Clark Barrett, Cesare Tinelli · Springer eBooks · 196
PDF
Validity checking for combinations of theories with equality
1996 · Clark Barrett, David Dill, et al. · Lecture notes in computer science · 182
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
2002 · Clark W. Barrett, David L. Dill, et al. · Lecture notes in computer science · 150
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
2014 · Tianyi Liang, Andrew Reynolds, et al. · Lecture notes in computer science · 138
A decision procedure for an extensional theory of arrays
2002 · A. Stump, C.W. Barrett, et al. · Proceedings - Symposium on Logic in Computer Science · 137
SGLang: Efficient Execution of Structured Language Model Programs
2024 · Lianmin Zheng, Liangsheng Yin, et al. · neural information processing systems · 133
PDF
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
2015 · Andrew Reynolds, Morgan Deters, et al. · Lecture notes in computer science · 118
Towards Proving the Adversarial Robustness of Deep Neural Networks
2017 · Guy Katz, Clark Barrett, et al. · Electronic Proceedings in Theoretical Computer Science · 115
PDF
Splitting on Demand in SAT Modulo Theories
2006 · Clark Barrett, Robert Nieuwenhuis, et al. · Lecture notes in computer science · 108
A decision procedure for bit-vector arithmetic
1998 · Clark W. Barrett, David L. Dill, et al. · Proceedings - ACM IEEE Design Automation Conference · 107
PDF
Satisfiability Modulo Theories
2009 · Barrett Clark, Sebastiani Roberto, et al. · Frontiers in artificial intelligence and applications · 104
H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models
2023 · Zhenyu Zhang, Ying Sheng, et al. · neural information processing systems · 101
PDF
DeepSafe: A Data-Driven Approach for Assessing Robustness of Neural Networks
2018 · Divya Gopinath, Guy Katz, et al. · Lecture notes in computer science · 100
SMT-COMP: Satisfiability Modulo Theories Competition
2005 · Clark Barrett, Leonardo de Moura, et al. · Lecture notes in computer science · 100
Provably Minimally-Distorted Adversarial Examples
2017 · Carlini, Nicholas, Katz, Guy, et al. · arXiv (Cornell University) · 95
PDF
Chapter 33. Satisfiability Modulo Theories
2021 · Clark Barrett, Roberto Sebastiani, et al. · Frontiers in artificial intelligence and applications · 94
Works count: 291
Citation count: 11,190
H-index: 44
I10-index: 129
Year
Topic
Type