1414 search results - page 196 / 283 » Combining Intruder Theories |
158
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...
158
click to vote
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
187
click to vote
ECBS
2010
IEEE
15 years 10 months ago
2010
IEEE
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pr...
174
click to vote
KBSE
1999
IEEE
15 years 10 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
146
click to vote
ICNP
1998
IEEE
15 years 10 months ago
1998
IEEE
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...