Guannan Wei

Orcid: 0000-0002-3150-2033

Affiliations:
  • Purdue University, West Lafayette, IN, USA


According to our database1, Guannan Wei authored at least 18 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs.
Proc. ACM Program. Lang., January, 2024

ParDiff: Practical Static Differential Analysis of Network Protocol Parsers.
Proc. ACM Program. Lang., 2024

Consolidating Smart Contracts with Behavioral Contracts.
Proc. ACM Program. Lang., 2024

Escape with Your Self: Expressive Reachability Types with Sound and Decidable Bidirectional Type Checking.
CoRR, 2024

2023
Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies.
Proc. ACM Program. Lang., October, 2023

Graph IRs for Impure Higher-Order Languages (Technical Report).
CoRR, 2023

Modeling Reachability Types with Logical Relations.
CoRR, 2023

Compiling Parallel Symbolic Execution with Continuations.
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering, 2023

2022
What If We Don't Pop the Stack? The Return of 2nd-Class Values (Artifact).
Dagstuhl Artifacts Ser., 2022

What If We Don't Pop the Stack? The Return of 2nd-Class Values.
Proceedings of the 36th European Conference on Object-Oriented Programming, 2022

2021
Reachability types: tracking aliasing and separation in higher-order functional programs.
Proc. ACM Program. Lang., 2021

LLSC: a parallel symbolic execution compiler for LLVM IR.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

2020
Compiling symbolic execution with staging and algebraic effects.
Proc. ACM Program. Lang., 2020

2019
BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation.
Proc. ACM Program. Lang., 2019

Staged abstract interpreters: fast and modular whole-program analysis via meta-programming.
Proc. ACM Program. Lang., 2019

Precise reasoning with structured time, structured heaps, and collective operations.
Proc. ACM Program. Lang., 2019

Graph Neural Reasoning for 2-Quantified Boolean Formula Solvers.
CoRR, 2019

2018
Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl).
Proc. ACM Program. Lang., 2018


  Loading...