D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 40 Citations 15,335 132 World Ranking 4542 National Ranking 2265

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Computer network

Nikolaj Bjørner spends much of his time researching Theoretical computer science, Satisfiability modulo theories, Programming language, Algorithm and Model checking. His Theoretical computer science research incorporates elements of Program analysis, Solver and Modulo. He interconnects Scalability, Decision problem, Mathematical optimization and Symbolic execution in the investigation of issues within Satisfiability modulo theories.

His Decision problem research integrates issues from Concolic testing, Predicate abstraction, Maximum satisfiability problem, Conjunctive normal form and Boolean satisfiability problem. His Programming language study frequently draws parallels with other fields, such as Header. Nikolaj Bjørner works mostly in the field of Algorithm, limiting it down to topics relating to Path and, in certain cases, Matching.

His most cited work include:

  • Z3: an efficient SMT solver (4046 citations)
  • Satisfiability modulo theories: introduction and applications (371 citations)
  • Generalized property directed reachability (215 citations)

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

His primary scientific interests are in Theoretical computer science, Satisfiability modulo theories, Programming language, Algorithm and Solver. As part of his studies on Theoretical computer science, Nikolaj Bjørner often connects relevant areas like Modulo. His Satisfiability modulo theories research incorporates themes from Program analysis, Scalability, Loop invariant and Algebra.

The study incorporates disciplines such as Context and Mathematical proof in addition to Programming language. His work deals with themes such as Path and Quantifier elimination, which intersect with Algorithm. His Model checking research includes themes of Runtime verification, Formal verification, Functional verification and High-level verification.

He most often published in these fields:

  • Theoretical computer science (36.65%)
  • Satisfiability modulo theories (22.51%)
  • Programming language (22.51%)

What were the highlights of his more recent work (between 2015-2020)?

  • Algorithm (22.51%)
  • Theoretical computer science (36.65%)
  • Satisfiability (11.52%)

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

Nikolaj Bjørner mainly investigates Algorithm, Theoretical computer science, Satisfiability, Unsatisfiable core and Automated theorem proving. His study focuses on the intersection of Algorithm and fields such as Process with connections in the field of Image and Embedding. He has researched Theoretical computer science in several fields, including Construct and Logic gate.

His studies deal with areas such as Monadic predicate calculus, Decidability, Linear arithmetic, Decomposition and Boolean combination as well as Satisfiability. His Automated theorem proving research is multidisciplinary, incorporating elements of First-order logic, Pure mathematics, Satisfiability modulo theories, Undecidable problem and Software engineering. His work carried out in the field of Satisfiability modulo theories brings together such families of science as Use case, Horn clause and Calculus.

Between 2015 and 2020, his most popular works were:

  • Automatically verifying reachability and well-formedness in P4 Networks (69 citations)
  • Scaling network verification using symmetry and surgery (42 citations)
  • Guiding High-Performance SAT Solvers with Unsat-Core Predictions (21 citations)

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

  • Programming language
  • Algorithm
  • Computer network

Nikolaj Bjørner mostly deals with Theoretical computer science, Algorithm, Reachability, Software and Top-down and bottom-up design. His studies in Theoretical computer science integrate themes in fields like Logic gate and Cryptography. His research in Algorithm intersects with topics in Timeout, Scheduling and Neural network architecture.

The Reachability study combines topics in areas such as Computer network, Network packet, Datalog, Software bug and OpenFlow. His Software research is multidisciplinary, relying on both Test suite, Reliability engineering and Test script.

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

Z3: an efficient SMT solver

Leonardo De Moura;Nikolaj Bjørner.
tools and algorithms for construction and analysis of systems (2008)

7404 Citations

Satisfiability modulo theories: introduction and applications

Leonardo De Moura;Nikolaj Bjørner.
Communications of The ACM (2011)

671 Citations

Universal naming scheme for peer-to-peer resources

Dan Teodosiu;Nikolaj S. Bjorner;Markus M. Breunig.
(2005)

283 Citations

STeP: The Stanford Temporal Prover

Zohar Manna;Nikolaj Bjørner;Anca Browne;Edward Y. Chang.
colloquium on trees in algebra and programming (1995)

282 Citations

Efficient E-Matching for SMT Solvers

Leonardo Moura;Nikolaj Bjørner.
conference on automated deduction (2007)

277 Citations

Generalized property directed reachability

Kryštof Hoder;Nikolaj Bjørner.
theory and applications of satisfiability testing (2012)

260 Citations

Satisfiability Modulo Theories: An Appetizer

Leonardo Moura;Nikolaj Bjørner.
formal methods (2009)

252 Citations

vZ - An Optimizing SMT Solver

Nikolaj BjØrner;Anh-Dung Phan;Lars Fleckenstein.
tools and algorithms for construction and analysis of systems (2015)

223 Citations

VeriCon: towards verifying controller programs in software-defined networks

Thomas Ball;Nikolaj Bjørner;Aaron Gember;Shachar Itzhaky.
programming language design and implementation (2014)

217 Citations

Path Feasibility Analysis for String-Manipulating Programs

Nikolaj Bjørner;Nikolai Tillmann;Andrei Voronkov.
tools and algorithms for construction and analysis of systems (2009)

213 Citations

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

Contact us

Best Scientists Citing Nikolaj Bjørner

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 62

Clark Barrett

Clark Barrett

Stanford University

Publications: 61

Cesare Tinelli

Cesare Tinelli

University of Iowa

Publications: 44

Amir Pnueli

Amir Pnueli

Weizmann Institute of Science

Publications: 39

Silvio Ranise

Silvio Ranise

Fondazione Bruno Kessler

Publications: 38

Rolf Drechsler

Rolf Drechsler

University of Bremen

Publications: 37

Robert Wille

Robert Wille

Johannes Kepler University of Linz

Publications: 35

Sriram Sankaranarayanan

Sriram Sankaranarayanan

University of Colorado Boulder

Publications: 35

Shaz Qadeer

Shaz Qadeer

Facebook (United States)

Publications: 32

K. Rustan M. Leino

K. Rustan M. Leino

Amazon Web Services

Publications: 32

Aarti Gupta

Aarti Gupta

Princeton University

Publications: 30

Bradley E. Marshall

Bradley E. Marshall

Amazon (United States)

Publications: 29

Ehab Al-Shaer

Ehab Al-Shaer

Carnegie Mellon University

Publications: 29

Shuvendu K. Lahiri

Shuvendu K. Lahiri

Microsoft (United States)

Publications: 26

Swaminathan Sivasubramanian

Swaminathan Sivasubramanian

Amazon (United States)

Publications: 26

P. Madhusudan

P. Madhusudan

University of Illinois at Urbana-Champaign

Publications: 26

Something went wrong. Please try again later.