283 search results - page 17 / 57 » Effective Program Verification for Relaxed Memory Models |
101
Voted
ICTAC
2010
Springer
14 years 9 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
NIPS
2008
15 years 1 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
ISQED
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes the use of integer equations for high level modeling digital circuits for application of formal verification properties at this level. Most formal verificatio...
102
click to vote
PPL
2008
14 years 11 months ago
2008
Execution of programs with data parallel language constructs is either based on the fork/join or on the SPMD model. Whereas the former executes a program sequentially and confines...
99
Voted
ESOP
2006
Springer
15 years 3 months ago
2006
Springer
Language-based information-flow analysis is promising in protecting data confidentiality. Although much work has been carried out in this area, relatively little has been done for ...