ACL2s: “the ACL2 sedan” ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM software system award. In the hands of experts it feels like a finely tuned race car, and it has been used to prove some of the most complex theorems ever proved about commercially designed systems. Unfortunately, ACL2 has a steep learning curve. Thus, novices tend have a very different experience: they crash and burn. As part of a project to make ACL2 and formal reasoning safe for the masses, we have developed ACL2s, the ACL2 sedan. ACL2s includes many features for streamlining the learning process that are not found in ACL2. In general, the goal is to develop a tool that is “self-teaching,” i.e., it should be possible for an undergraduate to sit down and play with it and learn how to program in ACL2 and how to reason about the programs she writes.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Claessen, Koen; Johansson, Moa; Rosén, Dan; Smallbone, Nicholas: Automating inductive proofs using theory exploration (2013)
- Leino, K.Rustan M.: Automating induction with an SMT solver (2012)
- Sonnex, William; Drossopoulou, Sophia; Eisenbach, Susan: Zeno: an automated prover for properties of recursive data structures (2012)
- Chamarthi, Harsh Raju; Dillinger, Peter; Manolios, Panagiotis; Vroon, Daron: The ACL2 Sedan theorem proving system (2011)
- Manolios, Panagiotis; Vroon, Daron: Interactive termination proofs using termination cores (2010)
- Owens, Scott; Slind, Konrad: Adapting functional programs to higher order logic (2008)
- Dillinger, Peter C.; Manolios, Panagiotis; Vroon, Daron; Moore, J Strother: ACL2s: “the ACL2 sedan” (2007)