Sciweavers

183 search results - page 5 / 37
» Exploiting Symmetries to Test Programs
Sort
View
ISSTA
2010
ACM
13 years 8 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
OL
2011
177views Neural Networks» more  OL 2011»
12 years 9 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
ICSE
2009
IEEE-ACM
14 years 1 months ago
Exploiting the synergy between automated-test-generation and programming-by-contract
This demonstration presents two tools, Code Contracts and Pex, that utilize specification constructs for advanced testing, runtime checking, and static checking of object-oriente...
Michael Barnett, Manuel Fähndrich, Peli de Ha...
SP
2008
IEEE
14 years 1 months ago
Preventing Memory Error Exploits with WIT
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
Periklis Akritidis, Cristian Cadar, Costin Raiciu,...
AAAI
2010
13 years 8 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting