Paul He

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 13

Top Topics

Top Venues

Proc. ACM Program. Lang.

Dagstuhl Artifacts Ser.

Publications

Nicolas Chappe, Paul He, Ludovic Henrio, Yannick Zakowski, Steve Zdancewic
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq. Proc. ACM Program. Lang. 7 (POPL) (2023)
Lucas Silver, Paul He, Ethan Cecchetti, Andrew K. Hirsch, Steve Zdancewic
Semantics for Noninterference with Interaction Trees. ECOOP (2023)
Lucas Silver, Paul He, Ethan Cecchetti, Andrew K. Hirsch, Steve Zdancewic
Semantics for Noninterference with Interaction Trees (Artifact). Dagstuhl Artifacts Ser. 9 (2) (2023)
Nicolas Chappe, Paul He, Ludovic Henrio, Yannick Zakowski, Steve Zdancewic
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq. CoRR (2022)
Paul He, Eddy Westbrook, Brent Carmer, Chris Phifer, Valentin Robert, Karl Smeltzer, Andrei Stefanescu, Aaron Tomb, Adam Wick, Matthew Yacavone, Steve Zdancewic
A type system for extracting functional specifications from memory-safe imperative programs. Proc. ACM Program. Lang. 5 (OOPSLA) (2021)
Li-yao Xia, Yannick Zakowski, Paul He, Chung-Kil Hur, Gregory Malecha, Benjamin C. Pierce, Steve Zdancewic
Interaction trees: representing recursive and impure programs in Coq. Proc. ACM Program. Lang. 4 (POPL) (2020)
Yannick Zakowski, Paul He, Chung-Kil Hur, Steve Zdancewic
An equational theory for weak bisimulation via generalized parameterized coinduction. CPP (2020)
Yannick Zakowski, Paul He, Chung-Kil Hur, Steve Zdancewic
An Equational Theory for Weak Bisimulation via Generalized Parameterized Coinduction. CoRR (2020)
Li-yao Xia, Yannick Zakowski, Paul He, Chung-Kil Hur, Gregory Malecha, Benjamin C. Pierce, Steve Zdancewic
Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress). CoRR (2019)
Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability. CoRR (2018)
Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka
The Satisfiability of Word Equations: Decidable and Undecidable Theories. RP (2018)
Marianna Rapoport, Ifaz Kabir, Paul He, Ondrej Lhoták
A Simple Soundness Proof for Dependent Object Types. CoRR (2017)
Marianna Rapoport, Ifaz Kabir, Paul He, Ondrej Lhoták
A simple soundness proof for dependent object types. Proc. ACM Program. Lang. 1 (OOPSLA) (2017)