scispace - formally typeset
N

Nikolaj Bjørner

Researcher at Microsoft

Publications -  195
Citations -  14015

Nikolaj Bjørner is an academic researcher from Microsoft. The author has contributed to research in topics: Satisfiability modulo theories & Solver. The author has an hindex of 42, co-authored 187 publications receiving 12375 citations. Previous affiliations of Nikolaj Bjørner include University of Kent & Stanford University.

Papers
More filters
Patent

Subdivision control of authority of duplicated information by fencing and fencing release

TL;DR: In this paper, the authors propose a method and a system for controlling which content should be prioritized and duplicated in a duplicated article set, where each resource is related to resource data and resource metadata.
Patent

Apparatus, method, and manufacture for cloud network updating

TL;DR: In this paper, a set of inequalities based network topology information, shared risk link group information, demand information, and traffic solver parameters are generated for updating a cloud network.
Proceedings ArticleDOI

SMT Solvers for Testing, Program Analysis and Verification at Microsoft

TL;DR: The system Z3, developed at Microsoft Research, is a Satisfiability Modulo Theories (SMT) solver that provides logic inference capabilities that are critical for the functionality of these systems.
Patent

Matching Based Pattern Inference for SMT Solvers

TL;DR: In this paper, a method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms is proposed, which involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers.
Journal Article

Absolute explicit unification

TL;DR: The system allows to solve type checking, type inhabitation, higher-order unification, and type inference for PTS using purely first-order machinery and a novel feature of the system is that it combines substitutions and variable declarations.