{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:50:54Z","timestamp":1725511854209},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797067"},{"type":"electronic","value":"9783540797074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79707-4_10","type":"book-chapter","created":{"date-parts":[[2008,5,7]],"date-time":"2008-05-07T02:37:44Z","timestamp":1210127864000},"page":"115-132","source":"Crossref","is-referenced-by-count":2,"title":["Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization"],"prefix":"10.1007","author":[{"given":"Leonard","family":"Lensink","sequence":"first","affiliation":[]},{"given":"Sjaak","family":"Smetsers","sequence":"additional","affiliation":[]},{"given":"Marko","family":"van Eekelen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-40903-8_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"B. Gebremichael","year":"2004","unstructured":"Gebremichael, B., Vaandrager, F.W.: Control synthesis for a smart card personalization system using symbolic model checking. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol.\u00a02791, pp. 189\u2013203. Springer, Heidelberg (2004)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/11495628_2","volume-title":"Scenarios: Models, Transformations and Tools","author":"D. Harel","year":"2005","unstructured":"Harel, D., Kugler, H., Weiss, G.: Some methodological observations resulting from experience using lscs and the play-in\/play-out approach. In: Leue, S., Syst\u00e4, T.J. (eds.) Scenarios: Models, Transformations and Tools. LNCS, vol.\u00a03466, pp. 26\u201342. Springer, Heidelberg (2005)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00165-006-0013-4","volume":"19","author":"B. Jacobs","year":"2007","unstructured":"Jacobs, B., Smetsers, S., Schreur, R.W.: Code-carrying theories. Formal Aspects of Computing\u00a019(2), 191\u2013203 (2007)","journal-title":"Formal Aspects of Computing"},{"key":"10_CR4","unstructured":"Mader, A.H.: Deriving schedules for a smart card personalisation system. Technical Report TR-CTIT-04-05, University of Twente, Enschede (January 2004)"},{"key":"10_CR5","unstructured":"Mu\u00f1oz, C.: Rapid prototyping in PVS. Report NIA Report No. 2003-03, NASA\/CR-2003-212418, NIA-NASA Langley, National Institute of Aerospace, Hampton, VA (May 2003)"},{"key":"10_CR6","unstructured":"Nieberg, T.: On cyclic plans for scheduling a smart card personalisation system. Technical Report TR-CTIT-04-01, Centre for Telematics and Information Technology, University of Twente, Enschede (January 2004)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1007\/3-540-55602-8_217","volume-title":"Automated Deduction - CADE-11","author":"S. Owre","year":"1992","unstructured":"Owre, S., Rushby, J.M., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 748\u2013752. Springer, Heidelberg (1992)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-60045-0_42","volume-title":"Computer Aided Verification","author":"S. Rajan","year":"1995","unstructured":"Rajan, S., Shankar, N., Srivas, M.K.: An integration of model-checking with automated proof checking. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 84\u201397. Springer, Heidelberg (1995)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44829-2_1","volume-title":"Model Checking Software","author":"T.C. Ruys","year":"2003","unstructured":"Ruys, T.C.: Optimal scheduling using branch and bound with spin 4.0. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 1\u201317. Springer, Heidelberg (2003)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BFb0055152","volume-title":"Theorem Proving in Higher Order Logics","author":"F. Henke von","year":"1998","unstructured":"von Henke, F., Pfab, S., Pfeifer, H., Rue\u00df, H.: Case studies in meta-level theorem proving. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 461\u2013478. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79707-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T16:16:54Z","timestamp":1551457014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79707-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540797067","9783540797074"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79707-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}