Kimberly Cornell

Assistant Professor


Ph.D.Computer ScienceUniversity at Albany
M.S.Computer ScienceUniversity at Albany
B.S.Computer ScienceUniversity at Plattsburgh

Professional Experience

2015-Present: Assistant Professor of Computer Science, The College of Saint Rose

  • CSC 111 Introduction to Computer Science (Fall 2015, Spring 2016)
  • CSC 112 Art and Science of Computer Graphics (Fall 2016)
  • CSC 252 Problem Solving with Java (Fall 2016, Spring 2017)
  • CSC 434 Software Engineering (Spring 2017)
  • CSC 462/562 Cybersecurity and Cryptography (Spring 2016, Spring 2017)
  • CSC 433/564 Programming Languages (Fall 2016)
  • CSC 507 Software Engineering (Fall 2015, Spring 2016)

Summer 2014: Office of Naval Research (ONR) Naval Research Enterprise Internship Program (NREIP), Student Intern

  • Topic: Symmetric and asymmetric uni cation for cryptographic protocol analysis
  • Supervisor: Dr. Catherine Meadows
  • Head Formal Methods Section, Center for High Assurance Computer Systems, Naval Research Laboratory

Summer 2013: Instructor of Record, University at Albany

  • CSI 210 Discrete Structures

2010-2013: Graduate Teaching Assistant, University at Albany

  • CSI 538 Computational Logic (Spring 2015)
  • CSI 519 Advanced Programming Concepts (Fall 2013 and Fall 2014)
  • CSI 409 Automata and Formal Languages Fall 2013 and Fall 2014)
  • CSI 426/526 Cryptography (Spring 2014)
  • CSI 418/518 Software Engineering (Spring 2012 and Spring 2013) Lab Instructor
  • CSI 210 Discrete Structures (Fall 2012) Discussion Leader
  • CSI 310 Data Structures (Summer 2012)
  • CSI 201 Introduction to Computer Science (Summer 2011 and Fall 2011) Lab Instructor
  • Tutoring Computer Science and Information Science courses (Fall 2010-Spring 2011)

2012-2013: Graduate Research Assistant, University at Albany

  • National Science Foundation Grant CNS 09-05286
  • Advisor: Dr. Narendran (Summer 2012, Summer 2013)

Teaching Interests

Cybersecurity, Cryptography, Programming Languages, Software Engineering, Problem Solving with Java, System Administration, Discrete Mathematics, Theory of Computation, Computational Logic, Data Structures, Algorithms, Introduction to Computer Science, and Fundamentals of Computer Science

Research/Creative Works

Refereed Publications:

    • Distinguishability in Protocol Analysis: Formally Analyzing Guessing Attacks (2017)
      Siva Anantharaman, Kimberly A. Gero, Paliath Narendran and Michael Rusinowitch
      Accepted for publication in The 12th Annual Symposium on Information Assurance (ASIA ’17)
    • Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, and Ananya Subburathinam. Notes on Lynch-Morawska Systems. In Silvio Ghilardi and Manfred Schmidt-Schauß, editors, Proceedings of the 30th International Workshop on Unification (UNIF 2016), 2016.
    • Kimberly A. Gero.”>Deciding Static Inclusion for DELTA-strong and OMEGA DEL-strong Intruder Theories: Applications to Cryptographic Protocol Analysis. PhD thesis, State University of New York at Albany, 2015.
    • Serdar Erbatur, Kimberly A. Gero, Andrew M. Marshall, Catherine Meadows, and Paliath Narendran. Unification modulo a Theory of Pairing and Encryption. In Santiago Escobar and Mateu Villaret,
      editors, UNIF 2015, 29th International Workshop on Unification, 2016.
    • Chris Bouchard, Kimberly A. Gero, and Paliath Narendran. Some Notes on Basic Syntactic Mutation. In Santiago Escobar, Konstantin Korovin, and Vladimir Rybakov, editors, UNIF 2012 Post-Worskhop
      Proceedings. The 26th International Workshop on Unification, volume 24 of EPiC Series in Computing, pages 17–27. EasyChair, 2014.
    • Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, and Paliath Narendran. On Forward Closure and the Finite Variant Property. In Pascal Fontaine, Christophe Ringeissen, and Renate A. Schmidt, editors, Frontiers of Combining Systems – 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings, volume 8152 of Lecture Notes in Computer Science, pages 327–342. Springer, 2013.

Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly A. Gero, and Paliath Narendran. Unification Problems Modulo a Theory of Until. In Konstantin Korovin and Barbara Morawska, editors, 27th International Workshop on Unification, UNIF 2013, Eindhoven, Netherlands, June 26, 2013, volume 19 of EPiC Series in Computing, pages 22–29. EasyChair, 2013.

  • Michael Ferguson, Kimberly A. Gero, Joao Salles, and James Weis. Playing chess with a human-scale mobile manipulator. In Wolfram Burgard and Dan Roth, editors, Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011. AAAI Press, 2011.


Other Publications:

  • Random Recursion (2009)
    Kimberly A. Gero and Chao Shen (Consortium for Computing Sciences in Colleges Midwest Region)
    Submitted as an extended abstract and presented as a poster.

Technical Reports:

  • Notes on Lynch-Morawska Systems
    Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero,Paliath Narendran, Ananya Subburathinam
    April 2016, SUNYA-CS-16-01.
  • On Forward Closure and the Finite Variant Property
    Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran July 2013, SUNYA-CS-13-03.
  • Uni fication Problems Modulo a Theory of “Until”
    Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly A. Gero, Paliath Narendran April 2013, SUNYA-CS-13-02.
  • Notes on Basic Syntactic Mutation
    Christopher Bouchard, Kimberly A. Gero, and Paliath Narendran, April 2012, SUNYA-CS-12-03.