• Aucun résultat trouvé

Invited Talk: Developments, Libraries and Automated Theorem Provers

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Invited Talk: Developments, Libraries and Automated Theorem Provers"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Invited talk: Developments, Libraries and Automated Theorem Provers

Chad Brown

Czech Technical University Prague, Czech Republic

Abstract

When formalizing a mathematical development with an interactive prover, it is helpful if the user can interface with a library (to avoid starting from scratch) and with automated provers (to avoid needing to give full details explicitly). We will consider an example of a develop- ment in Mizar, leading to some discussion of how one can interact with Mizar's library and how automated theorem provers can help construct Mizar proofs. With this example in mind, we discuss criteria for three aspects of formalization to work in harmony: formal mathematical de- velopments, working with a global library of theorems and denitions and making use of automation.

Références

Télécharger maintenant ( PDF - 1 Page - 29.59 KB )

Documents relatifs

Agile processes evolution challenges

Understanding the evolution history of a complex software system can significantly aid and inform current and future development initiatives of that system. Software repositories

Automated User Modeling for Personalized Digital Libraries

Although this automatic approach solves the main problems that the user-driven (or adaptable) approach has, it still faces some problems: (1) at the beginning

A Verified Theorem Prover Backend Supported by a Monotonic Library

Because undefined abstractions are well-formed expressions that can occur in definitions, lemmas, and proofs, one has to be careful when adapting Nuprl’s semantics to account for

Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq

In order for a reflexive tactic based on a SAT solver to deal with the full propositional fragment of Coq’s logic, it needs to be able to take any arbi- trary formula in input

Automated Planning for User Interface Composition

User Interfaces composition, Semantic models, Automated task planning, Context of use. INTRODUCTION.. Pushed forward by new information technologies, Weiser’s vision of

Formal Verification of Intelligent Cyber-Physical Systems with the Interactive Theorem Prover KeYmaera X

The key idea of our approach for the formal verification of intelligent CPS is to augment existing approaches that provide transformations from industrially used design languages

Prover-independent Axiom Selection for Automated Theorem Proving in Ontohub

In recent years, formalised large theories in form of ontologies, system specifications or mathematical libraries with thousands of sentences have become more and more

Automated Specification-based Testing of Interactive Components with AsmL

4.4 Generation of the Finite State Machine Model The AsmL Tester tool was used to automatically generate the finite state machine (FSM) from the AsmL specification, based