default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Feng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Nick Feng
, Lina Marsso, Sinem Getir Yaman, Yesugen Baatartogtokh, Reem Ayad, Victória Oldemburgo de Mello, Beverley A. Townsend, Isobel Standen, Ioannis Stefanakos, Calum Imrie, Genaína Nunes Rodrigues, Ana Cavalcanti, Radu Calinescu, Marsha Chechik:
Analyzing and Debugging Normative Requirements via Satisfiability Checking. ICSE 2024: 214:1-214:12- [c8]Nick Feng, Lina Marsso, Sinem Getir Yaman, Isobel Standen, Yesugen Baatartogtokh, Reem Ayad, Victória Oldemburgo de Mello, Beverley A. Townsend, Hanne Bartels, Ana Cavalcanti, Radu Calinescu, Marsha Chechik:
Normative Requirements Operationalization with Large Language Models. RE 2024: 129-141 - [c7]Nick Feng, Alan J. Hu, Sam Bayless, Syed M. Iqbal, Patrick Trentin, Mike Whalen, Lee Pike, John Backes:
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories. TACAS (1) 2024: 3-23 - [i5]Nick Feng, Lina Marsso, Sinem Getir Yaman, Yesugen Baatartogtokh, Reem Ayad, Victória Oldemburgo de Mello, Beverley A. Townsend, Isobel Standen, Ioannis Stefanakos, Calum Imrie, Genaína Nunes Rodrigues, Ana Cavalcanti, Radu Calinescu, Marsha Chechik:
Analyzing and Debugging Normative Requirements via Satisfiability Checking. CoRR abs/2401.05673 (2024) - [i4]Nick Feng, Alan J. Hu, Sam Bayless, Syed M. Iqbal, Patrick Trentin, Mike Whalen, Lee Pike, John Backes:
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories. CoRR abs/2401.10703 (2024) - [i3]Nick Feng, Lina Marsso, Sinem Getir Yaman, Isobel Standen, Yesugen Baatartogtokh, Reem Ayad, Victória Oldemburgo de Mello, Beverley A. Townsend, Hanne Bartels, Ana Cavalcanti, Radu Calinescu, Marsha Chechik:
Normative Requirements Operationalization with Large Language Models. CoRR abs/2404.12335 (2024) - [i2]Nick Feng, Lina Marsso, Marsha Chechik:
Diagnosis via Proofs of Unsatisfiability for First-Order Logic with Relational Objects. CoRR abs/2409.09223 (2024) - 2023
- [c6]Nick Feng, Lina Marsso, Mehrdad Sabetzadeh, Marsha Chechik:
Early Verification of Legal Compliance via Bounded Satisfiability Checking. CAV (3) 2023: 374-396 - [c5]Nick Feng, Lina Marsso, Sinem Getir Yaman, Beverley A. Townsend, Ana Cavalcanti, Radu Calinescu, Marsha Chechik:
Towards a Formal Framework for Normative Requirements Elicitation. ASE 2023: 1776-1780 - [c4]Alan Wang, Nick Feng, Marsha Chechik:
Code-Level Functional Equivalence Checking of Annotative Software Product Lines. SPLC (A) 2023: 64-75 - 2022
- [i1]Nick Feng, Lina Marsso, Mehrdad Sabetzadeh, Marsha Chechik:
Bounded Satisfiability Checking of Metric First-order Temporal Logic. CoRR abs/2209.04052 (2022) - 2021
- [c3]Murad Akhundov, Federico Mora, Nick Feng, Vincent Hui, Marsha Chechik:
Verification by Gambling on Program Slices. ATVA 2021: 266-282 - 2020
- [c2]Nick Feng, Federico Mora, Vincent Hui, Marsha Chechik:
Scaling Client-Specific Equivalence Checking via Impact Boundary Search. ASE 2020: 734-745 - [c1]Nick Feng, Fahiem Bacchus:
Clause Size Reduction with all-UIP Learning. SAT 2020: 28-45
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
