[图书][B] Foundations of quantum programming

M Ying - 2024 - books.google.com
Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

Probabilistic smart contracts: Secure randomness on the blockchain

K Chatterjee, AK Goharshady… - … on blockchain and …, 2019 - ieeexplore.ieee.org
In today's programmable blockchains, smart contracts are limited to being deterministic and
non-probabilistic. This lack of randomness is a consequential limitation, given that a wide …

Termination analysis of probabilistic programs through Positivstellensatz's

K Chatterjee, H Fu, AK Goharshady - … 2016, Toronto, ON, Canada, July 17 …, 2016 - Springer
We consider nondeterministic probabilistic programs with the most basic liveness property of
termination. We present efficient methods for termination analysis of nondeterministic …

Stochastic invariants for probabilistic termination

K Chatterjee, P Novotný, Ð Žikelić - Proceedings of the 44th ACM …, 2017 - dl.acm.org
Termination is one of the basic liveness properties, and we study the termination problem for
probabilistic programs with real-valued variables. Previous works focused on the qualitative …

Stability verification in stochastic control systems via neural network supermartingales

M Lechner, Đ Žikelić, K Chatterjee… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
We consider the problem of formally verifying almost-sure (as) asymptotic stability in discrete-
time nonlinear stochastic control systems. While verifying stability in deterministic control …

Sound and complete certificates for quantitative termination analysis of probabilistic programs

K Chatterjee, AK Goharshady, T Meggendorfer… - … on Computer Aided …, 2022 - Springer
We consider the quantitative problem of obtaining lower-bounds on the probability of
termination of a given non-deterministic probabilistic program. Specifically, given a non …

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs

S Agrawal, K Chatterjee, P Novotný - Proceedings of the ACM on …, 2017 - dl.acm.org
Probabilistic programs extend classical imperative programs with real-valued random
variables and random branching. The most basic liveness property for such programs is the …

Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time

P Wang, H Fu, K Chatterjee, Y Deng, M Xu - Proceedings of the ACM on …, 2019 - dl.acm.org
The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the
program input result in proportional changes to the program output. For probabilistic …

Advanced weakest precondition calculi for probabilistic programs

BL Kaminski - 2019 - discovery.ucl.ac.uk
Wir studieren die quantitative Analyse probabilistischer Programme. Dabei untersuchen wir
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …

Cost analysis of nondeterministic probabilistic programs

P Wang, H Fu, AK Goharshady, K Chatterjee… - Proceedings of the 40th …, 2019 - dl.acm.org
We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …