Zobrazeno 1 - 10
of 137 353
pro vyhledávání: 'Jacobs, Bart'
Autor:
Jacobs, Bart
Drawing (a multiset of) coloured balls from an urn is one of the most basic models in discrete probability theory. Three modes of drawing are commonly distinguished: multinomial (draw-replace), hypergeometric (draw-delete), and P\'olya (draw-add). Th
Externí odkaz:
http://arxiv.org/abs/2405.18182
Autor:
Jacobs, Bart
In probabilistic updating one transforms a prior distribution in the light of given evidence into a posterior distribution, via what is called conditioning, updating, belief revision or inference. This is the essence of learning, as Bayesian updating
Externí odkaz:
http://arxiv.org/abs/2405.12700
Autor:
Fasse, Justus, Jacobs, Bart
Busy-waiting is an important, low-level synchronization pattern that is used to implement higher-level abstractions for synchronization. Its termination depends on cooperation by other threads as well as a fair thread scheduler. We present a general
Externí odkaz:
http://arxiv.org/abs/2312.15379
Autor:
Jacobs, Bart, Stein, Dario
Publikováno v:
EPTCS 397, 2023, pp. 172-189
A basic experiment in probability theory is drawing without replacement from an urn filled with multiple balls of different colours. Clearly, it is physically impossible to overdraw, that is, to draw more balls from the urn than it contains. This pap
Externí odkaz:
http://arxiv.org/abs/2312.12453
Bounded proofs are convenient to use due to the high degree of automation that exhaustive checking affords. However, they fall short of providing the robust assurances offered by unbounded proofs. We sketch how completeness thresholds serve as a brid
Externí odkaz:
http://arxiv.org/abs/2309.09731
Autor:
Jacobs, Bart, Stein, Dario
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 3 - Proceedings of MFPS XXXIX (November 23, 2023) entics:12281
The concept of updating a probability distribution in the light of new evidence lies at the heart of statistics and machine learning. Pearl's and Jeffrey's rule are two natural update mechanisms which lead to different outcomes, yet the similarities
Externí odkaz:
http://arxiv.org/abs/2309.07053
Autor:
Wils, Stefan, Jacobs, Bart
VeriFast is a powerful tool for verification of various correctness properties of C programs using symbolic execution. However, VeriFast itself has not been verified. We present a proof-of-concept extension which generates a correctness certificate f
Externí odkaz:
http://arxiv.org/abs/2308.15567
Autor:
Mommen, Niels, Jacobs, Bart
We propose an approach for modular verification of programs written in an object-oriented language where, like in C++, the same virtual method call is bound to different methods at different points during the construction or destruction of an object.
Externí odkaz:
http://arxiv.org/abs/2306.02073