My name is Nick Feng. I am a Ph.D. student in computer science at the University of Toronto advised by Marsha Chechik.

I received both M.Sc. and B.Sc. in computer science from the University of Toronto, where I was advised by Marsha Chechik

Here is my CV. You can reach me at fengnick@cs.toronto.edu.

News

08/2020
Our second paper on client-specific equivalence checking was accepted at ASE '20!
07/2020
Our SAT Solvers (joint work with Randy Hickey and Fahiem Bacchus) Cadical-alluip-trail and Cadical-alluip won the planning track of SAT Competition 2020
See news from 07/2020 to 08/2020

Conference Research Papers

ASE '24
Diagnosis via Proofs of Unsatisfiability for First-Order Logic with Relational Objects (To appear)
N. Feng, L. Marsso, and M. Chechik
RE '24
Normative Requirements Operationalization with Large Language Models paper
N. Feng, L. Marsso, S. Yaman, I. Standen, Y. Baatartogtokh, R. Ayad, V. Mello, B. Townsend, H. Bartels, A. Cavalcanti, R. Calinescu, and M. Chechik
ICSE '24, Distinguished paper award
Analyzing and Debugging Normative Requirements via Satisfiability Checking (slides, extended version, tool)
N. Feng, L. Marsso, S. Yaman, B. Townsend, Y. Baatartogtokh, R. Ayad, V. Mello, Y. Kholodetska, I. Standen, I. Stefanakos, C. Imrie, G. Rodrigues, A. Cavalcanti, R. Calinescu, and M. Chechik
TACAS '24
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories (slides, extended version)
N. Feng, A. Hu, S. Bayless, S. Iqbal, P. Trentin, M. Whalen, L. Pike, and J. Backes
CAV '23
Early Verification of Legal Compliance via Bounded Satisfiability Checking (slides, extended version, tool)
N. Feng, L. Marsso, M. Sabetzadeh, and M. Chechik
ASE '23 (NIER track)
Towards a Formal Framework for Normative Requirements Elicitation (slides, paper, tool)
N. Feng, L. Marsso, S. Yaman, B. Townsend, A. Cavalcanti, R. Calinescu, and M. Chechik
SPLC '23
Code-Level Functional Equivalence Checking of Annotative Software Product Lines (slides, paper, tool)
Shuolin(Alan) Wang, N. Feng, and M. Chechik
ATVA '21
Verification by Gambling on Program Slices (paper)
M. Akhundov F. Mora, N. Feng, V. Hui, and M. Chechik
ASE '20
Scaling Client-Specific Equivalence Checking via Impact Boundary Search (slides, paper, tool)
N. Feng, F. Mora, V. Hui, and M. Chechik
SAT '20
Clause Size Reduction with all-UIP Learning (slides, paper, tool)
N. Feng, F. Bacchus