Transacted Memory for Smart Cards
A transacted memory that is implemented using EEPROM technology offers persistence, undoability and auditing. The transacted memory system is formally specified in Z, and refined in two steps to a prototype C implementation / SPIN model. Conclusions are offered both on the transacted memory system itself and on the development process involving multiple notations and tools.
KeywordsInformation Sequence Current Generation Smart Card Spin Model Memory Manager
Unable to display preview. Download preview PDF.
- 2.M. J. Butler, P. H. Hartel, E. K. de Jong, and M. Longley. Applying formal methods to the design of smart card software. Declarative Systems & Software Engineering Technical Reports DSSE-TR-97-8, University of Southampton, 1997.Google Scholar
- 3.E. K. de Jong and J. Bos. Arrangements for storing different versions of a set of data in separate memory areas and method for updating a set of data in a memory. Dutch Patent Application, 2000.Google Scholar
- 4.D. Donsez, G. Grimaud, and S. Lecomte. Recoverable persistant memory of smart-card. In J.-J. Quisquater and B. Schneier, editors, 3rd Int. Conf. Smart card research and advanced application (CARDIS), LNCS 1820, page to appear, Louvain la Neuve, Belgium, Sep 1998. Springer-Verlag, Berlin.Google Scholar
- 5.P. Hartel, M. Butler, A. Currie, P. Henderson, M. Leuschel, A. Martin, A. Smith, U. Ultes-Nitsche, and B. Walters. Questions and answers about ten formal methods. In S. Gnesi and D. Latella, editors, 4th Int. Workshop on Formal Methods for Industrial Critical Systems, Vol II, pages 179–203, Trento, Italy, Jul 1999. ERCIM/CNR, Pisa, Italy.Google Scholar
- 7.P. H. Hartel and E. K. de Jong Frz. Towards testability in smart card operating system design. In V. Cordonnier and J.-J. Quisquater, editors, 1st Int. Conf. Smart card research and advanced application (CARDIS), pages 73–88, Lille France, Oct 1994. Univ. de Lille, France.Google Scholar
- 8.M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for Lock-Free data structures. In Int. Symp. in Computer Architecture (ICSA), pages 289–300, San Diego, California, May 1993. Computer Architecture News, 21(2).Google Scholar
- 9.G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs, New Jersey, 1991.Google Scholar
- 10.Xiaoping Jia. ZTC: A Type Checker for Z-User’s Guide. Dept. of Comp. and Inf. Sci, DePaul Univ., Chicago, Illinois, May 1995.Google Scholar
- 11.S. M. Nettles and J. M. Wing. Persistence+undoability=transactions. In 25th Hawaii International Conference on System Sciences (HICS), pages 832-43. IEEE Comput. Soc. Press., Los Alamitos, California, 1991.Google Scholar
- 12.National Institute of Standards and Technology. Common Criteria for Information Technology Security Evaluation. U. S. Dept. of Commerce, National Bureau of Standards and Technology, Aug 1999.Google Scholar
- 13.D. Sabatier and P. Lartigue. The use of the B formal method for the design and the validaion of the transaction mechanism for smart card applications. In J. M. Wing, J. Woodcock, and J. Davies, editors, World Congress on Formal Methods in the Development of Computing Systems (FM), LNCS 1708, pages 348–368, Toulouse, France, Sep 1999. Springer-Verlag, Berlin.Google Scholar
- 14.Sun. Java Card 2.1 Runtime Environment (JCRE) Specification. Sun Micro systems Inc, Palo Alto, California, Jun 1999.Google Scholar