3342 search results - page 21 / 669 » Symbolic Robustness Analysis |
IANDC
2008
14 years 9 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
MEMOCODE
2003
IEEE
15 years 2 months ago
2003
IEEE
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...
SAS
2007
Springer
15 years 3 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
88
Voted
DAC
2004
ACM
15 years 10 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...
ROBOTICA
2008
14 years 9 months ago
2008
Polyhedral scene analysis studies whether a 2D line drawing of a 3D polyhedron is realizable in the space, and if so, parameterizing the space of all possible realizations. For gen...