Dissertations / Theses on the topic 'Theorem proving'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Theorem proving.'
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.
Ballarin, Clemens Michael. "Computer algebra and theorem proving." Thesis, University of Cambridge, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624429.
Full textJi, Kailiang. "Model checking and theorem proving." Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC250.
Full textModel checking is a technique for automatically verifying correctness properties of finite systems. Normally, model checking tools enjoy two remarkable features: they are fully automatic and a counterexample will be produced if the system fails to satisfy the property. . Deduction Modulo is a reformulation of Predicate Logic where some axioms- - - possibly ail---are replaced by rewrite rules. The focus of this dissertation is to give an encoding of temporal properties expressed in CTL as first -order formulas, by translating the logical equivalence between temporal operators into rewrite rules. This way, proof -search algorithms designed for Deduction Modulo, such as Resolution Modulo or Tableaux Modulo, can be used to verify temporal properties of finite transition systems. To achieve the aim of solving model checking problems with an off-the-shelf automated theorem proyer, three works are included in this dissertation. First, we address the graph traversai problems in model checking with automated theorem provers. As a preparation work, we propose a way of encoding a graph as a formula such that the traversal of the graph corresponds to resolution steps. Then we present the way of translating model checking problems as proving first-order formulas in Deduction Modulo. The soundness and completeness of our method shows that solving CTL model checking problems with automated theorem provers is feasible. At last, based on the theoretical basis in the second work, we propose a symbolic model checking method. This method is implemented in iProver Modulo, which is a first-order theorem proyer uses Polarized Resolution Modulo
Kakkad, Aman. "Machine Learning for Automated Theorem Proving." Scholarly Repository, 2009. http://scholarlyrepository.miami.edu/oa_theses/223.
Full textFolkler, Andreas. "Automated Theorem Proving : Resolution vs. Tableaux." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5531.
Full textSyftet med detta magisterarbete var att undersöka vilken av de två metoderna, resolution och tablå, som är mest lämpad för automatisk teorembevisning. Detta gjordes genom att implementera en automatisk teorembevisare, jämföra och dokumentera problem, samt att mäta prestanda för bevisning. I detta arbete drar jag slutsatsen att resolutionsmetoden förmodligen är mer lämpad än tablåmetoden för en automatisk teorembevisare, med avseende på hur svår den är att implementera. När det gäller prestanda indikerar utförda tester att resolutionsmetoden är det bästa valet.
Amjad, Hasan. "Combining model checking and theorem proving." Thesis, University of Cambridge, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.616074.
Full textBridge, J. P. "Machine learning and automated theorem proving." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596901.
Full textHou, Tie. "Interactive theorem proving and program extraction." Thesis, Swansea University, 2014. https://cronfa.swan.ac.uk/Record/cronfa42845.
Full textSyme, Donald Robert. "Declarative theorem proving for operational semantics." Thesis, University of Cambridge, 1999. https://www.repository.cam.ac.uk/handle/1810/252967.
Full textHarrison, John Robert. "Theorem proving with the real numbers." Thesis, University of Cambridge, 1996. https://www.repository.cam.ac.uk/handle/1810/265488.
Full textHaufe, Sebastian. "Automated Theorem Proving for General Game Playing." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-89998.
Full textKim, Choon Kyu 1963. "Parallel semantic tree theorem proving with resolutions." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=85076.
Full textIn this thesis, we propose building a parallel system through the integration of semantic trees with resolution-refutation. The proposal comes from the observations that the appropriate strategy for one class of theorems is often very different from that for another class and many semantic trees tend to be linear. In the linear semantic tree, one of the two branches from each node leads to a failure node. Such linearity is attractive because we can focus our efforts on closing the remaining branch. Unfortunately, the strategy of building a closed linear semantic tree is incomplete. To help to achieve closure, we introduce the use of unit clauses derived from resolutions when necessary, leading to a strategy that combines the construction of semantic trees with resolution-refutation.
The parallel semantic tree theorem prover, called PrHERBY, utilizes dedicated resolutions in scalable manner and strategically selects atoms to construct semantic trees. In addition, a parallel grounding scheme allows each system to have its own instance of generated atoms, thereby increasing the possibility of success. The PrHERBY system presented performs significantly better and generally finds proof using fewer atoms than the semantic tree prover, HERBY and its parallel version, PHERBY.
Sadri, Fariba. "A theorem-proving approach to database integrity." Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/47238.
Full textNe, Win Toh 1979. "Theorem-proving distributed algorithms with dynamic analysis." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29702.
Full textIncludes bibliographical references (p. 185-194).
Theorem provers are notoriously hard to use because of the amount of human interaction they require, but they are important tools that can verify infinite state distributed systems. We present a method to make theorem-proving safety properties of distributed algorithms more productive by reducing human intervention. We model the algorithms as I/O automata, render the automata executable, and analyze the test executions with dynamic invariant detection. The human work in using a theorem prover is reduced because our technique provides two forms of assistance: lemmas generated by the dynamic invariant detection for use in the prover; and prover scripts, or tactics, generated from our experience with the I/O automaton model and the knowledge embedded in the test suite used for execution. We test our technique on three case studies: the Peterson 2-process mutual exclusion algorithm, a strong caching implementation of shared memory, and Lamport's Paxos algorithm for distributed consensus. In the development and implementation of our method, we also improved the tools for formal verification of 1/0 automata and for dynamic invariant detection. We describe a new model for specifying I/O automata in the Isabelle theorem prover's logic, and prove the soundness of a technique for verifying invariants in this model in the Isabelle prover. We develop methods for generating proofs of I/0 automata for two theorem provers, the Larch Prover and Isabelle/HOL. We show methods for executing I/O automata for testing, by allowing the execution of some automata defined with universal and existential quantifiers that were previously non-executable. Lastly, we present improvements to dynamic invariant detection in order to make it more scalable - in particular, we show how to achieve efficient incremental dynamic invariant detection, where the detection tool is only allowed to make one pass over its input executions.
by Toh Ne Win.
M.Eng.
Martin, Andrew Philip. "Machine-assisted theorem-proving for software engineering." Thesis, University of Oxford, 1994. http://ora.ox.ac.uk/objects/uuid:728d3cee-1dfe-4186-a49f-52b33cbc6551.
Full textGill, David Michael. "Automatic theorem proving programs and group presentations." Thesis, University of St Andrews, 1995. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268121.
Full textZacchiroli, Stefano <1979>. "User interaction widgets for interactive theorem proving." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/616/1/Tesi_Zacchiroli.pdf.
Full textZacchiroli, Stefano <1979>. "User interaction widgets for interactive theorem proving." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/616/.
Full textPrince, Rawle C. S. "Aspects of the theory of containers within automated theorem proving." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/11793/.
Full textHunter, Christopher. "Agent-based proof support for interactive theorem proving /." [St. Lucia, Qld.], 2005. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe19390.pdf.
Full textLapierre, Patrice. "Willow : extending Herby's semantic tree theorem-proving heuristics." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0022/MQ50812.pdf.
Full textMatthews, S. "Metalevel and reflexive extension in mechanical theorem proving." Thesis, University of Edinburgh, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.657448.
Full textSCHROEDER, BRUNO. "A GRAPH BASED THEOREM PROVING PLATFORM WITH STRATEGIES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=29093@1.
Full textCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Demonstrações em lógica podem tornar-se muito grandes e complexas. Para resolver problemas, e para estudar lógica, é comum valer-se de assistentes de demonstração. Um assistente de demonstração geral deve integrar ferramentas que ajudem a especificar as lógicas, as equações, os conjuntos de regras, e as estratégias de busca (semi) automática de demonstrações. A comunidade usuária de Provadores Automáticos de Teoremas conhece algumas ferramentas que atendem a estes requisitos. Entretanto, estas ferramentas não estão preparadas para lidar com demonstrações muito grandes. Trabalhos recentes sugerem que uma boa forma de chegar a demonstrações menores é usar grafos, ao invés de árvores, para representar demonstrações. Esta dissertação descreve e implementa uma máquina virtual baseada em grafo e um compilador para a confecção de provadores de teoremas baseados em grafo. Para validar a ferramenta, alguns estudos de casos e provadores de teoremas baseados em grafo são apresentados.
Proofs in logic can become very big and complex. For problem solving, and to teach logic, it is common the use of proof assistants. A general proof assistant should integrate tools to help users on specifying the logics, the formulas, the sets of rules, and the very strategy to perform (semi) automatic proof search. The Automatic Theorem Provers community is aware of some tools that were designed to fulfill these requirements. However, these tools do not take the (possibly) huge size of a proof. Recent works have pointed out that a good way to achieve shorter proofs is the use of graphs, instead of trees, to represent proofs. This dissertation describes and implements a graph-based virtual machine and a compiler for the production of graph-based theorem provers. Some case studies, standard as well as graph-based theorem prover, are illustrated in order to validate the tool.
Suen, Edward Shaw-Lee Carleton University Dissertation Computer Science. "Tableau-based theorem proving for representation and reasoning." Ottawa, 1987.
Find full textBlanco, Martínez Roberto. "Applications of Foundational Proof Certificates in theorem proving." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX111/document.
Full textFormal trust in an abstract property, be it a mathematical result or a quality of the behavior of a computer program or a piece of hardware, is founded on the existence of a proof of its correctness. Many different kinds of proofs are written by mathematicians or generated by theorem provers, with the common problem of ascertaining whether those claimed proofs are themselves correct. The recently proposed Foundational Proof Certificate (FPC) framework harnesses advances in proof theory to define the semantics of proof formats, which can be verified by an independent and trusted proof checking kernel written in a logic programming language. This thesis extends initial results in certification of first-order proofs in several directions. It covers various essential logical axes grouped in meaningful combinations as they occur in practice: first,classical logic without fixed points and proofs generated by automated theorem provers; later, intuitionistic logic with fixed points and equality as logical connectives and proofs generated by proof assistants. The role of proof certificates is no longer limited to representing complete proofs to enable independent checking, but is extended to model proof transformations where details can be added to or subtracted from a certificate. These transformations yield operationally simpler certificates, around which increasingly trustworthy and performant proof checkers are constructed. Another new role of proof certificates is writing high-level proof outlines, which can be used to represent standard proof patterns as written by mathematicians, as well as automated techniques like property-based testing. We apply these developments to fully certify results produced by two families of standard automated theorem provers: resolution- and satisfiability-based. Another application is the design of programmable proof description languages for a proof assistant
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 textGottliebsen, Hanne. "Automated theorem proving for mathematics : real analysis in PVS." Thesis, University of St Andrews, 2002. http://hdl.handle.net/10023/15046.
Full textHesketh, Jane Thurmann. "Using middle-out reasoning to guide inductive theorem proving." Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/19842.
Full textMário, Oliveira Rodrigues Cleyton. "Component assembly and theorem proving in constraint handling rules." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1821.
Full textDevido á grande demanda por softwares cada vez mais robustos, complexos e flexíveis, e, sobretudo, pelo curtíssimo tempo de entrega exigido, a engenharia de software tem procurado novos meios de desenvolvimento que supram satisfatoriamente essas demandas. Uma forma de galgar esses novos patamares de produtividade provém do uso de uma metodologia baseada em agentes que se comunicam e com isso, ao invés dos programas serem estritamente programados, o comportamento destes sistemas de software emerge da interação de agentes, robôs, ou subsistemas aut onomos, independentes, além de declarativamente especificados. Isto provê a habilidade para automaticamente configurá -los, otimizá-los, monitorá-los, adaptá-los, diagnosticá-los, repará-los e protegê-los dentro do ambiente. Contudo, um grande problema das linguagens declarativas é a falta de mecanismos que permitem a melhor estruturação de dados, facilitando portanto, o reuso. Portanto, esta dissertação explica o desenvolvimento de nova linguagem lógica declarativa para programar sistemas de raciocínio automático de uma forma modularizada: C2HR∨. A linguagem base escolhida para a extensão com componentes lógicos foi CHR. Os motivos para essa escolha são definidos ao longo da dissertação. Duas abordagens, portanto, são apresentadas: a primeira, conhecida como CHRat, foi desenvolvida numa parceria juntamente com o grupo de pesquisas CONTRAINTES do INRIA/Rocquencourt-Paris, onde o programador ´e o responsável direto por definir os componentes CHR, permitindo o seu reuso por outros componentes; a segunda aplicação, CHRtp, visa atender prioritariamente requisitos de completude e, por isso, se baseia em procedimentos lógicos de inferência como: o raciocínio para frente, o raciocínio para trás, e a resolução/factoring. A dissertação mostra também alguns exemplos práticos, onde uso de componentes facilita radicalmente sua implementação. As contribuições almejadas com essa dissertação são: a definição de uma família bem formalizada de provadores de teoremas automáticos, que podem trabalhar com sentenças especificadas em lógica horn ou em lógica de primeira ordem, a extensão de CHR como uma linguagem modular de propósito geral, a melhor estruturação de bases conhecimentos e até o uso em conjunto de bases heterogêneas, a definição de uma linguagem para a fácil e direta estruturação de dados por meio de componentes, dentre outras
Araragi, Tadashi. "Applications of automated theorem proving methods to multi-agent systems." 京都大学 (Kyoto University), 2006. http://hdl.handle.net/2433/143884.
Full textWinterstein, Daniel. "Using diagrammatic reasoning for theorem proving in a continuous domain." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/642.
Full textHeaton, John Edward. "Goal driven theorem proving using conceptual graphs and Peirce logic." Thesis, Loughborough University, 1994. https://dspace.lboro.ac.uk/2134/7706.
Full textPetschulat, Cap. "Transparency in formal proof." [Boise, Idaho] : Boise State University, 2009. http://scholarworks.boisestate.edu/td/54/.
Full textGhazizadeh, Behrad. "Hyperresolution for resolution logics." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ39193.pdf.
Full textShanahan, Murray Patrick. "Exploiting dependencies in search and inference mechanisms." Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.252643.
Full textOkoli, Ifeyinwa. "A novel term rewriting strategy for certain hierarchical AC-algebraic systems." Thesis, Loughborough University, 1989. https://dspace.lboro.ac.uk/2134/10641.
Full textBoulton, Richard John. "Efficiency in a fully-expansive theorem prover." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319465.
Full textAlmulla, Mohammed Ali. "Analysis of the use of semantic trees in automated theorem proving." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=28662.
Full textLim, Hongping. "Translating timed I/O automata specifications for theorem proving in PVs." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36803.
Full textIncludes bibliographical references (leaves 68-70).
The timed input/output automaton modeling framework is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its state-transition based description has to be translated to the language of the theorem prover. This thesis describes a tool for translating from TIOA, the formal language for describing timed input/output automata, to the language of the Prototype Verification System (PVS)--a specification system with an integrated interactive theorem prover. We describe the translation scheme, discuss the design decisions, and briefly present case studies to illustrate the application of the translator in the verification process.
by Hongping Lim.
M.Eng.
Roberts, Brian Glenn. "Modular Detection of Feature Interactions Through Theorem Proving: A Case Study." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0821103-122029.
Full textKeywords: theorem proving; modular verification; software verification; feature-oriented programming; feature interaction. Includes bibliographical references (p. 131-136).
Johnson, Robert David. "Parallel analytic tableaux systems." Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362777.
Full textDuncan, Hazel. "The use of data-mining for the automatic formation of tactics." Thesis, University of Edinburgh, 2007. http://hdl.handle.net/1842/1768.
Full textLerner, Sorin. "Automatically proving the correctness of program analyses and transformations /." Thesis, Connect to this title online; UW restricted, 2006. http://hdl.handle.net/1773/7001.
Full textMontano-Rivas, Omar. "Scheme-based theorem discovery and concept invention." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6269.
Full textSchmidt-Samoa, Tobias. "Flexible heuristic control for combining automation and user-interaction in inductive theorem proving." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980519268.
Full textMackling, Thomas. "Contributions to automated theorem proving and formal methods with applications to control systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0018/NQ44506.pdf.
Full textMeng, Jia. "The integration of higher order interactive proof with first order automatic theorem proving." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615216.
Full textFrank, Mario. "TEMPLAR : efficient determination of relevant axioms in big formula sets for theorem proving." Master's thesis, Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2014/7211/.
Full textDieses Dokument stellt ein System vor, das aus einer (großen) gegebenen Menge von Formeln der klassischen Prädikatenlogik eine Teilmenge auswählt, die für den Beweis einer logischen Formel relevant sind. Ziel des Systems ist, die Beweisbarkeit von Formeln in einer festen Zeitschranke zu ermöglichen oder die Beweissuche durch die eingeschränkte Formelmenge zu beschleunigen. Das Dokument beschreibt die Konzeption, Implementierung und Evaluation des Systems und geht dabei auf die zwei verschiedenen Ansätze zur Auswahl ein. Während das eine Konzept eine Graphensuche wahlweise auf den Negations-Normalformen oder Skolem-Normalformen der Formeln durchführt, indem Pfade von einer Formel zu einer anderen durch Unifikation von Prädikaten gebildet werden, analysiert das andere Konzept die Häufigkeiten von Lexemen und bildet einen Relevanzwert durch Anwendung des in der Computerlinguistik bekannten tf-idf-Maßes. Es werden die Ergebnisse der Weltmeisterschaft der automatischen Theorembeweiser (CADE ATP Systems Competition, CASC-24) vorgestellt und der Effekt des Systems für die Beweissuche analysiert. Weiterhin werden die Ergebnisse der Tests des Systems auf den Problemen der Weltmeisterschaft aus dem Jahre 2012 (CASC-J6) vorgestellt. Es wird darauf basierend evaluiert, inwieweit die Einschränkungen die Theorembeweiser bei dem Beweis komplexer Probleme unterstützen. Letztendlich wird gezeigt, dass das System einerseits positive Effekte für die Theorembeweiser hat und andererseits unabhängig von dem Kalkül ist, den die Theorembeweiser nutzen. Ferner ist der Ansatz unabhängig von der genutzten Logik und kann prinzipiell für alle Stufen der Prädikatenlogik und Aussagenlogik sowie Modallogik genutzt werden. Dieser Aspekt macht den Ansatz universell im automatischen Theorembeweisen nutzbar. Es zeigt sich, dass beide Ansätze zur Auswahl für verschiedene Formelmengen geeignet sind. Es wird auch gezeigt, dass die Kombination beider Ansätze eine signifikante Erhöhung der beweisbaren Formeln zur Folge hat und dass die Auswahl durch die Ansätze mit den Fähigkeiten eines anderen Auswahl-Systems mithalten kann.
DeCloss, Daniel P. "An analysis of Specware and its usefulness in the verification of high assurance systems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Jun%5FDeCloss.pdf.
Full textThesis Advisor(s): Timothy Levin and Cynthia Irvine. "June 2006." Includes bibliographical references (p. 87-89). Also available in print.
Sabharwal, Ashish. "Algorithmic applications of propositional proof complexity /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6938.
Full textGoble, Tiffany Danielle. "Automate Reasoning: Computer Assisted Proofs in Set Theory Using Godel's Algorithm for Class Formation." Thesis, Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4767.
Full text