Sciweavers

183 search results - page 19 / 37
» Exploiting Symmetries to Test Programs
Sort
View
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 6 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
90
Voted
SP
2006
IEEE
132views Security Privacy» more  SP 2006»
15 years 5 months ago
Towards Automatic Generation of Vulnerability-Based Signatures
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
David Brumley, James Newsome, Dawn Xiaodong Song, ...
PLDI
2010
ACM
15 years 4 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
CF
2005
ACM
15 years 1 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
ACSAC
2005
IEEE
15 years 5 months ago
e-NeXSh: Achieving an Effectively Non-Executable Stack and Heap via System-Call Policing
We present e-NeXSh, a novel security approach that utilises kernel and LIBC support for efficiently defending systems against process-subversion attacks. Such attacks exploit vul...
Gaurav S. Kc, Angelos D. Keromytis