Zobrazeno 1 - 10
of 2 054
pro vyhledávání: '"symbolic verification"'
Autor:
Blondin, Michael, Cadilhac, Michaël, Cui, Xin-Yi, Czerner, Philipp, Esparza, Javier, Schulz, Jakob
Ordered binary decision diagrams (OBDDs) are a fundamental data structure for the manipulation of Boolean functions, with strong applications to finite-state symbolic model checking. OBDDs allow for efficient algorithms using top-down dynamic program
Externí odkaz:
http://arxiv.org/abs/2411.17250
Autor:
Hong, Xin, Huang, Wei-Jia, Chien, Wei-Chen, Feng, Yuan, Hsieh, Min-Hsiu, Li, Sanjiang, Yeh, Chia-Shun, Ying, Mingsheng
With the rapid development of quantum computing, automatic verification of quantum circuits becomes more and more important. While several decision diagrams (DDs) have been introduced in quantum circuit simulation and verification, none of them suppo
Externí odkaz:
http://arxiv.org/abs/2308.00440
Pre-trained language models (LMs) have shown remarkable reasoning performance using explanations or chain-of-thoughts (CoT)) for in-context learning. On the other hand, these reasoning tasks are usually presumed to be more approachable for symbolic p
Externí odkaz:
http://arxiv.org/abs/2212.08686
We present symQV, a symbolic execution framework for writing and verifying quantum computations in the quantum circuit model. symQV can automatically verify that a quantum program complies with a first-order specification. We formally introduce a sym
Externí odkaz:
http://arxiv.org/abs/2212.02267
Stochastic games are a convenient formalism for modelling systems that comprise rational agents competing or collaborating within uncertain environments. Probabilistic model checking techniques for this class of models allow us to formally specify qu
Externí odkaz:
http://arxiv.org/abs/2211.06141
Formal verification has emerged as a powerful approach to ensure the safety and reliability of deep neural networks. However, current verification tools are limited to only a handful of properties that can be expressed as first-order constraints over
Externí odkaz:
http://arxiv.org/abs/2203.00938
Autor:
Miculan, Marino, Vitacolonna, Nicola
Publikováno v:
In "Proceedings of the 18th International Conference on Security and Cryptography, SECRYPT 2021". ISBN 978-989-758-524-1, pages 185-197
MTProto 2.0 is a suite of cryptographic protocols for instant messaging at the core of the popular Telegram messenger application. In this paper we analyse MTProto 2.0 using the symbolic verifier ProVerif. We provide fully automated proofs of the sou
Externí odkaz:
http://arxiv.org/abs/2012.03141
Autor:
Ying, Mingsheng, Ji, Zhengfeng
This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the existing techn
Externí odkaz:
http://arxiv.org/abs/2010.03032
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018
Cache timing attacks allow third-party observers to retrieve sensitive information from program executions. But, is it possible to automatically check the vulnerability of a program against cache timing attacks and then, automatically shield program
Externí odkaz:
http://arxiv.org/abs/1807.04701
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.