Sciweavers

36 search results - page 4 / 8
» pldi 2010
Sort
View
PLDI
2010
ACM
14 years 6 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
PLDI
2010
ACM
14 years 1 months ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...
PLDI
2010
ACM
14 years 1 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
PLDI
2010
ACM
14 years 26 days ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
PLDI
2010
ACM
14 years 1 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn