Y
Yao Li
Researcher at University of Pennsylvania
Publications - 15
Citations - 134
Yao Li is an academic researcher from University of Pennsylvania. The author has contributed to research in topics: Haskell & Scala. The author has an hindex of 5, co-authored 14 publications receiving 77 citations. Previous affiliations of Yao Li include Shanghai Jiao Tong University.
Papers
More filters
Proceedings ArticleDOI
From C to interaction trees: specifying, verifying, and testing a networked server
Nicolas Koh,Yao Li,Yishuai Li,Li-yao Xia,Lennart Beringer,Wolf Honoré,William Mansky,Benjamin C. Pierce,Steve Zdancewic +8 more
TL;DR: In this article, the authors present the first formal verification of a networked server implemented in C. The main theorem connects a specification of acceptable server behaviors, written in a straightforward "one client at a time" style, with the CompCert semantics of the C program.
Journal ArticleDOI
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)
Joachim Breitner,Antal Spector-Zabusky,Yao Li,Christine Rizkallah,John Wiegley,Stephanie Weirich +5 more
TL;DR: In this article, the authors use hs-to-coq to translate Haskell containers library into Coq, and verify it against specifications derived from a variety of sources including type class laws, the library's test suite, and interfaces from Coq's standard library.
Proceedings ArticleDOI
AutoBench: Finding Workloads That You Need Using Pluggable Hybrid Analyses
Yudi Zheng,Andrea Rosà,Luca Salucci,Yao Li,Haiyang Sun,Omar Javed,Lubomír Bulej,Lydia Y. Chen,Zhengwei Qi,Walter Binder +9 more
TL;DR: Preliminary results presented here show that unit tests can provide a viable source of workloads, and that the combination of static and dynamic analyses improves the ability to identify relevant workloads that can serve as the basis for custom benchmark suites.
Proceedings ArticleDOI
Verifying an HTTP Key-Value Server with Interaction Trees and VST.
Hengchu Zhang,Wolf Honoré,Nicolas Koh,Yao Li,Yishuai Li,Li-yao Xia,Lennart Beringer,William Mansky,Benjamin C. Pierce,Steve Zdancewic +9 more
TL;DR: A networked key-value server, implemented in C and formally verified in Coq, that interacts with clients using a subset of the HTTP/1.1 protocol and is specified and verified using interaction trees and the Verified Software Toolchain.
Proceedings ArticleDOI
From C to Interaction Trees: Specifying, Verifying, and Testing a Networked Server
Nicolas Koh,Yao Li,Yishuai Li,Li-yao Xia,Lennart Beringer,Wolf Honoré,William Mansky,Benjamin C. Pierce,Steve Zdancewic +8 more
TL;DR: The main theorem connects a specification of acceptable server behaviors, written in a straightforward “one client at a time” style, with the CompCert semantics of the C program.