Results 1 to 10 of about 1,881,310 (251)

On Formal Proofs

2008
We address two questions: what is the use of formal proofs? how do we proceed from a formal proof to a computation?
openaire   +2 more sources

Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning

arXiv.org
We introduce Kimina-Prover Preview, a large language model that pioneers a novel reasoning-driven exploration paradigm for formal theorem proving, as showcased in this preview release. Trained with a large-scale reinforcement learning pipeline from Qwen2.
Haiming Wang, Mert Unsal, Xiaohan Lin, Mantas Baksys, Junqi Liu, Marco Dos Santos, Flood Sung, Marina Vinyes, Zhenzhe Ying, Zekai Zhu, Jianqiao Lu, Hugues de Saxc'e, Bolton Bailey, Chendong Song, Chenjun Xiao, Dehao Zhang, Ebony Zhang, Frederick Pu, Han Zhu, Jiawei Liu, Jonas Bayer, Julien Michel, Long Yu, L. Dreyfus-Schmidt, Lewis Tunstall, L. Pagani, Moreira Machado, Pauline Bourigault, Ran Wang, Stanislas Polu, Thibaut Barroyer, Wen-Ding Li, Yazhe Niu, Y. Fleureau, Yang Hu, Zhouliang Yu, Zihan Wang, Zhilin Yang, Zhengying Liu, Jia Li   +39 more
semanticscholar   +1 more source

Formalization and proof of secrecy properties

Proceedings of the 12th IEEE Computer Security Foundations Workshop, 2003
After looking at the security literature, you will find secrecy is formalized in different ways, depending on the application. Applications have threat models that influence our choice of secrecy properties. A property may be reasonable in one context and completely unsatisfactory in another if other threats exist.
openaire   +2 more sources

Olympiad-level formal mathematical reasoning with reinforcement learning

Nature
A long-standing goal of artificial intelligence (AI) is to build systems capable of complex reasoning in vast domains, a task epitomized by mathematics with its boundless concepts and demand for rigorous proof.
T. Hubert, Rishi S Mehta, Laurent Sartran, Miklós Z. Horváth, Goran Žužić, Eric Wieser, Aja Huang, Julian Schrittwieser, Yannick Schroecker, Hussain Masoom, Ottavia Bertolli, Tom Zahavy, Amol Mandhane, Jessica Yung, I. Beloshapka, Borja Ibarz, Vivek Veeriah, Lei Yu, Oliver Nash, Paul Lezeau, Salvatore Mercuri, Calle Sönne, B. Mehta, Alex Davies, Daniel Zheng, F. Pedregosa, Yin Li, Ingrid von Glehn, M. Rowland, Samuel Albanie, Ameya Velingker, S. Schmitt, Edward Lockhart, Edward Hughes, H. Michalewski, Nicolas Sonnerat, D. Hassabis, P. Kohli, David Silver   +38 more
semanticscholar   +1 more source

Formal Analysis of a Proof-of-Stake Blockchain

IEEE International Conference on Engineering of Complex Computer Systems, 2018
Blockchain technology relies on consensus algorithms to resolve conflicts in Byzantine environments. New blockchain algorithms are rapidly designed and implemented without a properly conducted formal analysis and verification. In this paper, we conducted
Wai Yan Maung Maung Thin, Naipeng Dong, Guangdong Bai, J. Dong   +3 more
semanticscholar   +1 more source

Formal and Informal Proofs

1991
It is a great pleasure to take part in this tribute to Woody Bledsoe in celebration of his seventieth birthday. In his 1985 Presidential Address to the American Association for Artificial Intelligence [2], Bledsoe describes the vision which came to him in a dream a quarter of a century earlier, in 1960, a vision in which he saw the future wonders which
openaire   +1 more source

A formal proof of countermeasures against fault injection attacks on CRT-RSA

Journal of Cryptographic Engineering, 2014
In this article, we describe a methodology that aims at either breaking or proving the security of CRT-RSA implementations against fault injection attacks.
Pablo Rauzy, S. Guilley
semanticscholar   +1 more source

Readable Formal Proofs

2008
The need to integrate the processes of programming and program verification requires notations for formal proofs that are easily readable. We discuss this problem in the context of Hoare logic and separation logic. It has long been the custom to describe formal proofs in these logics informally by means of "annotated specifications" or "proof ...
openaire   +1 more source

Blockchain without Waste: Proof-of-Stake

The Review of financial studies, 2020
Permissionless blockchains require a protocol to generate consensus. Many prominent permissionless blockchains employ Proof-of-Work (PoW) for that purpose, but PoW possesses significant shortcomings. Various alternatives have been proposed.
Fahad Saleh
semanticscholar   +1 more source

A Formal Proof of Sylow's Theorem

Journal of Automated Reasoning, 1999
The theorem of Sylow is proved in Isabelle HOL. We follow the proof by Wielandt that is more general than the original and uses a nontrivial combinatorial identity. The mathematical proof is explained in some detail, leading on to the mechanization of group theory and the necessary combinatorics in Isabelle. We present the mechanization of the proof in
Florian Kammüller, Lawrence C. Paulson
openaire   +1 more source