Interaction with Formal Mathematical Documents in Isabelle/PIDE

Abstract

Isabelle/PIDE has emerged over more than 10 years as the standard Prover IDE for interactive theorem proving in Isabelle. The well-established Archive of Formal Proofs (AFP) testifies the success of such applications of formalized mathematics in Isabelle/HOL. More recently, the scope of PIDE has widened towards languages that are not connected to logic and proof in Isabelle, but taken from a broader repertoire of mathematics on the computer. The present paper provides a general overview of the PIDE project and its underlying document model, with built-in parallel evaluation and asynchronous interaction. There is also some discussion of original aims and approaches, successes and failures, later changes to the plan, and ideas for the future.

Access: Assurance Case Centric Engineering of Safety-Critical Systems

“…An important development here is Isabelle (Nipkow et al, 2002), a verification framework for integrated formal methods (Wenzel and Wolff, 2007;Wenzel, 2019;Foster et al, 2019Foster et al, , 2021. Development centres around documents called Isabelle theories, which encode graphs of hyperlinked mathematical artifacts, such as definitions, theorems, and proofs.…”

Automated Compositional Verification for Robotic State Machines using Isabelle/HOL

“…Moreover, it makes our technique compositional, since we can independently verify whether each individual transition preserves the invariants, without affecting any of the other transitions. Thus we harness the incremental nature of the Isabelle document model, whereby individual commands are processed independently [24]. The mapping to RoboChart elements is according to the following template.…”

The Isabelle/Naproche Natural Language Proof Assistant

“…The initial integration of aproche into the Isabelle Prover IDE happened in 2018 and is briefly reported as an example in the PIDE overview article [23] based on Isabelle2019 (June 2019). The main idea was to turn the existing Haskell command-line program into a TCP server that can answer concurrent requests for checking ForTheL texts in a purely functional manner, with proper handling of cancel messages (for interrupts caused by user editing); this required to remove a few low-level system operations, like reading physical files or exit of the process.…”