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.

[1]  Bernhard Beckert,et al.  Free Variable Tableaux for Propositional Modal Logics , 1997, TABLEAUX.

[2]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[3]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[4]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[5]  Rajeev Goré,et al.  A Labelled Sequent System for Tense Logic Kt , 1998, Australian Joint Conference on Artificial Intelligence.