Abstract
We present the first implementation of a theorem prover running 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 prepositional 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.
Preview
Unable to display preview. Download preview PDF.
References
G Necula and P Lee. Proof carrying code. Technical Report CMU-CS-96-165, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, September 1996.
Bernhard Beckert and Joachim Posegga. IeanTAP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339–358, 1995.
Schlumberger Inc. Cyberflex. http://www.cyberflex.austin.et.slb.com, 1997.
JavaSoft Inc. Javacard API. http://www.javasoft.com/products/javacard/, 1997.
Francis J. Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191–216, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goré, R., Posegga, J., Slater, A., Vogt, H. (1998). System description: CardTAP: The first theorem prover on a smart card. In: Kirchner, C., Kirchner, H. (eds) Automated Deduction — CADE-15. CADE 1998. Lecture Notes in Computer Science, vol 1421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054246
Download citation
DOI: https://doi.org/10.1007/BFb0054246
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64675-4
Online ISBN: 978-3-540-69110-5
eBook Packages: Springer Book Archive