4340 search results - page 713 / 868 » Formal Methods and Cryptography |
124
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
140
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
133
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
157
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
163
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...