The following pages link to ACL2 (Q12833):
Displayed 50 items.
- Intelligent computer mathematics. 16th symposium, Calculemus 2009, 8th international conference, MKM 2009, held as part of CICM 2009, Grand Bend, Canada, July 6--12, 2009. Proceedings (Q1028781) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- A verified common lisp implementation of Buchberger's algorithm in ACL2 (Q1034553) (← links)
- Inductive proof search modulo (Q1037404) (← links)
- Proof assistants: history, ideas and future (Q1040001) (← links)
- Operating system verification---an overview (Q1040002) (← links)
- Partial functions in ACL2 (Q1425160) (← links)
- Structured theory development for a mechanized logic (Q1595929) (← links)
- Proof assistance for real-time systems using an interactive theorem prover (Q1603708) (← links)
- Verification of FM9801: An out-of-order microprocessor model with speculative execution, exceptions, and program-modifying capability (Q1604726) (← links)
- On the desirability of mechanizing calculational proofs (Q1607098) (← links)
- Formal proofs about rewriting using ACL2 (Q1610218) (← links)
- Iterated ultrapowers for the masses (Q1661675) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- The formalization of discrete Fourier transform in HOL (Q1666338) (← links)
- An elementary proof of the group law for elliptic curves (Q1676248) (← links)
- Superposition with structural induction (Q1687553) (← links)
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- Using abstract stobjs in ACL2 to compute matrix normal forms (Q1687754) (← links)
- Gauge integral (Q1688749) (← links)
- Reasoning about algebraic data types with abstractions (Q1694026) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- HOL Light QE (Q1791161) (← links)
- Verification of Year 2000 conversion rules using the ACL2 theorem prover (Q1856141) (← links)
- An experiment concerning mathematical proofs on computers with French undergraduate students (Q1884267) (← links)
- Formalization of a normalization theorem in simplicial topology (Q1926582) (← links)
- Principles of proof scores in CafeOBJ (Q1929233) (← links)
- Quantitative verification of Kalman filters (Q1982642) (← links)
- A graph library for Isabelle (Q2018659) (← links)
- Coquelicot: a user-friendly library of real analysis for Coq (Q2018661) (← links)
- Formalization of Euler-Lagrange equation set based on variational calculus in HOL light (Q2031406) (← links)
- An Isabelle/HOL formalisation of the SPARC instruction set architecture and the TSO memory model (Q2031429) (← links)
- Separation logic-based verification atop a binary-compatible filesystem model (Q2038034) (← links)
- A formalization of the Smith normal form in higher-order logic (Q2102950) (← links)
- Deadlock in packet switching networks (Q2145272) (← links)
- Scaling up livelock verification for network-on-chip routing algorithms (Q2152663) (← links)
- Varieties of regular semigroups with uniquely defined inversion (Q2178386) (← links)
- Automated and scalable verification of integer multipliers (Q2225123) (← links)
- Interactive theorem proving. Second international conference, ITP 2011, Berg en Dal, The Netherlands, August 22--25, 2011. Proceedings (Q2276054) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- Lemma discovery for induction. A survey (Q2287904) (← links)
- Inspection and selection of representations (Q2287916) (← links)
- Limited second-order functionality in a first-order setting (Q2303245) (← links)
- Formalization of geometric algebra in HOL Light (Q2323452) (← links)
- A verified compiler from Isabelle/HOL to CakeML (Q2324018) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Modelling algebraic structures and morphisms in ACL2 (Q2349534) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)