Sciweavers

2944 search results - page 191 / 589
» On Well Quasi-orders on Languages
Sort
View
SOUPS
2009
ACM
16 years 1 months ago
A user study of the expandable grid applied to P3P privacy policy visualization
Displaying website privacy policies to consumers in ways they understand is an important part of gaining consumers’ trust and informed consent, yet most website privacy policies...
Robert W. Reeder, Patrick Gage Kelley, Aleecia M. ...
ECOOP
2009
Springer
16 years 7 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
POPL
2001
ACM
16 years 6 months ago
Type-preserving garbage collectors
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
Daniel C. Wang, Andrew W. Appel
ICFP
2002
ACM
16 years 6 months ago
An experimental study of renewal-older-first garbage collection
Generational collection has improved the efficiency of garbage collection in fast-allocating programs by focusing on collecting young garbage, but has done little to reduce the co...
Lars Thomas Hansen, William D. Clinger
POPL
2009
ACM
16 years 1 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...