Följ
Paul He
Paul He
Verifierad e-postadress på cis.upenn.edu - Startsida
Titel
Citeras av
Citeras av
År
Interaction trees: representing recursive and impure programs in Coq
L Xia, Y Zakowski, P He, CK Hur, G Malecha, BC Pierce, S Zdancewic
Proceedings of the 47th Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2020
96*2020
The Satisfiability of Word Equations: Decidable and Undecidable Theories
JD Day, V Ganesh, P He, F Manea, D Nowotka
International Conference on Reachability Problems, 15-29, 2018
33*2018
A simple soundness proof for dependent object types
M Rapoport, I Kabir, P He, O Lhoták
Proceedings of the ACM on Programming Languages 1 (OOPSLA), 46, 2017
232017
An equational theory for weak bisimulation via generalized parameterized coinduction
Y Zakowski, P He, CK Hur, S Zdancewic
Proceedings of the 9th ACM SIGPLAN International Conference on Certified …, 2020
15*2020
A type system for extracting functional specifications from memory-safe imperative programs
P He, E Westbrook, B Carmer, C Phifer, V Robert, K Smeltzer, ...
Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-29, 2021
22021
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
N Chappe, P He, L Henrio, Y Zakowski, S Zdancewic
arXiv preprint arXiv:2211.06863, 2022
2022
Choice Trees (draft)
N Chappe, P He, L Henrio, Y Zakowski, S Zdancewic
2022
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–7