Sciweavers

309 search results - page 49 / 62
» Termination proofs for systems code
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 5 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
CCS
2006
ACM
13 years 11 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
SIGPLAN
1998
13 years 7 months ago
Unloading Java Classes That Contain Static Fields
In Java the de nition of a \program" is a bit fuzzy. A Java applet is essentially a Java application (i.e. program) that can be executed by a Java enabled Web browser (i.e. a...
Charles E. McDowell, Elizabeth A. Baldwin
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
POPL
2008
ACM
14 years 8 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...