BibTeX records: Paul He

download as .bib file

@article{DBLP:journals/darts/SilverHCHZ23,
  author       = {Lucas Silver and
                  Paul He and
                  Ethan Cecchetti and
                  Andrew K. Hirsch and
                  Steve Zdancewic},
  title        = {Semantics for Noninterference with Interaction Trees (Artifact)},
  journal      = {Dagstuhl Artifacts Ser.},
  volume       = {9},
  number       = {2},
  pages        = {06:1--06:2},
  year         = {2023},
  url          = {https://doi.org/10.4230/DARTS.9.2.6},
  doi          = {10.4230/DARTS.9.2.6},
  timestamp    = {Tue, 11 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/darts/SilverHCHZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pacmpl/ChappeHHZZ23,
  author       = {Nicolas Chappe and
                  Paul He and
                  Ludovic Henrio and
                  Yannick Zakowski and
                  Steve Zdancewic},
  title        = {Choice Trees: Representing Nondeterministic, Recursive, and Impure
                  Programs in Coq},
  journal      = {Proc. {ACM} Program. Lang.},
  volume       = {7},
  number       = {{POPL}},
  pages        = {1770--1800},
  year         = {2023},
  url          = {https://doi.org/10.1145/3571254},
  doi          = {10.1145/3571254},
  timestamp    = {Fri, 10 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/pacmpl/ChappeHHZZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ecoop/SilverHCHZ23,
  author       = {Lucas Silver and
                  Paul He and
                  Ethan Cecchetti and
                  Andrew K. Hirsch and
                  Steve Zdancewic},
  editor       = {Karim Ali and
                  Guido Salvaneschi},
  title        = {Semantics for Noninterference with Interaction Trees},
  booktitle    = {37th European Conference on Object-Oriented Programming, {ECOOP} 2023,
                  July 17-21, 2023, Seattle, Washington, United States},
  series       = {LIPIcs},
  volume       = {263},
  pages        = {29:1--29:29},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ECOOP.2023.29},
  doi          = {10.4230/LIPICS.ECOOP.2023.29},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ecoop/SilverHCHZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2211-06863,
  author       = {Nicolas Chappe and
                  Paul He and
                  Ludovic Henrio and
                  Yannick Zakowski and
                  Steve Zdancewic},
  title        = {Choice Trees: Representing Nondeterministic, Recursive, and Impure
                  Programs in Coq},
  journal      = {CoRR},
  volume       = {abs/2211.06863},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2211.06863},
  doi          = {10.48550/ARXIV.2211.06863},
  eprinttype    = {arXiv},
  eprint       = {2211.06863},
  timestamp    = {Tue, 15 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2211-06863.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pacmpl/HeWCPRSSTWYZ21,
  author       = {Paul He and
                  Eddy Westbrook and
                  Brent Carmer and
                  Chris Phifer and
                  Valentin Robert and
                  Karl Smeltzer and
                  Andrei Stefanescu and
                  Aaron Tomb and
                  Adam Wick and
                  Matthew Yacavone and
                  Steve Zdancewic},
  title        = {A type system for extracting functional specifications from memory-safe
                  imperative programs},
  journal      = {Proc. {ACM} Program. Lang.},
  volume       = {5},
  number       = {{OOPSLA}},
  pages        = {1--29},
  year         = {2021},
  url          = {https://doi.org/10.1145/3485512},
  doi          = {10.1145/3485512},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/pacmpl/HeWCPRSSTWYZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pacmpl/XiaZHHMPZ20,
  author       = {Li{-}yao Xia and
                  Yannick Zakowski and
                  Paul He and
                  Chung{-}Kil Hur and
                  Gregory Malecha and
                  Benjamin C. Pierce and
                  Steve Zdancewic},
  title        = {Interaction trees: representing recursive and impure programs in Coq},
  journal      = {Proc. {ACM} Program. Lang.},
  volume       = {4},
  number       = {{POPL}},
  pages        = {51:1--51:32},
  year         = {2020},
  url          = {https://doi.org/10.1145/3371119},
  doi          = {10.1145/3371119},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/pacmpl/XiaZHHMPZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cpp/ZakowskiHHZ20,
  author       = {Yannick Zakowski and
                  Paul He and
                  Chung{-}Kil Hur and
                  Steve Zdancewic},
  editor       = {Jasmin Blanchette and
                  Catalin Hritcu},
  title        = {An equational theory for weak bisimulation via generalized parameterized
                  coinduction},
  booktitle    = {Proceedings of the 9th {ACM} {SIGPLAN} International Conference on
                  Certified Programs and Proofs, {CPP} 2020, New Orleans, LA, USA, January
                  20-21, 2020},
  pages        = {71--84},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3372885.3373813},
  doi          = {10.1145/3372885.3373813},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cpp/ZakowskiHHZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2001-02659,
  author       = {Yannick Zakowski and
                  Paul He and
                  Chung{-}Kil Hur and
                  Steve Zdancewic},
  title        = {An Equational Theory for Weak Bisimulation via Generalized Parameterized
                  Coinduction},
  journal      = {CoRR},
  volume       = {abs/2001.02659},
  year         = {2020},
  url          = {http://arxiv.org/abs/2001.02659},
  eprinttype    = {arXiv},
  eprint       = {2001.02659},
  timestamp    = {Mon, 13 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-02659.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1906-00046,
  author       = {Li{-}yao Xia and
                  Yannick Zakowski and
                  Paul He and
                  Chung{-}Kil Hur and
                  Gregory Malecha and
                  Benjamin C. Pierce and
                  Steve Zdancewic},
  title        = {Interaction Trees: Representing Recursive and Impure Programs in Coq
                  (Work In Progress)},
  journal      = {CoRR},
  volume       = {abs/1906.00046},
  year         = {2019},
  url          = {http://arxiv.org/abs/1906.00046},
  eprinttype    = {arXiv},
  eprint       = {1906.00046},
  timestamp    = {Thu, 13 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1906-00046.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/rp/DayGHMN18,
  author       = {Joel D. Day and
                  Vijay Ganesh and
                  Paul He and
                  Florin Manea and
                  Dirk Nowotka},
  editor       = {Igor Potapov and
                  Pierre{-}Alain Reynier},
  title        = {The Satisfiability of Word Equations: Decidable and Undecidable Theories},
  booktitle    = {Reachability Problems - 12th International Conference, {RP} 2018,
                  Marseille, France, September 24-26, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11123},
  pages        = {15--29},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-00250-3\_2},
  doi          = {10.1007/978-3-030-00250-3\_2},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/rp/DayGHMN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1802-00523,
  author       = {Joel D. Day and
                  Vijay Ganesh and
                  Paul He and
                  Florin Manea and
                  Dirk Nowotka},
  title        = {The Satisfiability of Extended Word Equations: The Boundary Between
                  Decidability and Undecidability},
  journal      = {CoRR},
  volume       = {abs/1802.00523},
  year         = {2018},
  url          = {http://arxiv.org/abs/1802.00523},
  eprinttype    = {arXiv},
  eprint       = {1802.00523},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-00523.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pacmpl/RapoportKHL17,
  author       = {Marianna Rapoport and
                  Ifaz Kabir and
                  Paul He and
                  Ondrej Lhot{\'{a}}k},
  title        = {A simple soundness proof for dependent object types},
  journal      = {Proc. {ACM} Program. Lang.},
  volume       = {1},
  number       = {{OOPSLA}},
  pages        = {46:1--46:27},
  year         = {2017},
  url          = {https://doi.org/10.1145/3133870},
  doi          = {10.1145/3133870},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/pacmpl/RapoportKHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/RapoportKHL17,
  author       = {Marianna Rapoport and
                  Ifaz Kabir and
                  Paul He and
                  Ondrej Lhot{\'{a}}k},
  title        = {A Simple Soundness Proof for Dependent Object Types},
  journal      = {CoRR},
  volume       = {abs/1706.03814},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.03814},
  eprinttype    = {arXiv},
  eprint       = {1706.03814},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/RapoportKHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.