✦ LIBER ✦

Supporting the formal verification of mathematical texts

✍ Scribed by Claus Zinn

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 264 KB
Volume: 4
Category: Article
ISSN: 1570-8683
DOI: 10.1016/j.jal.2005.10.010

No coin nor oath required. For personal study only.

✦ Synopsis

The formal verification of mathematical texts is one of the most interesting applications for computer systems. In fact, we argue that the expert language of mathematics is the natural choice for achieving efficient mathematician-machine interaction. Our empirical approach, the analysis of carefully authored textbook proofs, forces us to focus on the language and the reasoning pattern that mathematician use when presenting proofs to colleagues and students. Enabling a machine to understand and follow such language and argumentation is seen to be the key to usable and acceptable math assistant systems. In this paper, we first perform an analysis of three textbook proofs by hand; we then describe a computational framework that aims at mechanising such an analysis. The resulting proof-of-concept implementation is capable of processing simple textbook proofs and constitutes promising steps towards a natural mathematician-machine interface for proof development and verification.

📜 SIMILAR VOLUMES

Formal Verification in the Design of Ges

Formal Verification in the Design of Gestural Interaction

✍ G.J. Doherty; G. Faconti; M. Massink 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

This paper shows how formal modelling can be used in the design of a dynamic gesture language defined by sequences of poses. It discusses two models at different levels of abstraction dealing with important usability issues of the language such as ambiguity and overlap in the recognition of gestures

On the formal specification and verifica

On the formal specification and verification of digital circuits

✍ Peter J. de Graaff 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 546 KB

The geometry of separation boundaries. I

The geometry of separation boundaries. II. Mathematical formalism

✍ Angelo Lucia; Ross Taylor 📂 Article 📅 2007 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 326 KB

Formal verification of tail distribution

Formal verification of tail distribution bounds in the HOL theorem prover

✍ Osman Hasan; Sofiène Tahar 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Tail distribution bounds play a major role in the estimation of failure probabilities in performance and reliability analysis of systems. They are usually estimated using Markov's and Chebyshev's inequalities, which represent tail distribution bounds for a random variable in terms of it

A formal mathematical legalization of th

A formal mathematical legalization of the “exponential” debye—hückel theory

✍ I. Ruff 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 131 KB

By hnesization of the Poisson-Bolzzmann equation in a differcat waly from that usually folloued, the neysutity of the par correlation functions of like-charged ons can be avoded The exp. "con thus obtanted for the par correlation functons yelds values very close to the exponentul Debye-Huckel (DIIX)

Supporting the group creation of formal

Supporting the group creation of formal and informal graphics during business process modeling

✍ Mark Pendergast; Kregg Aytes; James D Lee 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 443 KB

Since the 1960s, research in systems analysis and design has been performed along two distinct tracts: the automation of software design, implementation, and verification; and the elicitation of high level systems requirements. Computer-aided software engineering, rapid prototyping, and more recentl