Sciweavers

308 search results - page 9 / 62
» Symbolic execution of data paths
Sort
View
MEMOCODE
2003
IEEE
14 years 1 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider
SP
2006
IEEE
104views Security Privacy» more  SP 2006»
14 years 2 months ago
A Logic for Constraint-based Security Protocol Analysis
We propose PS-LTL, a pure-past security linear temporal logic that allows the specification of a variety of authentication, secrecy and data freshness properties. Furthermore, we...
Ricardo Corin, Sandro Etalle, Ari Saptawijaya
TAP
2008
Springer
93views Hardware» more  TAP 2008»
13 years 8 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
CCS
2006
ACM
14 years 9 days 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, ...
SOSP
2007
ACM
14 years 5 months ago
Bouncer: securing software by blocking bad input
Attackers exploit software vulnerabilities to control or crash programs. Bouncer uses existing software instrumentation techniques to detect attacks and it generates filters auto...
Manuel Costa, Miguel Castro, Lidong Zhou, Lintao Z...