115 search results - page 6 / 23 » Verifying Probabilistic Procedural Programs |
120
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
115
click to vote
ACTA
2010
15 years 2 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
217
click to vote
POPL
2005
ACM
16 years 2 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
123
click to vote
ISSTA
2004
ACM
15 years 7 months ago
2004
ACM
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...