Sciweavers

308 search results - page 1 / 62
» Symbolic execution of data paths
Sort
View
GLVLSI
1995
IEEE
104views VLSI» more  GLVLSI 1995»
13 years 8 months ago
Symbolic execution of data paths
Chuck Monahan, Forrest Brewer
ISSTA
2010
ACM
13 years 7 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
ISSTA
2009
ACM
13 years 11 months ago
Loop-extended symbolic execution on binary programs
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
Prateek Saxena, Pongsin Poosankam, Stephen McCaman...
ECRTS
2002
IEEE
13 years 10 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
PASTE
2005
ACM
13 years 10 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen