cardTAP: Automated deduction on a smart card
We present the first implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited resources available on current smart cards, the prover is restricted to propositional classical logic. It can be easily extended to full first-order logic. The potential applications for our prover lie within the context of security related functions based on trusted devices such as smart cards.
Keywordsautomated deduction tableaux lean TAP security java proof carrying code
Unable to display preview. Download preview PDF.
- 1.George Necula and Peter Lee. Proof carrying code. Technical Report CMU-CS-96-165, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, September 1996.Google Scholar
- 4.Melvin Fitting. First Order Logic and Automated Theorem Proving. Springer-Verlag, 1990.Google Scholar
- 5.Jean H. Gallier. Logic for Computer Science: Foundations of Automatic Theorem Proving. John Wiley and Sons, 1987.Google Scholar
- 6.Schlumberger Inc. Cyberflex. http://www.cyberflex.austin.et.slb.com, 1997.Google Scholar
- 7.JavaSoft Inc. Javacard API. http://www.javasoft.com/products/javacard/, 1997.Google Scholar
- 9.Bernhard Beckert an Drajeev Goré. Free variable tableaux for propositional model logics. In D Galmich, editor, Proceedings of the International Conference on Theorem Proving with Analytic Tableaux and Related Methods, volume Lecture Notes in Artificial Intelligence of LNCS, pages 91–106. Springer, May 1997.Google Scholar
- 10.Nicolette Bonnette and Rajeev Goré. A labelled sequent system for tense logic K t. In These proceedings, 1998.Google Scholar