default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuannan Wei 0001
Person information
- affiliation: Tufts University, Medford, MA, USA
- affiliation (former): INRIA/ENS-PSL, Paris, France
- affiliation (former): Purdue University, West Lafayette, IN, USA
Other persons with the same name
- Guannan Wei 0002 — Beijing University of Civil Engineering and Architecture, Beijing, China
- Guannan Wei 0003 — China University of Geosciences, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Yuyan Bao, Songlin Jia, Guannan Wei, Oliver Bracevac, Tiark Rompf:
Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory. Proc. ACM Program. Lang. 9(OOPSLA2): 1837-1864 (2025)- [c4]Guannan Wei, Alexander Y. Bai, Dinghong Zhong, Jiatai Zhang:
Reconstructing Continuation-Passing Semantics for WebAssembly. TFP 2025: 185-204 - 2024
- [j11]Mingwei Zheng
, Qingkai Shi, Xuwei Liu, Xiangzhe Xu, Le Yu, Congyu Liu, Guannan Wei, Xiangyu Zhang:
ParDiff: Practical Static Differential Analysis of Network Protocol Parsers. Proc. ACM Program. Lang. 8(OOPSLA1): 1208-1234 (2024) - [j10]Guannan Wei, Danning Xie, Wuqi Zhang, Yongwei Yuan, Zhuo Zhang:
Consolidating Smart Contracts with Behavioral Contracts. Proc. ACM Program. Lang. 8(PLDI): 965-989 (2024) - [j9]Guannan Wei, Oliver Bracevac, Songlin Jia, Yuyan Bao, Tiark Rompf:
Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs. Proc. ACM Program. Lang. 8(POPL): 393-424 (2024) - [i5]Songlin Jia, Guannan Wei, Siyuan He, Yueyang Tang, Yuyan Bao, Tiark Rompf:
Escape with Your Self: Expressive Reachability Types with Sound and Decidable Bidirectional Type Checking. CoRR abs/2404.08217 (2024) - 2023
- [j8]Oliver Bracevac, Guannan Wei, Songlin Jia, Supun Abeysinghe, Yuxuan Jiang, Yuyan Bao, Tiark Rompf:
Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies. Proc. ACM Program. Lang. 7(OOPSLA2): 400-430 (2023) - [c3]Guannan Wei, Songlin Jia, Ruiqi Gao, Haotian Deng, Shangyin Tan, Oliver Bracevac, Tiark Rompf:
Compiling Parallel Symbolic Execution with Continuations. ICSE 2023: 1316-1328 - [i4]Guannan Wei, Oliver Bracevac, Songlin Jia, Yuyan Bao, Tiark Rompf:
Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs. CoRR abs/2307.13844 (2023) - [i3]Yuyan Bao, Guannan Wei, Oliver Bracevac, Tiark Rompf:
Modeling Reachability Types with Logical Relations. CoRR abs/2309.05885 (2023) - [i2]Oliver Bracevac, Guannan Wei, Songlin Jia, Supun Abeysinghe, Yuxuan Jiang, Yuyan Bao, Tiark Rompf:
Graph IRs for Impure Higher-Order Languages (Technical Report). CoRR abs/2309.08118 (2023) - 2022
- [j7]Anxhelo Xhebraj, Oliver Bracevac, Guannan Wei, Tiark Rompf:
What If We Don't Pop the Stack? The Return of 2nd-Class Values (Artifact). Dagstuhl Artifacts Ser. 8(2): 26:1-26:2 (2022) - [c2]Anxhelo Xhebraj, Oliver Bracevac, Guannan Wei, Tiark Rompf:
What If We Don't Pop the Stack? The Return of 2nd-Class Values. ECOOP 2022: 15:1-15:29 - 2021
- [j6]Yuyan Bao, Guannan Wei, Oliver Bracevac, Yuxuan Jiang, Qiyang He, Tiark Rompf:
Reachability types: tracking aliasing and separation in higher-order functional programs. Proc. ACM Program. Lang. 5(OOPSLA): 1-32 (2021) - [c1]Guannan Wei, Shangyin Tan, Oliver Bracevac, Tiark Rompf:
LLSC: a parallel symbolic execution compiler for LLVM IR. ESEC/SIGSOFT FSE 2021: 1495-1499 - 2020
- [j5]Guannan Wei, Oliver Bracevac, Shangyin Tan, Tiark Rompf:
Compiling symbolic execution with staging and algebraic effects. Proc. ACM Program. Lang. 4(OOPSLA): 164:1-164:33 (2020)
2010 – 2019
- 2019
- [j4]Guannan Wei, Yuxuan Chen, Tiark Rompf:
Staged abstract interpreters: fast and modular whole-program analysis via meta-programming. Proc. ACM Program. Lang. 3(OOPSLA): 126:1-126:32 (2019) - [j3]Zhuo Zhang, Wei You, Guanhong Tao, Guannan Wei, Yonghwi Kwon, Xiangyu Zhang:
BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation. Proc. ACM Program. Lang. 3(OOPSLA): 137:1-137:31 (2019) - [j2]Grégory M. Essertel, Guannan Wei, Tiark Rompf:
Precise reasoning with structured time, structured heaps, and collective operations. Proc. ACM Program. Lang. 3(OOPSLA): 157:1-157:30 (2019) - [i1]Zhanfu Yang, Fei Wang, Ziliang Chen, Guannan Wei, Tiark Rompf:
Graph Neural Reasoning for 2-Quantified Boolean Formula Solvers. CoRR abs/1904.12084 (2019) - 2018
- [j1]Guannan Wei, James M. Decker, Tiark Rompf:
Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl). Proc. ACM Program. Lang. 2(ICFP): 105:1-105:28 (2018)
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 2026-02-08 23:12 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:
