View: session overviewtalk overviewside by side with other conferences

09:10 | Invited Talk: Lessons Learned over 45 Years in Theorem Proving SPEAKER: J Strother Moore |

10:10 | A Brief Introduction to Oracleâ€™s Use of ACL2 SPEAKER: unknown ABSTRACT. Oracle has used ACL2 in hardware verification. We have authored a two-page extended abstract that introduces the ACL2 community to these uses. |

11:00 | Fix Your Types: A Datatype Definition Library for Unconditional Type Reasoning SPEAKER: unknown ABSTRACT. When using existing ACL2 datatype frameworks, many theorems require type hypotheses. These hypotheses slow down the theorem prover, are tedious to write, and are easy to forget. We describe a principled approach to types that provides strong type safety and execution efficiency while avoiding type hypotheses, and we present a library that automates this approach. Using this approach, types help you catch programming errors and then get out of the way of theorem proving. |

11:30 | Second-Order Functions and Theorems in ACL2 SPEAKER: Alessandro Coglio ABSTRACT. SOFT ('Second Order Functions and Theorems') is a tool to mimic second-order functions and theorems in the first-order logic of ACL2. Second-order functions are mimicked by first-order functions that reference explicitly designated uninterpreted functions that mimic function variables. First-order theorems over these second-order functions mimic second-order theorems universally quantified over function variables. Instances of second-order functions and theorems are systematically generated by substituting function variables with functions; theorem instances are automatically proved via ACL2's functional instantiation mechanism. Second-order functions and theorems can be used in program refinement. |

12:00 | R1 SPEAKER: Rump Session |

Panelists: Jo Ebergen, Oracle

David Hardin, Rockwell Collins;

David Russinoff, Intel;

Rob Sumners, AMD;

Sol Swords, Centaur

15:00 | Fourier Series Formalization in ACL2(r) SPEAKER: unknown ABSTRACT. We formalize some basic properties of Fourier series in the logic of ACL2(r), which is a variant of ACL2 that supports reasoning about the real and complex numbers by way of non-standard analysis. More specifically, we extend a framework for formally evaluating definite integrals of real-valued, continuous functions using the Second Fundamental Theorem of Calculus. Our extended framework is also applied to functions containing free arguments. Using this framework, we are able to prove the orthogonality relationships between trigonometric functions, which are the essential properties in Fourier series analysis. The sum rule for definite integrals of indexed sums is also formalized by applying the extended framework along with the First Fundamental Theorem of Calculus and the sum rule for differentiation. The Fourier coefficient formulas of periodic functions are then formalized from the orthogonality relations and the sum rule for integration. Consequently, the uniqueness of Fourier sums is a straightforward corollary. We also present our formalization of the sum rule for definite integrals of infinite series in ACL2(r). Part of this task is to prove the Dini Uniform Convergence Theorem and the continuity of a limit function under certain conditions. A key technique in our proofs of these theorems is to apply the overspill principle from non-standard analysis. |

15:30 | Perfect Numbers in ACL2 SPEAKER: unknown ABSTRACT. A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1+2+3 is perfect, but 12 != 1+2+3+4+6 is not perfect. An ACL2 theory of perfect numbers is developed and used to prove, in ACL2(r), this bit of mathematical folklore: Even if there are infinitely many perfect numbers, the series of the reciprocals of all perfect numbers converges. |

16:00 | R2 SPEAKER: Rump Session |

16:45 | R3 SPEAKER: Rump Session |