Nikolaj Bjorner
Scholar

Nikolaj Bjorner

Google Scholar ID: kja6dIzH9GwJ
Microsoft Research
Automated DeductionSystemsSoftware Engineering
Citations & Impact
All-time
Citations
10,902
 
H-index
38
 
i10-index
89
 
Publications
20
 
Co-authors
0
 
Resume (English only)
Academic Achievements
  • Papers:
  • - Absolute Explicit Unification (RTA 2000)
  • - Railway control design by combining Specware and Mathematica (To appear in The Sandia conference on High Integrity Software, November 14-17, 1999, New Mexico)
  • - Type checking meta programs (Appeared in the workshop on Logical Frameworks and Meta-languages, 28 September 1999, Paris, France)
  • - Integrating Decision Procedures for Temporal Verification (Slightly revised version of my Thesis, November 1998)
  • - Reactive Verification with Queues (In proceedings of Engineering Automation for Computer Based Systems, Carmel October, 1998)
  • - An Update on STeP: Deductive-Algorithmic Verification of Reactive Systems (In TOOLS'98, LNCS)
  • - Deciding Fixed and Nonfixed-size Bit-vectors (A shorter version of this paper is to be presented at TACAS 98)
  • - Deductive verification of parameterized fault-tolerant systems: A case study (Presented at ICTL 97)
  • - A practical integration of first-order reasoning and decision procedures (Presented at CADE 97)
  • - Deductive Verification of Real-time Systems Using STeP (Presented at ARTS 97)
  • - Automatic Generation of Invariants and Intermediate Assertions (This appeared in the February 97 issue of Theoretical Computer Science dedicated to CP'95)
  • - STeP: Deductive-Algorithmic Verification of Reactive and Real-time Systems (In 8th International Conference on Computer-Aided Verification, LNCS vol. 1102, pp. 415-418, Springer-Verlag, 1996)
  • - STeP: The Stanford Temporal Prover Educational Release, User's Manual
  • - STeP: The Stanford Temporal Prover (2-page abstract) (In TAPSOFT'95: Theory and Practice of Software Development, Lecture Notes in Computer Science 915, May 1995, pp. 793-794)
  • - Minimal Typing Derivations (Workshop on ML and its applications. Orlando 94)
  • - An overview of Synthesis (Presented at a DIMACS 96 workshop March 25-28 1996)
Research Experience
  • Papers:
  • - Absolute Explicit Unification (RTA 2000)
  • - Railway control design by combining Specware and Mathematica (To appear in The Sandia conference on High Integrity Software, November 14-17, 1999, New Mexico)
  • - Type checking meta programs (Appeared in the workshop on Logical Frameworks and Meta-languages, 28 September 1999, Paris, France)
  • - Integrating Decision Procedures for Temporal Verification (Slightly revised version of my Thesis, November 1998)
  • - Reactive Verification with Queues (In proceedings of Engineering Automation for Computer Based Systems, Carmel October, 1998)
  • - An Update on STeP: Deductive-Algorithmic Verification of Reactive Systems (In TOOLS'98, LNCS)
  • - Deciding Fixed and Nonfixed-size Bit-vectors (A shorter version of this paper is to be presented at TACAS 98)
  • - Deductive verification of parameterized fault-tolerant systems: A case study (Presented at ICTL 97)
  • - A practical integration of first-order reasoning and decision procedures (Presented at CADE 97)
  • - Deductive Verification of Real-time Systems Using STeP (Presented at ARTS 97)
  • - Automatic Generation of Invariants and Intermediate Assertions (This appeared in the February 97 issue of Theoretical Computer Science dedicated to CP'95)
  • - STeP: Deductive-Algorithmic Verification of Reactive and Real-time Systems (In 8th International Conference on Computer-Aided Verification, LNCS vol. 1102, pp. 415-418, Springer-Verlag, 1996)
  • - STeP: The Stanford Temporal Prover Educational Release, User's Manual
  • - STeP: The Stanford Temporal Prover (2-page abstract) (In TAPSOFT'95: Theory and Practice of Software Development, Lecture Notes in Computer Science 915, May 1995, pp. 793-794)
  • - Minimal Typing Derivations (Workshop on ML and its applications. Orlando 94)
  • - An overview of Synthesis (Presented at a DIMACS 96 workshop March 25-28 1996)
Education
  • Degree: Ph.D. in Computer Science
  • University: Stanford University
  • Email: nikolaj@cs.stanford.edu
Background
  • Research Interests:
  • - Integration of Decision Procedures in Temporal Verification
  • - Temporal logics for synthesis and verification of reactive, concurrent, real-time, and hybrid systems
  • - Type inference of polymorphic typed languages
Co-authors
0 total
Co-authors: 0 (list not available)