1941 search results - page 227 / 389 » Reasoning about Computations Using Two-Levels of Logic |
123
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
142
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
143
click to vote
SOUPS
2010
ACM
15 years 7 months ago
2010
ACM
Home computer systems are frequently insecure because they are administered by untrained, unskilled users. The rise of botnets has amplified this problem; attackers can compromis...
255
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
121
click to vote
ACSW
2004
15 years 5 months ago
2004
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...