Showing cs.PLShow all
2 papers · 1 filter
cs.PL2024
A Calculus for Unreachable Code
Peter Zhong, Shu-Hung You, Simone Campanoni +3
In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same…
cs.PL2020
Dynamic Symbolic Execution of Higher-Order Functions
Shu-Hung You, Robert Bruce Findler, Christos Dimoulas
The effectiveness of concolic testing deteriorates as the size of programs increases. A promising way out is to test programs modularly, e.g., on a per function or class basis. Ala…