166 search results - page 2 / 34 » Type-Dependence Analysis and Program Transformation for Symb... |
DAC
2004
ACM
14 years 6 months ago
2004
ACM
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
ECRTS
2002
IEEE
13 years 10 months ago
2002
IEEE
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...
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
ESORICS
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. Trigger-based code (malicious in many cases, but not necessarily) only executes when specific inputs are received. Symbolic execution has been one of the most powerful t...
PLDI
2009
ACM
14 years 17 days ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...