arXiv AI By Katharina Engels (Heinrich Heine University D\"usseldorf), Jan Gruteser (Heinrich Heine University D\"usseldorf), Michael Leuschel (Heinrich Heine University D\"usseldorf)

Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB

Read the original on arXiv AI →

arXiv:2607. 21191v1 Announce Type: cross Abstract: Event-B is a formal method rooted in predicate logic and set theory.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 24

Animation, Verification and Visualisation of Prolog Transition Systems with ProB

arXiv:2607. 21192v1 Announce Type: cross Abstract: ProB is a Prolog-based model checker, animator and constraint solver for high-level formal specifications.

By Jan Gruteser (Heinrich Heine University D\"usseldorf), Michael Leuschel (Heinrich Heine University D\"usseldorf), Katharina Engels (Heinrich Heine University D\"usseldorf), Fabian Vu (Heinrich Heine University D\"usseldorf)
arXiv AI
Aug 28

HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement

HybridProver is a unified framework that combines whole-proof synthesis and tactic-based generation using proof sketches as an intermediate representation. Implemented in Isabelle/HOL, it employs two 7B-scale LLMs trained on optimized Isabelle datasets. On the miniF2F Isabelle benchmark, HybridProver achieved a 73.8% success rate, surpassing the previous state of the art of 61.9%, and ablation studies examined the effects of dataset quality, training settings, and sampling strategies.

By Jilin Hu, Jianyu Zhang, Yongwang Zhao, Talia Ringer
arXiv AI
Sep 10

Scratchy: Visual-Scratchpad Multimodal Reasoning for Cryptographic Proof Generation in EasyCrypt

Scratchy introduces a visual-scratchpad method for generating cryptographic proofs in EasyCrypt by converting natural-language security descriptions into a typed proof-relation graph and then into a visual proof state that guides multimodal language models. The approach exposes implicit proof-theoretic dependencies that LLMs struggle with, enabling clearer coordination of probability, adversarial games, invariants, assumptions, and bounds. Scratchy-eval, a 114-task dataset from official EasyCrypt files, demonstrates that classical LLMs achieve significant gains when using these structured visual proof states.

By Yupeng Ren, Zhaoxuan Li, Rui Zhang