\documentclass{article}
\usepackage{amssymb}
\usepackage[T1]{fontenc}

\title{BibTeX Entries for the ACL2 Workshops}
\author{Jared Davis and Keshav Kini}

\begin{document}

\maketitle

This file provides a list of BibTeX entries which can be used to cite papers
from the ACL2 workshops from within \LaTeX{}.  If you see any errors in these
entries please submit a pull request to the ACL2 repository to fix them.


\section{ACL2 Workshop 1999}

\noindent {\sf 99-moore-graph}\cite{99-moore-graph} \\
An Exercise in Graph Theory \\

\noindent {\sf 99-kaufmann-ftc}\cite{99-kaufmann-ftc} \\
Modular Proof: The Fundamental Theorem of Calculus \\

\noindent {\sf 99-manolios-mu}\cite{99-manolios-mu} \\
Mu-Calculus Model-Checking \\

\noindent {\sf 99-greve-simulators}\cite{99-greve-simulators} \\
High-Speed, Analyzable Simulators \\

\noindent {\sf 99-sawada-pipelined}\cite{99-sawada-pipelined} \\
Verification of a Simple Pipelined Machine Model \\

\noindent {\sf 99-hunt-de}\cite{99-hunt-de} \\
The {DE} Language \\

\noindent {\sf 99-borrione-vhdl}\cite{99-borrione-vhdl} \\
Using Macros to Mimic {VHDL} \\

\noindent {\sf 99-jamsek-ste}\cite{99-jamsek-ste} \\
Symbolic Trajectory Evaluation \\

\noindent {\sf 99-russinoff-rtl}\cite{99-russinoff-rtl} \\
{RTL} Verification: A Floating-Point Multiplier \\

\noindent {\sf 99-bertoli-verifier}\cite{99-bertoli-verifier} \\
Design Verification of a Safety-Critical Embedded Verifier \\

\noindent {\sf 99-goerigk-compiler}\cite{99-goerigk-compiler} \\
Compiler Verification Revisited \\

\noindent {\sf 99-mccune-ivy}\cite{99-mccune-ivy} \\
{Ivy}: A Preprocessor and Proof Checker for First-Order Logic \\

\noindent {\sf 99-cowles-91}\cite{99-cowles-91} \\
{Knuth}'s Generalization of {McCarthy}'s 91 Function \\

\noindent {\sf 99-gamboa-differentiability}\cite{99-gamboa-differentiability} \\
Continuity and Differentiability \\


\section{ACL2 Workshop 2000}

\noindent {\sf 00-lusk-parallel}\cite{00-lusk-parallel} \\
ACL2 for Parallel Systems Software: A Progress Report \\

\noindent {\sf 00-wilding-stobj}\cite{00-wilding-stobj} \\
Using a Single-Threaded Object to Speed a Verified Graph Pathfinder \\

\noindent {\sf 00-sumners-bdds}\cite{00-sumners-bdds} \\
Correcness Proof of a BDD Manager in the Context of Satisfiability Checking \\

\noindent {\sf 00-shumsky-sdl}\cite{00-shumsky-sdl} \\
Developing a Framework for Simulation, Verification and Testing of SDL Specifications \\

\noindent {\sf 00-manolios-pipeline}\cite{00-manolios-pipeline} \\
Verification of Pipelined Machines in ACL2 \\

\noindent {\sf 00-sumners-stuttering}\cite{00-sumners-stuttering} \\
An Incremental Stuttering Refinement Proof of a Concurrent Program in ACL2 \\

\noindent {\sf 00-reina-multiset}\cite{00-reina-multiset} \\
Multiset Relations: A Tool for Proving Termination \\

\noindent {\sf 00-goerigk}\cite{00-goerigk} \\
Proving Preservation of Partial Correctness with ACL2: A Mechanical Compiler Source Level Correctness Proof \\

\noindent {\sf 00-sawada-computed}\cite{00-sawada-computed} \\
ACL2 Computed Hints: Extension and Practice \\

\noindent {\sf 00-bulo-polynomial}\cite{00-bulo-polynomial} \\
Automatic Verification of Polynomial Rings: Fundamental Properties in ACL2 \\

\noindent {\sf 00-russinoff-chinese}\cite{00-russinoff-chinese} \\
A Mechanical Proof of the Chinese Remainder Theorem \\

\noindent {\sf 00-manolios-partial}\cite{00-manolios-partial} \\
Partial Functions in ACL2 \\

\noindent {\sf 00-bailey-tarai}\cite{00-bailey-tarai} \\
Knuth's Generalization of Takeuchi's Tarai Function: Preliminary Report \\

\noindent {\sf 00-kaufmann-pipeline}\cite{00-kaufmann-pipeline} \\
Verification of Pipeline Circuits \\


\section{ACL2 Workshop 2002}

\noindent {\sf 02-barrione-vhdl}\cite{02-barrione-vhdl} \\
A Framework for VHDL Combining Theorem Proving and Symbolic Simulation \\

\noindent {\sf 02-caldwell-nuprl}\cite{02-caldwell-nuprl} \\
Representing Nuprl Proof Objects in ACL2: toward a proof checker for Nuprl \\

\noindent {\sf 02-sawada-sqrt}\cite{02-sawada-sqrt} \\
Formal Verification of Divide and Square Root Algorithms Using Series Calculation \\

\noindent {\sf 02-gamboa-taylor}\cite{02-gamboa-taylor} \\
Taylor's Formula with Remainder \\

\noindent {\sf 02-bulo-polynomial}\cite{02-bulo-polynomial} \\
Implementation in ACL2 of Well-Founded Polynomial Orderings \\

\noindent {\sf 02-reina-terms}\cite{02-reina-terms} \\
A Theory About First-Order Terms in ACL2 \\

\noindent {\sf 02-reina-dags}\cite{02-reina-dags} \\
Progress Report: Term Dags Using Stobjs \\

\noindent {\sf 02-manolios-adding}\cite{02-manolios-adding} \\
Adding a Total Order to ACL2 \\

\noindent {\sf 02-sumners-sat}\cite{02-sumners-sat} \\
Checking ACL2 Theorems via SAT Checking \\

\noindent {\sf 02-kaufmann-rewriting}\cite{02-kaufmann-rewriting} \\
Efficient Rewriting of Operations on Finite Structures in ACL2 \\

\noindent {\sf 02-cowles-primitive}\cite{02-cowles-primitive} \\
Consistently Adding Primitive Recursive Definitions in ACL2 \\

\noindent {\sf 02-cowles-flat}\cite{02-cowles-flat} \\
Flat Domains and Recursive Equations in ACL2 \\

\noindent {\sf 02-martin-molecular}\cite{02-martin-molecular} \\
Molecular Computation Models in ACL2: a Simulation of Lipton's Experiment Solving SAT \\

\noindent {\sf 02-martin-instantiation}\cite{02-martin-instantiation} \\
A Generic Instantiation Tool and a Case Study: A Generic Multiset Theory. \\

\noindent {\sf 02-ray-quicksort}\cite{02-ray-quicksort} \\
Verification of an In-place Quicksort in ACL2 \\


\section{ACL2 Workshop 2003}

\noindent {\sf 03-kaufmann-simplifying}\cite{03-kaufmann-simplifying} \\
A Tool for Simplifying Files of ACL2 Definitions \\

\noindent {\sf 03-hendrix-matricies}\cite{03-hendrix-matricies} \\
Matricies in ACL2 \\

\noindent {\sf 03-manolios-ordinal}\cite{03-manolios-ordinal} \\
Ordinal Arithmetic in ACL2 \\

\noindent {\sf 03-sustik-dickson}\cite{03-sustik-dickson} \\
Proof of Dickson's Lemma Using the ACL2 Theorem Prover via an Explicit Ordinal Mapping \\

\noindent {\sf 03-gamboa-arrays}\cite{03-gamboa-arrays} \\
Using ACL2 Arrays to Formalize Matrix Algebra \\

\noindent {\sf 03-gamboa-kalman}\cite{03-gamboa-kalman} \\
On the Verification of Synthesized Kalman Filters \\

\noindent {\sf 03-matlin-encapsulation}\cite{03-matlin-encapsulation} \\
Encapsulation for Practical Simplification Procedures \\

\noindent {\sf 03-sumners-fairness}\cite{03-sumners-fairness} \\
Fair Environment Assumptions in ACL2 \\

\noindent {\sf 03-toma-sha}\cite{03-toma-sha} \\
SHA Formalization \\

\noindent {\sf 03-greve-separation}\cite{03-greve-separation} \\
A Separation Kernel Formal Security Policy \\

\noindent {\sf 03-moore-tagging}\cite{03-moore-tagging} \\
Memory Taggings and Dynamic Data Structures \\

\noindent {\sf 03-moore-assertions}\cite{03-moore-assertions} \\
Inductive Assertions and Operational Semantics \\

\noindent {\sf 03-greve-typed}\cite{03-greve-typed} \\
Typed ACL2 Records \\

\noindent {\sf 03-greve-mbe}\cite{03-greve-mbe} \\
Using MBE to Speed a Verified Graph Pathfinder \\

\noindent {\sf 03-liu-rockwell}\cite{03-liu-rockwell} \\
A Solution to the Rockwell Challenge \\

\noindent {\sf 03-song-security}\cite{03-song-security} \\
Using ACL2 to Verify Security Properties of Specification-based Intrusion Detection Systems \\

\noindent {\sf 03-al-sammane-mathematica}\cite{03-al-sammane-mathematica} \\
Combining ACL2 and Mathematica for the Symbolic Simulation of Digital Systems \\

\noindent {\sf 03-schmaltz-bus}\cite{03-schmaltz-bus} \\
Validation of a Parameterized Bus Architecture Model \\

\noindent {\sf 03-gamboa-polymorphism}\cite{03-gamboa-polymorphism} \\
Polymorphism in ACL2 \\

\noindent {\sf 03-gamboa-literate}\cite{03-gamboa-literate} \\
Writing Literate Proofs with XML Tools \\

\noindent {\sf 03-ray-modelchecking}\cite{03-ray-modelchecking} \\
Certifying Compositional Model Checking Algorithms in ACL2 \\

\noindent {\sf 03-austel-types}\cite{03-austel-types} \\
Implementing Abstract Types in ACL2 \\


\section{ACL2 Workshop 2004}

\noindent {\sf 04-sumners-invariant}\cite{04-sumners-invariant} \\
Reducing Invariant Proofs to Finite Search via Rewriting \\

\noindent {\sf 04-ray-partial}\cite{04-ray-partial} \\
Attaching Efficient Executability to Partial Functions in ACL2 \\

\noindent {\sf 04-matthews-clock}\cite{04-matthews-clock} \\
Partial Clock Functions in ACL2 \\

\noindent {\sf 04-gameiro-interval}\cite{04-gameiro-interval} \\
Formally Verifying an Algorithm Based on Interval Arithmetic for Checking Transversality \\

\noindent {\sf 04-manolios-hard}\cite{04-manolios-hard} \\
A Suite of Hard ACL2 Theorems Arising in Refinement-Based Processor Verification \\

\noindent {\sf 04-davis-sets}\cite{04-davis-sets} \\
Finite Set Theory based on Fully Ordered Lists \\

\noindent {\sf 04-roach-hats}\cite{04-roach-hats} \\
Verifying Transformation Rules of the HATS High-Assurance Transformation System: An Approach \\

\noindent {\sf 04-fisler-features}\cite{04-fisler-features} \\
A Case Study in using ACL2 for Feature-Oriented Verification \\

\noindent {\sf 04-sawada-vhdl}\cite{04-sawada-vhdl} \\
ACL2VHDL Translator: A Simple Approach to Fill the Semantic Gap \\

\noindent {\sf 04-austel-typing}\cite{04-austel-typing} \\
Adding a typing mechanism to ACL2 \\

\noindent {\sf 04-reina-unification}\cite{04-reina-unification} \\
A Formally Verified Quadratic Unification Algorithm \\

\noindent {\sf 04-legato-preconditions}\cite{04-legato-preconditions} \\
Generic Theories as Proof Strategies: A Case Study for Weakest Precondition Style Proofs \\

\noindent {\sf 04-hunt-nonlinear}\cite{04-hunt-nonlinear} \\
Integrating Nonlinear Arithmetic into ACL2 \\

\noindent {\sf 04-greve-partitioning}\cite{04-greve-partitioning} \\
A Summary of Intrinsic Partitioning Verification \\

\noindent {\sf 04-greve-enumeration}\cite{04-greve-enumeration} \\
Address Enumeration and Reasoning Over Linear Address Spaces \\

\noindent {\sf 04-smith-bags}\cite{04-smith-bags} \\
An ACL2 Library for Bags (Multisets) \\

\noindent {\sf 04-richards-common}\cite{04-richards-common} \\
The Common Criteria, Formal Methods and ACL2 \\

\noindent {\sf 04-young-abstract}\cite{04-young-abstract} \\
Reverse Abstraction in ACL2 \\

\noindent {\sf 04-foss-gwv}\cite{04-foss-gwv} \\
An Analysis of the GWV Security Policy \\

\noindent {\sf 04-schmaltz-network}\cite{04-schmaltz-network} \\
A Functional Specification and Validation Model for Networks on Chip in the ACL2 Logic \\

\noindent {\sf 04-toma-sha}\cite{04-toma-sha} \\
Verification of a Cryptographic Circuit: SHA-1 using ACL2 \\

\noindent {\sf 04-gamboa-axiomatic}\cite{04-gamboa-axiomatic} \\
Axiomatic Events in ACL2(r): A Story of defun, defun-std, and encapsulate \\

\noindent {\sf 04-cowles-tail}\cite{04-cowles-tail} \\
Contributions to the Theory of Tail Recursive Functions \\


\section{ACL2 Workshop 2006}

\noindent {\sf 06-pike-cryptol}\cite{06-pike-cryptol} \\
A Verifying Core for a Cryptographic Language Compiler \\

\noindent {\sf 06-hardin-framework}\cite{06-hardin-framework} \\
A Robust Machine Code Proof Framework for Highly Secure Applications \\

\noindent {\sf 06-cowles-factorization}\cite{06-cowles-factorization} \\
Unique Factorization in {ACL2}: {Euclidean} Domains \\

\noindent {\sf 06-greve-parameterized}\cite{06-greve-parameterized} \\
Parameterized Congruences in {ACL2} \\

\noindent {\sf 06-swords-stlc}\cite{06-swords-stlc} \\
Soundness of the Simply Typed Lambda Calculus in {ACL2} \\

\noindent {\sf 06-gordon-hol}\cite{06-gordon-hol} \\
An Embedding of the {ACL2} Logic in {HOL} \\

\noindent {\sf 06-schmaltz-chip}\cite{06-schmaltz-chip} \\
Towards a Formal Theory of On Chip Communications in the {ACL2} Logic \\

\noindent {\sf 06-davis-memories}\cite{06-davis-memories} \\
Memories: Array-like Records for {ACL2} \\

\noindent {\sf 06-hoare-ideal}\cite{06-hoare-ideal} \\
The Ideal of Verified Software \\

\noindent {\sf 06-reeber-multiplier}\cite{06-reeber-multiplier} \\
Combining {ACL2} and an Automated Verification Tool to Verify a Multiplier \\

\noindent {\sf 06-gamboa-evaluator}\cite{06-gamboa-evaluator} \\
Implementing a Cost-Aware Evaluator for {ACL2} Expressions \\

\noindent {\sf 06-boyer-memoization}\cite{06-boyer-memoization} \\
Function Memoization and Unique Object Representation for {ACL2} Functions \\

\noindent {\sf 06-rager-parallelism}\cite{06-rager-parallelism} \\
Adding Parallelism Capabilities to {ACL2} \\

\noindent {\sf 06-ray-quantification}\cite{06-ray-quantification} \\
Quantification in Tail-recursive Function Definitions \\

\noindent {\sf 06-hunt-phylogenetic}\cite{06-hunt-phylogenetic} \\
Phylogenetic Trees in {ACL2} \\

\noindent {\sf 06-kaufmann-double}\cite{06-kaufmann-double} \\
Double Rewriting for Equivalential Reasoning in {ACL2} \\

\noindent {\sf 06-vaillancourt-drscheme}\cite{06-vaillancourt-drscheme} \\
{ACL2} in {DrScheme} \\

\noindent {\sf 06-davis-file}\cite{06-davis-file} \\
Reasoning about {ACL2} File Input \\

\noindent {\sf 06-reeber-sat}\cite{06-reeber-sat} \\
A {SAT}-Based Procedure for Verifying Finite State Machines in {ACL2} \\


\section{ACL2 Workshop 2007}

\noindent {\sf 07-dillinger-hacking}\cite{07-dillinger-hacking} \\
Hacking and Extending {ACL2} \\

\noindent {\sf 07-spiridonov-pythia}\cite{07-spiridonov-pythia} \\
{Pythia:} Automatic Generation of Counterexamples for {ACL2} using {Alloy} \\

\noindent {\sf 07-erickson-backtracking}\cite{07-erickson-backtracking} \\
Backtracking and Induction in {ACL2} \\

\noindent {\sf 07-cowles-challenge}\cite{07-cowles-challenge} \\
The While-language Challenge: First Progress \\

\noindent {\sf 07-infante-lopez-examples}\cite{07-infante-lopez-examples} \\
Building Lemmas Using Examples \\

\noindent {\sf 07-andres-topology}\cite{07-andres-topology} \\
Formalizing Simplicial Topology in {ACL2} \\

\noindent {\sf 07-schmaltz-routing}\cite{07-schmaltz-routing} \\
Formal Specification and Validation of Minimal Routing Algorithms for the {2D} Mesh \\

\noindent {\sf 07-hunt-adders}\cite{07-hunt-adders} \\
A Study of Some Flawed Adders \\

\noindent {\sf 07-gordon-interpreter}\cite{07-gordon-interpreter} \\
Defining a {LISP} Interpreter in a Logic of Total Functions \\

\noindent {\sf 07-eastlund-freshmen}\cite{07-eastlund-freshmen} \\
{ACL2} for Freshmen: First Experiences \\

\noindent {\sf 07-rimlinger-evolution}\cite{07-rimlinger-evolution} \\
Evolution from Debugging to Verification \\

\noindent {\sf 07-greve-heap}\cite{07-greve-heap} \\
Scalable Normalization for Heap Manipulating Functions \\

\noindent {\sf 07-ray-challenge}\cite{07-ray-challenge} \\
A Generalized Solution for the While Challenge \\

\noindent {\sf 07-sotes-hindley}\cite{07-sotes-hindley} \\
Proof Reusing: The Case of the {Hindley} Algorithm \\


\section{ACL2 Workshop 2009}

\noindent {\sf 09-sumners-simplifier}\cite{09-sumners-simplifier} \\
User Control and Direction of a More Efficient Simplifier in {ACL2} \\

\noindent {\sf 09-moore-instantiations}\cite{09-moore-instantiations} \\
Automatically Computing Functional Instantiations \\

\noindent {\sf 09-boyer-simulation}\cite{09-boyer-simulation} \\
Symbolic Simulation in {ACL2} \\

\noindent {\sf 09-liu-inequality}\cite{09-liu-inequality} \\
Proving A Specific Type Of Inequality Theorems in {ACL2}: a bind-free experience report \\

\noindent {\sf 09-page-curriculum}\cite{09-page-curriculum} \\
Computational Logic in the Undergraduate Curriculum \\

\noindent {\sf 09-eastlund-interactive}\cite{09-eastlund-interactive} \\
Automatic Verification for Interactive Graphical Programs \\

\noindent {\sf 09-eastlund-doublecheck}\cite{09-eastlund-doublecheck} \\
{DoubleCheck} Your Theorems \\

\noindent {\sf 09-garcia-dominguez-xmleye}\cite{09-garcia-dominguez-xmleye} \\
Hypertext Navigation of {ACL2} Proofs with {XMLEye} \\

\noindent {\sf 09-gamboa-inverse}\cite{09-gamboa-inverse} \\
Inverse Functions in {ACL2(r)} \\

\noindent {\sf 09-kaufmann-abbreviated}\cite{09-kaufmann-abbreviated} \\
Abbreviated Output for Input in {ACL2}: An Implementation Case Study \\

\noindent {\sf 09-ralston-avl}\cite{09-ralston-avl} \\
{ACL2}-Certified {AVL} Trees \\

\noindent {\sf 09-fraij-dags}\cite{09-fraij-dags} \\
Proof of Transitive Closure Property of Directed Acyclic Graphs \\

\noindent {\sf 09-cowles-solving}\cite{09-cowles-solving} \\
Solving $\triangle = \square$ \\

\noindent {\sf 09-kaufmann-labview}\cite{09-kaufmann-labview} \\
Formal Verification of {LabVIEW} Programs Using the {ACL2} Theorem Prover \\

\noindent {\sf 09-pierre-properties}\cite{09-pierre-properties} \\
{ACL2} for the Verification of Fault-Tolerance Properties: First Results \\

\noindent {\sf 09-hardin-stobjs}\cite{09-hardin-stobjs} \\
Efficient, Formally Verifiable Data Structures using {ACL2} Single-Threaded Objects for High-Assurance Systems \\

\noindent {\sf 09-rager-jfkr}\cite{09-rager-jfkr} \\
An Executable Model for Security Protocol {JFKr} \\

\noindent {\sf 09-greve-quantified}\cite{09-greve-quantified} \\
Automated Reasoning With Quantified Formulae \\

\noindent {\sf 09-greve-termination}\cite{09-greve-termination} \\
Assuming Termination \\

\noindent {\sf 09-van-der-broek-model}\cite{09-van-der-broek-model} \\
A Generic Implementation Model for the Formal Verification of Networks-on-Chips \\

\noindent {\sf 09-verbeek}\cite{09-verbeek} \\
Formal Validation of Deadlock Prevention in Networks-on-Chips \\


\section{ITP 2010}

\noindent {\sf 10-klein-what}\cite{10-klein-what} \\
A Formally Verified {OS} Kernel.  Now What? \\

\noindent {\sf 10-pierce-trenches}\cite{10-pierce-trenches} \\
Proof Assistants as Teaching Assistants: A View from the Trenches \\

\noindent {\sf 10-cachera-denotational}\cite{10-cachera-denotational} \\
A Certified Denotational Abstract Interpreter \\

\noindent {\sf 10-cowles-lebesgue}\cite{10-cowles-lebesgue} \\
Using a First Order Logic to Verify That Some Set of Reals Has No {Lebesgue} Measure \\

\noindent {\sf 10-huffman-nominal}\cite{10-huffman-nominal} \\
A New Foundation for Nominal {Isabelle} \\

\noindent {\sf 10-kumar-unification}\cite{10-kumar-unification} \\
(Nominal) Unification by Recursive Descent with Triangular Substitution \\

\noindent {\sf 10-verbeek-networks}\cite{10-verbeek-networks} \\
A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks \\

\noindent {\sf 10-armand-imperative}\cite{10-armand-imperative} \\
Extending {Coq} with Imperative Features and Its Application to {SAT} Verification \\

\noindent {\sf 10-autexier-declarative}\cite{10-autexier-declarative} \\
A Tactic Language for Declarative Proofs \\

\noindent {\sf 10-barthe-crypto}\cite{10-barthe-crypto} \\
Programming Language Techniques for Cryptographic Proofs \\

\noindent {\sf 10-blanchette-nitpick}\cite{10-blanchette-nitpick} \\
{Nitpick:} A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder \\

\noindent {\sf 10-boldo-wave}\cite{10-boldo-wave} \\
Formal Proof of a Wave Equation Resolution Scheme: The Method Error \\

\noindent {\sf 10-braibant-kleene}\cite{10-braibant-kleene} \\
An Efficient {Coq} Tactic for Deciding {Kleene} Algebras \\

\noindent {\sf 10-boehme-z3}\cite{10-boehme-z3} \\
Fast {LCF}-Style Proof Reconstruction for {Z3} \\

\noindent {\sf 10-chargueraud-combinator}\cite{10-chargueraud-combinator} \\
The Optimal Fixed Point Combinator \\

\noindent {\sf 10-dufourd-triangulation}\cite{10-dufourd-triangulation} \\
Formal Study of Plane {Delaunay} Triangulation \\

\noindent {\sf 10-felty-hoas}\cite{10-felty-hoas} \\
Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison \\

\noindent {\sf 10-fox-armv7}\cite{10-fox-armv7} \\
A Trustworthy Monadic Formalization of the {ARMv7} Instruction Set Architecture \\

\noindent {\sf 10-geuvers-safety}\cite{10-geuvers-safety} \\
Automated Machine-Checked Hybrid System Safety Proofs \\

\noindent {\sf 10-hendrix-coverset}\cite{10-hendrix-coverset} \\
Coverset Induction with Partiality and Subsorts: A Powerlist Case Study \\

\noindent {\sf 10-johansson-rippling}\cite{10-johansson-rippling} \\
Case-Analysis for Rippling and Inductive Proof \\

\noindent {\sf 10-keller-importing}\cite{10-keller-importing} \\
Importing {HOL Light} into {Coq} \\

\noindent {\sf 10-krauss-translation}\cite{10-krauss-translation} \\
A Mechanized Translation from Higher-Order Logic to Set Theory \\

\noindent {\sf 10-lammich-collections}\cite{10-lammich-collections} \\
The {Isabelle} Collections Framework \\

\noindent {\sf 10-manolios-termination}\cite{10-manolios-termination} \\
Interactive Termination Proofs Using Termination Cores \\

\noindent {\sf 10-mansky-optimizations}\cite{10-mansky-optimizations} \\
A Framework for Formal Verification of Compiler Optimizations \\

\noindent {\sf 10-mhamdi-integration}\cite{10-mhamdi-integration} \\
On the Formalization of the {Lebesgue} Integration Theory in {HOL} \\

\noindent {\sf 10-cohen-reduction}\cite{10-cohen-reduction} \\
From Total Store Order to Sequential Consistency: A Practical Reduction Theorem \\

\noindent {\sf 10-sozeau-equations}\cite{10-sozeau-equations} \\
{Equations:} A Dependent Pattern-Matching Compiler \\

\noindent {\sf 10-swords-conversion}\cite{10-swords-conversion} \\
A Mechanically Verified {AIG}-to-{BDD} Conversion Algorithm \\

\noindent {\sf 10-walukiewicz-chrzaszcz-consequences}\cite{10-walukiewicz-chrzaszcz-consequences} \\
Inductive Consequences in the {Calculus} of {Constructions} \\

\noindent {\sf 10-weber-qbf}\cite{10-weber-qbf} \\
Validating {QBF} Invalidity in {HOL4} \\

\noindent {\sf 10-howe-hoas}\cite{10-howe-hoas} \\
Higher-Order Abstract Syntax in {Isabelle/HOL} \\

\noindent {\sf 10-myreen-separation}\cite{10-myreen-separation} \\
Separation Logic Adapted for Proofs by Rewriting \\

\noindent {\sf 10-spitters-hierarchy}\cite{10-spitters-hierarchy} \\
Developing the Algebraic Hierarchy with Type Classes in {Coq} \\


\section{ACL2 Workshop 2011}

\noindent {\sf 11-chamarthi-testing}\cite{11-chamarthi-testing} \\
Integrating Testing and Interactive Theorem Proving \\

\noindent {\sf 11-cowles-sierpinski}\cite{11-cowles-sierpinski} \\
Verifying {Sierpi\'nski} and {Riesel} Numbers in {ACL2} \\

\noindent {\sf 11-dahlin-hypervisor}\cite{11-dahlin-hypervisor} \\
Toward the Verification of a Simple Hypervisor \\

\noindent {\sf 11-kaufmann-enhancements}\cite{11-kaufmann-enhancements} \\
How Can I Do That with {ACL2}?  Recent Enhancements to {ACL2} \\

\noindent {\sf 11-reid-differentiator}\cite{11-reid-differentiator} \\
Implementing an Automatic Differentiator in {ACL2} \\

\noindent {\sf 11-seidel-fp}\cite{11-seidel-fp} \\
Formal Verification of an Iterative Low-Power {x86} Floating-Point Multiplier with Redundant Feedback \\

\noindent {\sf 11-swords-blasting}\cite{11-swords-blasting} \\
Bit-Blasting {ACL2} Theorems \\

\noindent {\sf 11-verbeek-deadlock}\cite{11-verbeek-deadlock} \\
Formal verification of a deadlock detection algorithm \\


\section{ACL2 Workshop 2013}

\noindent {\sf 13-davis-embedding}\cite{13-davis-embedding} \\
Embedding {ACL2} Models in End-User Applications \\

\noindent {\sf 13-kaufmann-enhancements}\cite{13-kaufmann-enhancements} \\
Enhancements to {ACL2} in Versions 5.0, 6.0, and 6.1 \\

\noindent {\sf 13-eggensperger}\cite{13-eggensperger} \\
{Proof Pad}: A New Development Environment for {ACL2} \\

\noindent {\sf 13-joosten}\cite{13-joosten} \\
A Macro for Reusing Abstract Functions and Theorems \\

\noindent {\sf 13-greve-partial}\cite{13-greve-partial} \\
A Step-Indexing Approach to Partial Functions \\

\noindent {\sf 13-goel-absstobj}\cite{13-goel-absstobj} \\
Abstract Stobjs and Their Application to {ISA} Modeling \\

\noindent {\sf 13-verbeek-async}\cite{13-verbeek-async} \\
Verification of Building Blocks for Asynchronous Circuits \\

\noindent {\sf 13-helms-quantum}\cite{13-helms-quantum} \\
An Interpreter for Quantum Circuits \\

\noindent {\sf 13-davis-aig}\cite{13-davis-aig} \\
Verified {AIG} Algorithms in {ACL2} \\

\noindent {\sf 13-van-gastel-xmas}\cite{13-van-gastel-xmas} \\
A formalisation of {XMAS} \\

\noindent {\sf 13-hardin-cuda}\cite{13-hardin-cuda} \\
{ACL2} Meets the {GPU}: Formalizing a {CUDA}-based Parallelizable All-Pairs Shortest Path Algorithm in {ACL2} \\


\section{ACL2 Workshop 2014}

\noindent {\sf 14-kaufmann-enhancements}\cite{14-kaufmann-enhancements} \\
Enhancements to {ACL2} in Versions 6.2, 6.3, and 6.4 \\

\noindent {\sf 14-davis-xdoc}\cite{14-davis-xdoc} \\
Industrial-Strength Documentation for {ACL2} \\

\noindent {\sf 14-chamarthi-defdata}\cite{14-chamarthi-defdata} \\
Data Definitions in the {ACL2 Sedan} \\

\noindent {\sf 14-selfridge-polymorphic}\cite{14-selfridge-polymorphic} \\
Polymorphic Types in {ACL2} \\

\noindent {\sf 14-heras-ml}\cite{14-heras-ml} \\
{ACL2(ml)}: Machine-Learning for {ACL2} \\

\noindent {\sf 14-joosten-tptp}\cite{14-joosten-tptp} \\
Initial Experiments with {TPTP}-style Automated Theorem Provers on {ACL2} Problems \\

\noindent {\sf 14-gamboa-economics}\cite{14-gamboa-economics} \\
On {Vickrey}'s Theorem and the Use of {ACL2} for Formal Reasoning in Economics \\

\noindent {\sf 14-cowles-equivalence}\cite{14-cowles-equivalence} \\
Equivalence of the Traditional and Non-Standard Definitions of Concepts from Real Analysis \\

\noindent {\sf 14-gamboa-arctangent}\cite{14-gamboa-arctangent} \\
Formal Verification of {Medina}'s Sequence of Polynomials for Approximating Arctangent \\

\noindent {\sf 14-puri-pipelining}\cite{14-puri-pipelining} \\
Using {ACL2} to Verify Loop Pipelining in Behavioral Synthesis \\

\noindent {\sf 14-selfridge}\cite{14-selfridge} \\
An {ACL2} Mechanization of an Axiomatic Framework for Weak Memory \\

\noindent {\sf 14-oleary-systemc}\cite{14-oleary-systemc} \\
Modeling Algorithms in {SystemC} and {ACL2} \\

\noindent {\sf 14-hardin-llvm}\cite{14-hardin-llvm} \\
Development of a Translator from {LLVM} to {ACL2} \\


\section{ACL2 Workshop 2015}

\noindent {\sf 15-rager-fp}\cite{15-rager-fp} \\
A Brief Introduction to {Oracle}'s Use of {ACL2} in Verifying Floating-point and Integer Arithmetic \\

\noindent {\sf 15-swords-fty}\cite{15-swords-fty} \\
Fix Your Types \\

\noindent {\sf 15-coglio-soft}\cite{15-coglio-soft} \\
Second-Order Functions and Theorems in {ACL2} \\

\noindent {\sf 15-chau-fourier}\cite{15-chau-fourier} \\
{Fourier} Series Formalization in {ACL2(r)} \\

\noindent {\sf 15-cowles-perfect}\cite{15-cowles-perfect} \\
Perfect Numbers in {ACL2} \\

\noindent {\sf 15-peng-smt}\cite{15-peng-smt} \\
Extending {ACL2} with {SMT} Solvers \\

\noindent {\sf 15-hardin-llvm}\cite{15-hardin-llvm} \\
Reasoning about {LLVM} Code Using {Codewalker} \\

\noindent {\sf 15-moore-stateman}\cite{15-moore-stateman} \\
{Stateman}: Using Metafunctions to Manage Large Terms Representing Machine States \\

\noindent {\sf 15-jain-refinement}\cite{15-jain-refinement} \\
Proving Skipping Refinement with {ACL2s} \\


\section{ACL2 Workshop 2017}

\noindent {\sf 17-goel-x86isa}\cite{17-goel-x86isa} \\
The {x86isa} Books: Features, Usage, and Future Plans \\

\noindent {\sf 17-cowles-construction}\cite{17-cowles-construction} \\
The {Cayley-Dickson} Construction in {ACL2} \\

\noindent {\sf 17-russinoff-surveyable}\cite{17-russinoff-surveyable} \\
A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve \\

\noindent {\sf 17-kaufmann-meta}\cite{17-kaufmann-meta} \\
Meta-extract: Using Existing Facts in Meta-reasoning \\

\noindent {\sf 17-coglio-simplify}\cite{17-coglio-simplify} \\
A Versatile, Sound Tool for Simplifying Definitions \\

\noindent {\sf 17-sumners-refinement}\cite{17-sumners-refinement} \\
Proof Reduction of Fair Stuttering Refinement of Asynchronous Systems and Applications \\

\noindent {\sf 17-swords-blasting}\cite{17-swords-blasting} \\
Term-Level Reasoning in Support of Bit-blasting \\

\noindent {\sf 17-chau-de}\cite{17-chau-de} \\
Formal Specification and Verification of the {FM9001} Microprocessor Using the {DE} System \\


\bibliographystyle{plain}
\bibliography{workshops}


\end{document}
