2687 search results - page 151 / 538 » Formal Analysis of PKCS |
148
Voted
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
190
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
163
Voted
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement “cold potato routing” between autonomous systems. However, the us...
156
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
253
Voted
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...