Log in

Relevant bibliographies by topics / Automated Theorem Prover / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Automated Theorem Prover.

Dissertations / Theses on the topic 'Automated Theorem Prover'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 18 dissertations / theses for your research on the topic 'Automated Theorem Prover.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Ridge, Thomas. "Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1461.

Full text

Abstract:

This thesis was motivated by a case study involving the formalisation of arguments that simplify the verification of tree-oriented multicast protocols. As well as covering the case study itself, it discusses our solution to problems we encountered concerning expressivity and automation. The expressivity problems related to the need for theory interpretation. We found the existing Locale and axiomatic type class mechanisms provided by the Isabelle theorem prover we were using to be inadequate. This led us to develop a new prototype implementation of theory interpretation. To support this implem

APA, Harvard, Vancouver, ISO, and other styles

2

Kirschenbaum, Jason P. "Investigations in Automating Software Verification." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306862918.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mukhopadhyay, Trisha. "A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7862.

Full text

Abstract:

Automated Theorem Provers (ATP) are software programs which carry out inferences over logico-mathematical systems, often with the goal of finding proofs to some given theorem. ATP systems are enormously powerful computer programs, capable of solving immensely difficult problems. Currently, many automated theorem provers exist like E, vampire, SPASS, ACL2, Coq etc. However, all the available theorem provers have some common problems: (1) Current ATP systems tend not to try to find proofs entirely on their own. They need help from human experts to supply lemmas, guide the proof, etc. (2) There i

APA, Harvard, Vancouver, ISO, and other styles

4

Adcock, Bruce M. "Working Towards the Verified Software Process." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1293463269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lundberg, Didrik. "Provably Sound and Secure Automatic Proving and Generation of Verification Conditions." Thesis, KTH, Teoretisk datalogi, TCS, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239441.

Full text

Abstract:

Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. This thesis presents a proof procedure to efficiently generate a theorem stating the weakest precondition for a program to terminate successfully in a state upon which a certain postcondition is placed. Specifically, the Poly/ML implementation of the SML metalanguage

APA, Harvard, Vancouver, ISO, and other styles

6

El, haddad Yacine. "Integrating Automated Theorem Provers in Proof Assistants." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG052.

Full text

Abstract:

Lambdapi est un assistant de preuve qui permet à l’utilisateur la construction d’une preuve d’un théorème donné dans un langage universel basé sur le lambda-pi-calcul. Le but de cette thèse est de rajouter de l’automatisation à Lambdapi pour faire gagner du temps à l’utilisateur. Cette thèse présente trois contributions liées à l’intégration des démonstrateurs automatiques dans les assistants de preuve. La première contribution consiste en l’implémentation d’une tactique qui fait appel au démonstrateurs automatiques depuis Lambdapi à travers une plateforme tiers appelé Why3. Généralement, les

APA, Harvard, Vancouver, ISO, and other styles

7

Urbas, Matej. "Mechanising heterogeneous reasoning in theorem provers." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708290.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Xueying. "Rough set theory based automatic text categorization and the handling of semantic heterogeneity." Bonn Informationszentrum Sozialwiss, 2006. http://deposit.ddb.de/cgi-bin/dokserv?id=2704442&prov=M&dokv̲ar=1&doke̲xt=htm.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Braun, David. "Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective." Thesis, Strasbourg, 2019. http://www.theses.fr/2019STRAD020.

Full text

Abstract:

Ce travail de thèse s’inscrit dans le domaine de la preuve assistée par ordinateur et se place d'un point de vue méthodologique. L’objectif premier des assistants de preuves est de vérifier qu’une preuve écrite à la main est correcte; la question ici est de savoir comment à l’intérieur d’un tel système, il est possible d'aider un utilisateur à fabriquer une preuve formelle du résultat auquel il s'intéresse. Ces questions autour de la vérification de preuves, en particulier en certification du logiciel, et au delà de leur traçabilité et de leur lisibilité sont en effet devenues prégnantes avec

APA, Harvard, Vancouver, ISO, and other styles

10

Stein, Shiromoto Humberto. "Stabilisation sous contraintes locales et globales." Phd thesis, Université de Grenoble, 2014. http://tel.archives-ouvertes.fr/tel-01023554.

Full text

Abstract:

Dans ce travail, deux problèmes issus de la théorie de la stabilité ont été étudiés: la synthèse de loi de commandes stabilisantes et l'analyse de la stabilité des systèmes interconnectés sous contraintes locales et globales. En ce qui concerne la synthèse, la problématique a été de concevoir une loi de commande pour les systèmes où la technique de Backstepping ne peut pas être appliquée pour stabiliser globalement l'origine mais s'avère utile pour stabiliser le système autour d'un ensemble désiré. Ensuite, il a été considéré le problème de concevoir une loi de commande qui stabilise localemen

APA, Harvard, Vancouver, ISO, and other styles

11

Davis, Jared Curran. "A self-verifying theorem prover." Thesis, 2009. http://hdl.handle.net/2152/ETD-UT-2009-12-435.

Full text

Abstract:

Programs have precise semantics, so we can use mathematical proof to establish their properties. These proofs are often too large to validate with the usual "social process" of mathematics, so instead we create and check them with theorem-proving software. This software must be advanced enough to make the proof process tractable, but this very sophistication casts doubt upon the whole enterprise: who verifies the verifier? We begin with a simple proof checker, Level 1, that only accepts proofs composed of the most primitive steps, like Instantiation and Cut. This program is so straightforw

APA, Harvard, Vancouver, ISO, and other styles

12

Cruz, Benvindo do Rosário Évora da. "O método do ângulo completo." Master's thesis, 2015. http://hdl.handle.net/10316/31686.

Full text

Abstract:

Dissertação de Mestrado em Matemática, área de Especialização em Análise Aplicada e Computação, apresentada à Faculdade de Ciências e Tecnologia da Universidade de Coimbra<br>Este trabalho descreve o Método do Ângulo Completo para a geometria euclidiana construtiva assim como a sua implementacão no âmbito do Open Geo Prover. O Método do Ângulo Completo é baseado na noção de ângulo completo e num conjunto de axiomas e regras de inferência. Apresentamos um conjunto de regras de inferência para o método do ângulo completo como sendo a base de demonstrações automatizadas de teoremas de geometria

APA, Harvard, Vancouver, ISO, and other styles

13

Robert, Ivo. "ProverX: rewriting and extending prover9." Doctoral thesis, 2020. http://hdl.handle.net/10400.2/9925.

Full text

Abstract:

O propósito principal deste projecto é tornar o demonstrador automático de teoremas Prover9 programável e, por conseguinte, extensível. Este propósito foi conseguido acrescentando um interpretador de Python, uma linha de comandos e uma biblioteca de módulos, objectos e funções escritos em Python para interagir com ficheiros de Prover9 e Mace4. Foi também criada uma “interface” gráfica de utilizador (GUI) sob a forma de uma aplicação web para trazer aos utilizadores um meio mais eficiente e rápido de trabalhar com demonstrações automáticas de teoremas. A nova biblioteca de “scripting” of

APA, Harvard, Vancouver, ISO, and other styles

14

Steyn, Paul Stephanes. "Validating reasoning heuristics using next generation theorem provers." Thesis, 2009. http://hdl.handle.net/10500/2793.

Full text

Abstract:

The specification of enterprise information systems using formal specification languages enables the formal verification of these systems. Reasoning about the properties of a formal specification is a tedious task that can be facilitated much through the use of an automated reasoner. However, set theory is a corner stone of many formal specification languages and poses demanding challenges to automated reasoners. To this end a number of heuristics has been developed to aid the Otter theorem prover in finding short proofs for set-theoretic problems. This dissertation investigates the appl

APA, Harvard, Vancouver, ISO, and other styles

15

Abate, Pietro. "The tableau workbench : a framework for building automated tableau-based theorem provers." Phd thesis, 2007. http://hdl.handle.net/1885/149636.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Johnson, Donald Gordon. "An improved theorem prover by using the semantics of structure." 1985. http://hdl.handle.net/2097/27463.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Barthwal, Aditi. "A formalisation of the theory of context-free languages in higher order logic." Phd thesis, 2010. http://hdl.handle.net/1885/16399.

Full text

Abstract:

We present a formalisation of the theory of context-free languages using the HOL4 theorem prover. The formalisation of this theory is not only interesting in its own right, but also gives insight into the kind of manipulations required to port a pen-and-paper proof to a theorem prover. The mechanisation proves to be an ideal case study of how intuitive textbook proofs can blow up in size and complexity, and how details from the textbook can change during formalisation. The mechanised theory provides the groundwork for our subsequent results about SLR parser generation. The theorems, eve

APA, Harvard, Vancouver, ISO, and other styles

18

Pereira, Manuel Jorge Raminhos. "Finite bases for semigroup varieties." Doctoral thesis, 2020. http://hdl.handle.net/10400.2/10426.

Full text

Abstract:

O objetivo deste trabalho é fornecer um atlas das bases de identidades para as variedades geradas por semigrupos e grupos de ordem pequena. Com o propósito de auxiliar os matemáticos que trabalham neste campo a encontrar informações com facilidade, foi implementado um website que executa em segundo plano um conjunto de algoritmos desenvolvidos no âmbito deste trabalho e ainda ferramentas de demonstração automática e construtores de modelos finitos, para que o utilizador tenha um guia automático e inteligente. Por exemplo, o site fornece a primeira lista completa de variedades geradas por semig

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!