Filters








9 Hits in 0.8 sec

AUTO2, A Saturation-Based Heuristic Prover for Higher-Order Logic [chapter]

Bohua Zhan
2016 Lecture Notes in Computer Science  
We introduce a new theorem prover for classical higher-order logic named auto2. The prover is designed to make use of human-specified heuristics when searching for proofs.  ...  We implemented the prover in Isabelle/HOL, and applied it to several formalization projects in mathematics and computer science, demonstrating the high level of automation it can provide in a variety of  ...  Description of the system In this section, we describe the auto2 prover in detail, followed by a simple example, and a discussion of how the system is used in practice.  ... 
doi:10.1007/978-3-319-43144-4_27 fatcat:zwlitqglmnawnp2laenjfhwnla

Efficient verification of imperative programs using auto2 [article]

Bohua Zhan
2018 arXiv   pre-print
Auto2 is a recently introduced prover for the proof assistant Isabelle. It is designed to be both highly customizable from within Isabelle, and also have a powerful proof search mechanism.  ...  In this paper, we apply auto2 to the verification of imperative programs.  ...  The auto2 prover in Isabelle is introduced by the author in [28] .  ... 
arXiv:1610.06996v3 fatcat:c3psyuka2jcvhebfpsf2xzaafa

Efficient Verification of Imperative Programs Using Auto2 [chapter]

Bohua Zhan
2018 Lecture Notes in Computer Science  
Auto2 is a recently introduced prover for the proof assistant Isabelle. It is designed to be both highly customizable from within Isabelle, and also have a powerful proof search mechanism.  ...  In this paper, we apply auto2 to the verification of imperative programs.  ...  The auto2 prover in Isabelle is introduced by the author in [28] .  ... 
doi:10.1007/978-3-319-89960-2_2 fatcat:562zi2wlvbbndgpfxdxgagh3wm

Formalization of the Fundamental Group in Untyped Set Theory Using Auto2 [chapter]

Bohua Zhan
2017 Lecture Notes in Computer Science  
The auto2 prover is used as the sole automation tool, and enables succinct proof scripts throughout the project.  ...  We present a new framework for formalizing mathematics in untyped set theory using auto2.  ...  We begin with an overview of the auto2 system (see [17] for details). Auto2 is a theorem prover packaged as a tactic in Isabelle.  ... 
doi:10.1007/978-3-319-66107-0_32 fatcat:kaxjxbfrdfcwbduwjoacugsj3m

Selected Extended Papers of ITP 2017

Mauricio Ayala-Rincón, César Muñoz
2018 Journal of automated reasoning  
Finally, Bohua Zhan, in Formalization of the Fundamental Group in Untyped Set Theory Using Auto2, proposes a formal framework for formalizing mathematics in untyped set theory by using the prover auto2  ...  The auto2 prover is packaged as a tactic in Isabelle. The proposed framework allows the entire development chain to be formalized in Isabelle/FOL with a high automation level.  ... 
doi:10.1007/s10817-018-09500-0 fatcat:no6wykx3jrdphd2kalkgqnocqi

Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle [article]

Bohua Zhan, Maximilian P. L. Haslbeck
2018 arXiv   pre-print
Various automation is built and incorporated into the auto2 prover to reason about separation logic with time credits, and to derive asymptotic behavior of functions.  ...  Second, we extend the auto2 prover [21] to provide substantial automation in reasoning about separation logic with time credits, as well as deriving asymptotic behavior of functions.  ...  prover for separation logic to also work with time credits.  ... 
arXiv:1802.01336v1 fatcat:sencjmmrdzcdhalbbyjk2qmudm

Using Cognitive Entropy to Manage Uncertain Concepts in Formal Ontologies [chapter]

Joaquín Borrego-Díaz, Antonia M. Chávez-González
2008 Lecture Notes in Computer Science  
The first one, OTTER, is an automated theorem prover (ATP) based on resolution and support set strategy.  ...  The program allows great autonomy: its auto2 mode suffices to find almost every automated proof that have been required.  ... 
doi:10.1007/978-3-540-89765-1_18 fatcat:xcf3tyohfzchhofe6d6gbv42di

Semantics of Mizar as an Isabelle Object Logic

Cezary Kaliszyk, Karol Pąk
2018 Journal of automated reasoning  
Zhan is developing an object logic based on untyped set theory together with the auto2 [87] automation package for Isabelle.  ...  Today, it is not only a language for proofs, but also for complete interaction with the prover, with most users rarely interacting with the read-eval-print loop of the underlying LCF prover.  ... 
doi:10.1007/s10817-018-9479-z fatcat:2rv4rkh2fjamppxcd243nss5cq

 EDITOR MigueL á. péRez pRiego

José Canet, Consejo De Redacción, Rafael Llavador, Juan Conde, Marta Haro Cortés, Eloisa Palafox, Josep Lluís, Joseph Snow, Patrizia Botta, Pedro Cátedra, Ivy Corfis, Alan Deyermond (+3 others)
unpublished
En este ambiente circula la Celestina, originariamente manuscrita y con una extensión muy breve, al decir del «Autor a un su amigo», lo que equi- valdría aproximadamente a la primera cena o auto2.  ...  On s’est demandé, il y a quelques années, si les dramaturges espagnols du xviie siècle, loin de se borner à emprunter à La Célestine des prover- bes, des images ou des lieux communs, ou bien à ordonner  ... 
fatcat:yv6p5lmgi5cihfedt6o6lr36n4