Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"ACL2"”.

  1. Translating Clojure to ACL2 for Verification

    … products. Clojure shares a Lisp syntax with ACL2, an interactive theorem prover that is used to verify the correctness of software. Since both languages are based on Lisp, code written in either Clojure or ACL2 is easily converted to the other. Therefore, Clojure can conceivably be verified …

    oklahoma-thes Repository record for Translating Clojure to ACL2 for Verification (opens in a new tab) Restricted access

  2. Generalization, lemma generation, and induction in ACL2

    … study all three of these in the context of the ACL2 theorem prover.

    texas Repository record for Generalization, lemma generation, and induction in ACL2 (opens in a new tab)

  3. Verificación formal en ACL2 del Algoritmo de Buchberger

    … ello un sistema de razonamiento automatizado (ACL2); esto incluye la formalización completa y precisa de toda la teoría matemática subyacente. Concretamente: -El desarrollo de una teoría computacional sobre los anillos de polinomios de múltiples variables. -La obtención de un orden natural a …

    sevilla Repository record for Verificación formal en ACL2 del Algoritmo de Buchberger (opens in a new tab)

  4. Verificación formal en ACL2 del algoritmo de Buchberger

    ACL2 is a computational logic, an automated reasoning system and an applicative programming language, a subset of COMMON LISP, based in pure lambda-calculus. It was developed in the University of Texas at Austin (USA) and is based in an untyped quantifier-free first-order logic of total recursive …

    cadiz Repository record for Verificación formal en ACL2 del algoritmo de Buchberger (opens in a new tab)

  5. Deep Learning Recommendations for the ACL2 Interactive Theorem Prover

    … exists to help automate theorem proving in ACL2. We have developed a machine learning system that generates recommendations to automatically complete proofs. We show that our system benefits from the copy mechanism introduced in the context of program repair. We make our system directly …

    calpoly Repository record for Deep Learning Recommendations for the ACL2 Interactive Theorem Prover (opens in a new tab)

  6. Parallelizing an interactive theorem prover : functional programming and proofs with ACL2

    Multi-core systems have become commonplace, however, theorem provers often do not take advantage of the additional computing resources in an interactive setting. This research explores automatically using these additional resources to lessen the delay between when users submit conjectures to the …

    texas Repository record for Parallelizing an interactive theorem prover : functional programming and proofs with ACL2 (opens in a new tab)

  7. A verified framework for symbolic execution in the ACL2 theorem prover

    … a symbolic execution framework inside the ACL2 theorem prover in order to help address these issues on certain problem domains. Our framework introduces a proof strategy that applies bit-level symbolic execution using BDDs to finite-domain problems. This proof strategy is a fully verified …

    texas Repository record for A verified framework for symbolic execution in the ACL2 theorem prover (opens in a new tab)

  8. Verifying filesystems for abstract separation logic-based program verification in the ACL2 theorem prover

    … implementation of FAT32 in the language of the ACL2 theorem prover. Devising HiFAT, a directory-tree model of FAT32, we prove it to abstract LoFAT. This refinement relationship allows us to quickly prototype a number of filesystem calls in LoFAT, which we later replace with more efficient …

    texas Repository record for Verifying filesystems for abstract separation logic-based program verification in the ACL2 theorem prover (opens in a new tab)

  9. Combining advanced formal hardware verification techniques

    … the forward chaining proof technique within the ACL2 theorem prover is described. This dissertation identifies a decidable subclass of the ACL2 logic, the Subclass of Unrollable List Formulas in ACL2 (SUFLA). SUFLA is shown to be decidable, i.e., there exists an algorithm that decides whether any …

    texas Repository record for Combining advanced formal hardware verification techniques (opens in a new tab)

  10. Deductive mechanical verification of concurrent systems

    … of concurrent programs using the theorem prover ACL2. We present the use of stuttering refinement as a means for specifying the correctness of a concurrent program implementation by relating the execution traces of the implementation with the behaviors of a much simpler specification program. …

    texas Repository record for Deductive mechanical verification of concurrent systems (opens in a new tab)

  11. Una teoría computacional acerca de la lógica ecuacional formalización en ACL2 de la lógica ecuacional y demostración automática de sus propiedades

    … lógica ecuacional, usando para ello el sistema ACL2. Es decir, se usa ACL2 para definir formalmente algoritmos y conceptos relacionados con la lógica ecuacional, y se llevan a cabo demostraciones automáticas de teoremas acerca de estos algoritmos y conceptos. Este trabajo de verificación formal …

    sevilla Repository record for Una teoría computacional acerca de la lógica ecuacional formalización en ACL2 de la lógica ecuacional y demostración automática de sus propiedades (opens in a new tab)

  12. VWSIM : a circuit simulator

    … circuit families, such as CMOS. Written in the ACL2 logic, VWSIM provides formal mathematical guarantees about each of the circuit models it simulates. The ACL2-based definition of the VWSIM simulator offers a path for specifying and verifying RSFQ circuit models.

    texas Repository record for VWSIM : a circuit simulator (opens in a new tab)

  13. Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica

    … polynomials within the framework provided by the ACL2 computational logic. Since ACL2 integrates a pure functional programming language and an automated reasoning system, these libraries can be used for both computation and formal reasoning on polynomial objects. The development of different …

    cadiz Repository record for Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica (opens in a new tab)

  14. Efficient Verification of Bit-Level Pipelined Machines Using Refinement

    … of scalability. (2) The development of ACL2-SMT, a verification system that integrates the popular ACL2 theorem prover (winner of the 2005 ACM Software System Award) with decision procedures. ACL2-SMT allows us to seamlessly take advantage of the two main approaches to hardware …

    gatech Repository record for Efficient Verification of Bit-Level Pipelined Machines Using Refinement (opens in a new tab)

  15. Combining SMT with theorem proving for AMS verification : analytically verifying global convergence of a digital PLL

    … modulo theories” (SMT) solver into the ACL2 theorem prover. The capabilities of these two tools are largely complementary – Z3 provides fully automated reasoning about boolean formulas, linear and non-linear systems of equalities, and simple data structures such as arrays. ACL2 provides …

    ubc Repository record for Combining SMT with theorem proving for AMS verification : analytically verifying global convergence of a digital PLL (opens in a new tab) Download PDF for Combining SMT with theorem proving for AMS verification : analytically verifying global convergence of a digital PLL (opens in a new tab)

  16. Automatically Proving the Termination of Functional Programs

    … arithmetic reasoning over epsilon-naught in the ACL2 theorem proving system. This ordinal library enables new termination proofs that were previously not possible in previous versions of ACL2. The foundation of the second framework is an algorithm for fully automating termination reasoning with …

    gatech Repository record for Automatically Proving the Termination of Functional Programs (opens in a new tab)

  17. Using theorem proving and algorithmic decision procedures for large-scale system verification

    … in a sound and efficient manner. We use the ACL2 theorem prover to demonstrate our methods. A consequence of our work is the identification of certain limitations in the logic and implementation of ACL2. We recommend several augmentations of ACL2 to facilitate deductive verification of large …

    texas Repository record for Using theorem proving and algorithmic decision procedures for large-scale system verification (opens in a new tab)

  18. A hierarchical approach to formal modeling and verification of asynchronous circuits

    … hardware description language defined using the ACL2 theorem-proving system. We apply a link-joint paradigm to model self-timed circuits as networks of channels that communicate with each other locally via handshake protocols. This link-joint model has been shown to be a universal model for …

    texas Repository record for A hierarchical approach to formal modeling and verification of asynchronous circuits (opens in a new tab)

  19. Efficient, mechanically-verified validation of satisfiability solvers

    … correctness with a proof assistant, such as ACL2. We designed a new modeling technique for ACL2 that combines efficient model execution with an agile and convenient theory. Finally, we used this new technique to construct a fast, mechanically-verified validation tool for proofs of …

    texas Repository record for Efficient, mechanically-verified validation of satisfiability solvers (opens in a new tab)

Page 1 of 2