default search action
Li-yao Xia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Li-yao Xia, Laura Israel, Maite Kramarz, Nicholas Coltharp, Koen Claessen, Stephanie Weirich, Yao Li:
Story of Your Lazy Function's Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs. Proc. ACM Program. Lang. 8(ICFP): 30-63 (2024) - [i7]Li-yao Xia, Laura Israel, Maite Kramarz, Nicholas Coltharp, Koen Claessen, Stephanie Weirich, Yao Li:
Story of Your Lazy Function's Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs. CoRR abs/2406.14787 (2024) - 2022
- [j3]Mohsen Lesani, Li-yao Xia
, Anders Kaseorg, Christian J. Bell, Adam Chlipala
C4: verified transactional objects. Proc. ACM Program. Lang. 6(OOPSLA1): 1-31 (2022) - 2021
- [j2]Yao Li
Reasoning about the garden of forking paths. Proc. ACM Program. Lang. 5(ICFP): 1-28 (2021) - [c4]Hengchu Zhang, Wolf Honoré
Verifying an HTTP Key-Value Server with Interaction Trees and VST. ITP 2021: 32:1-32:19 - [i6]Yao Li, Li-yao Xia, Stephanie Weirich:
Reasoning about the garden of forking paths. CoRR abs/2103.07543 (2021) - 2020
- [j1]Li-yao Xia
Interaction trees: representing recursive and impure programs in Coq. Proc. ACM Program. Lang. 4(POPL): 51:1-51:32 (2020)
2010 – 2019
- 2019
- [c3]Nicolas Koh, Yao Li
From C to interaction trees: specifying, verifying, and testing a networked server. CPP 2019: 234-248 - [c2]Li-yao Xia, Dominic Orchard
Composing Bidirectional Programs Monadically. ESOP 2019: 147-175 - [i5]Li-yao Xia, Dominic Orchard, Meng Wang:
Composing bidirectional programs monadically (with appendices). CoRR abs/1902.06950 (2019) - [i4]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 abs/1906.00046 (2019) - 2018
- [i3]Nicolas Koh, Yao Li, Yishuai Li, Li-yao Xia, Lennart Beringer, Wolf Honoré, William Mansky, Benjamin C. Pierce, Steve Zdancewic:
From C to Interaction Trees: Specifying, Verifying, and Testing a Networked Server. CoRR abs/1811.11911 (2018) - 2017
- [c1]Leonidas Lampropoulos
Beginner's luck: a language for property-based generators. POPL 2017: 114-129 - 2016
- [i2]Leonidas Lampropoulos, Diane Gallois-Wong, Catalin Hritcu, John Hughes, Benjamin C. Pierce, Li-yao Xia:
Beginner's Luck: A Language for Property-Based Generators. CoRR abs/1607.05443 (2016) - 2014
- [p1]Eric Brier, David Naccache, Li-yao Xia:
How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling. Open Problems in Mathematics and Computational Science 2014: 317-340 - 2013
- [i1]Eric Brier, David Naccache, Li-yao Xia:
How to Sign Paper Contracts? Conjectures & Evidence Related to Equitable & Efficient Collaborative Task Scheduling. IACR Cryptol. ePrint Arch. 2013: 432 (2013)
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 2024-11-22 19:47 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: