927 search results - page 132 / 186 » Practical Limits on Software Dependability: A Case Study |
ISF
2006
13 years 7 months ago
2006
Abstract Research in information security, risk management and investment has grown in importance over the last few years. However, without reliable estimates on attack probabiliti...
CPM
1998
Springer
13 years 12 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
COMPSAC
2007
IEEE
14 years 2 months ago
2007
IEEE
Building open distributed systems is an even more challenging task than building distributed systems, as their components are loosely synchronised, can move, become disconnected, ...
SEFM
2005
IEEE
14 years 1 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...