H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 34 Citations 8,262 127 World Ranking 6507 National Ranking 3091

Research.com Recognitions

Awards & Achievements

2014 - ACM Distinguished Member

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Artificial intelligence

Theoretical computer science, Satisfiability modulo theories, Programming language, Automated theorem proving and Artificial neural network are his primary areas of study. His biological study spans a wide range of topics, including Fragment, Solver and Concatenation. His studies in Solver integrate themes in fields like Mathematical proof and Logical theory.

In his study, Clark Barrett carries out multidisciplinary Satisfiability modulo theories and Research groups research. His work carried out in the field of Programming language brings together such families of science as Interfacing and Modulo. His research integrates issues of Airborne collision avoidance system and Robustness in his study of Artificial neural network.

His most cited work include:

  • Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks (757 citations)
  • Satisfiability Modulo Theories (732 citations)
  • The SMT-LIB Standard Version 2.0 (587 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Satisfiability modulo theories, Theoretical computer science, Programming language, Solver and Algorithm. The Satisfiability modulo theories study which covers Algebra that intersects with Quantifier. His Theoretical computer science study combines topics in areas such as Mathematical proof and Set.

His work on Correctness, Compiler and Source code as part of general Programming language research is often related to TRACE, thus linking different fields of science. His research in Correctness intersects with topics in Artificial neural network and Artificial intelligence. As part of the same scientific family, he usually focuses on Solver, concentrating on Regular expression and intersecting with String.

He most often published in these fields:

  • Satisfiability modulo theories (35.98%)
  • Theoretical computer science (32.28%)
  • Programming language (24.34%)

What were the highlights of his more recent work (between 2018-2021)?

  • Satisfiability modulo theories (35.98%)
  • Artificial neural network (12.17%)
  • Formal verification (12.17%)

In recent papers he was focusing on the following fields of study:

Clark Barrett mainly investigates Satisfiability modulo theories, Artificial neural network, Formal verification, Theoretical computer science and Artificial intelligence. His Satisfiability modulo theories research includes themes of Solver, Algebraic number, Algebra and String. Clark Barrett has researched Artificial neural network in several fields, including Field, Correctness, Distributed computing and Leverage.

In his study, Embedded system, Microcontroller, Logic gate and Logic synthesis is inextricably linked to Debugging, which falls within the broad field of Formal verification. His Theoretical computer science research includes elements of Mathematical proof, Set and Global optimization. His Artificial intelligence study integrates concerns from other disciplines, such as Routing and Machine learning.

Between 2018 and 2021, his most popular works were:

  • The Marabou Framework for Verification and Analysis of Deep Neural Networks (101 citations)
  • Algorithms for Verifying Deep Neural Networks (59 citations)
  • Verifying Deep-RL-Driven Systems (22 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Artificial intelligence

Clark Barrett mainly investigates Artificial neural network, Satisfiability modulo theories, Artificial intelligence, Formal verification and Scalability. The concepts of his Artificial neural network study are interwoven with issues in Field, Correctness, Distributed computing and Leverage. Theoretical computer science and Programming language are inextricably linked to his Satisfiability modulo theories research.

In his study, Mathematical proof and Program synthesis is strongly linked to Algebraic number, which falls under the umbrella field of Theoretical computer science. His Artificial intelligence study combines topics from a wide range of disciplines, such as Machine learning, State and Reliability. His Formal verification study combines topics in areas such as Gas meter prover, Blockchain, Formal specification and Code.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Satisfiability Modulo Theories

Clark W. Barrett;Cesare Tinelli.
Handbook of Satisfiability (2018)

1151 Citations

The SMT-LIB Standard Version 2.0

Clark Barrett;Aaron Stump;Cesare Tinelli.
(2010)

1055 Citations

Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks

Guy Katz;Clark W. Barrett;David L. Dill;Kyle Julian.
computer aided verification (2017)

841 Citations

CVC Lite: A new implementation of the cooperating validity checker: Category B

Clark W. Barrett;Sergey Berezin.
computer aided verification (2004)

408 Citations

CVC: A Cooperating Validity Checker

Aaron Stump;Clark W. Barrett;David L. Dill.
computer aided verification (2002)

280 Citations

Validity Checking for Combinations of Theories with Equality

Clark W. Barrett;David L. Dill;Jeremy R. Levitt.
formal methods in computer aided design (1996)

273 Citations

Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

Clark W. Barrett;David L. Dill;Aaron Stump.
computer aided verification (2002)

217 Citations

A decision procedure for an extensional theory of arrays

A. Stump;C.W. Barrett;D.L. Dill;J. Levitt.
logic in computer science (2001)

201 Citations

A decision procedure for bit-vector arithmetic

Clark W. Barrett;David L. Dill;Jeremy R. Levitt.
design automation conference (1998)

176 Citations

A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions

Tianyi Liang;Andrew Reynolds;Cesare Tinelli;Clark Barrett.
computer aided verification (2014)

129 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Clark Barrett

Sanjit A. Seshia

Sanjit A. Seshia

University of California, Berkeley

Publications: 69

Alessandro Cimatti

Alessandro Cimatti

Fondazione Bruno Kessler

Publications: 57

Roberto Sebastiani

Roberto Sebastiani

University of Trento

Publications: 50

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 41

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 38

Cesare Tinelli

Cesare Tinelli

University of Iowa

Publications: 35

Silvio Ranise

Silvio Ranise

Fondazione Bruno Kessler

Publications: 30

Randal E. Bryant

Randal E. Bryant

Carnegie Mellon University

Publications: 28

Cho-Jui Hsieh

Cho-Jui Hsieh

University of California, Los Angeles

Publications: 26

Shuvendu K. Lahiri

Shuvendu K. Lahiri

Microsoft (United States)

Publications: 25

Huan Zhang

Huan Zhang

University of California, Los Angeles

Publications: 24

Armin Biere

Armin Biere

Johannes Kepler University of Linz

Publications: 23

Nikolaj Bjørner

Nikolaj Bjørner

Microsoft (United States)

Publications: 23

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 23

Martin Vechev

Martin Vechev

ETH Zurich

Publications: 22

Martin Rinard

Martin Rinard

MIT

Publications: 22

Something went wrong. Please try again later.