5 citations · 12 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
A Transient Semantics for Typed Racket
Ben Greenman, Lukas Lazarek, Christos Dimoulas +1
Mixed-typed languages enable programmers to link typed and untyped components in various ways. Some offer rich type systems to facilitate the smooth migration of untyped code to th…
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…
Fine-Grained, Language-Based Access Control for Database-Backed Applications
Ezra Zigmond, Stephen Chong, Christos Dimoulas +1
Context: Database-backed applications often run queries with more authority than necessary. Since programs can access more data than they legitimately need, flaws in security check…
FunTAL: Reasonably Mixing a Functional Language with Assembly
Daniel Patterson, Jamie Perconti, Christos Dimoulas +1
We present FunTAL, the first multi-language system to formalize safe interoperability between a high-level functional language and low-level assembly code while supporting composit…