{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:37:33Z","timestamp":1725557853245},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201267"},{"type":"electronic","value":"9783540398783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39878-3_12","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T18:39:03Z","timestamp":1277318343000},"page":"144-158","source":"Crossref","is-referenced-by-count":0,"title":["Software Tamper Resistance Using Program Certificates"],"prefix":"10.1007","author":[{"given":"Hongxia","family":"Jin","sequence":"first","affiliation":[]},{"given":"Gregory F.","family":"Sullivan","sequence":"additional","affiliation":[]},{"given":"Gerald M.","family":"Masson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bright, J., Sullivan, G.F., Masson, G.M.: A Formally Verified Sorting Certifier. IEEE Trans. Computers\u00a046 (1997)","DOI":"10.1109\/12.641931"},{"key":"12_CR2","unstructured":"Jin, H., Sullivan, G.F., Masson, G.M.: Approximate correctness checking of computational results. IEEE Transaction on Reliability, 338\u2013350"},{"key":"12_CR3","first-page":"3","volume-title":"Digest of the 1978 Fault Tolerant Computing Symposium","author":"L. Chen","year":"1978","unstructured":"Chen, L., Avizienis, A.: N-version programming: a fault tolerant approach to reliability of software operation. In: Chen, L., Avizienis, A. (eds.) Digest of the 1978 Fault Tolerant Computing Symposium, pp. 3\u20139. IEEE Computer Society Press, Los Alamitos (1978)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MC.1984.1659219","volume":"17","author":"A. Avizienis","year":"1984","unstructured":"Avizienis, A., Kelly, J.: Fault tolerance by design diversity: concepts and experiments. Computer\u00a017, 67\u201380 (1984)","journal-title":"Computer"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1109\/TSE.1985.231893","volume":"11","author":"A. Avizienis","year":"1985","unstructured":"Avizienis, A.: The N-version approach to fault tolerant software. IEEE Trans. on Software Engineering\u00a011, 1491\u20131501 (1985)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"12_CR6","volume-title":"Fault tolerance: principles and practices","author":"T. Anderson","year":"1981","unstructured":"Anderson, T., Lee, P.: Fault tolerance: principles and practices. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"12_CR7","first-page":"86","volume-title":"Proceedings of the 1989 ACM Symposium on Theory of Computing","author":"M. Blum","year":"1989","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. In: Proceedings of the 1989 ACM Symposium on Theory of Computing, pp. 86\u201397. ACM Press, New York (1989)"},{"key":"#cr-split#-12_CR8.1","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: Designing Programs that Check Their Work. Journal of ACM\u00a042(1), 269\u2013291 (1995);","DOI":"10.1145\/200836.200880"},{"key":"#cr-split#-12_CR8.2","unstructured":"In: Proceedings of the 1989 ACM Symposium on Theory of Computing, pp. 86\u201397. ACM Press, New York (1989)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-Testing\/Correcting with Applications to Numerical Problems. In: Proc. 22 ACM Symp. of Theory of Computing, pp. 73\u201383 (1990)","DOI":"10.1145\/100216.100225"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Coherent Functions and Program Checkers. In: Proc. 22 ACM Symp. of Theory of Computing, pp. 84\u201394 (1990)","DOI":"10.1145\/100216.100226"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the Correctness of Memories. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 90\u201399 (1991)","DOI":"10.1109\/SFCS.1991.185352"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking Computations in Polylogarithmic Time. In: Proc. 23 ACM Symp. of Theory of Computing, pp. 21\u201331","DOI":"10.1145\/103418.103428"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Wigderson, A.: Self-Testing\/Correcting for Polynomials and for Approximate Functions. In: Proc. 23 ACM Symp. of Theory of Computing, pp. 32\u201342","DOI":"10.1145\/103418.103429"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. J. ACM, 690\u2013715 (October 1979)","DOI":"10.1145\/322154.322161"},{"key":"12_CR15","volume-title":"The theory and practice of reliable design","author":"D. Siewiorek","year":"1982","unstructured":"Siewiorek, D., Swarz, R.: The theory and practice of reliable design. Digital Press, Bedford (1982)"},{"key":"12_CR16","volume-title":"Design and analysis of fault tolerant digital systems","author":"B. Johnson","year":"1989","unstructured":"Johnson, B.: Design and analysis of fault tolerant digital systems. Addison-Wesley, Reading (1989)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/12.494097","volume":"45","author":"M. Blum","year":"1996","unstructured":"Blum, M., Wasserman, H.: Reflections on the pentium bug. IEEE Trans. Computers\u00a045, 385\u2013394\u2013847 (1996)","journal-title":"IEEE Trans. Computers"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Blum, M., Wasserman, H.: Program result checking: a theory of testing meets a test of theory. In: Proceedings of 35th Foundations of Computer Science Conference, pp. 382\u2013392 (1994)","DOI":"10.1109\/SFCS.1994.365678"},{"key":"12_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM \u2013 parallel virtual machine: a users\u2019 guide and tutorial for networked parallel computing","author":"A. Geist","year":"1994","unstructured":"Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM \u2013 parallel virtual machine: a users\u2019 guide and tutorial for networked parallel computing. M.I.T. Press, Cambridge (1994)"},{"key":"12_CR20","volume-title":"How to write parallel program: a first course","author":"N. Carriero","year":"1992","unstructured":"Carriero, N., Gelernter, D.: How to write parallel program: a first course. M.I.T. Press, Cambridge (1992)"},{"key":"12_CR21","volume-title":"Using MPI: portable parallel programming with the message passing interface","author":"W. Gropp","year":"1994","unstructured":"Gropp, W., Lusk, E., Skjellum, A.: Using MPI: portable parallel programming with the message passing interface. M.I.T. Press, Cambridge (1994)"},{"key":"12_CR22","first-page":"133","volume-title":"The Ecology of Computation","author":"M. Miller","year":"1988","unstructured":"Miller, M., Drexler, K.: Markets and Computation: Agoric Open Systems. In: Huberman, B.A. (ed.) The Ecology of Computation, pp. 133\u2013205. North-Holland, Amsterdam (1988)"},{"key":"12_CR23","volume-title":"The Traveling Salesman Problem","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. John Wiley and Sons Ltd., Chichester (1985)"},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/212066.212081","volume":"21","author":"G. Carpaneto","year":"1995","unstructured":"Carpaneto, G., DellAmico, M., Toth, P.: Exact Solution of Large-Scale Asymmetric Traveling Salesman Problems. ACM Transactions on Mathematical Software\u00a021(4), 394\u2013409 (1995)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"12_CR25","volume-title":"Discrete Optimization Algorithms : with Pascal Programs","author":"M.M. Syslo","year":"1983","unstructured":"Syslo, M.M., Deo, N., Kowalik, J.S.: Discrete Optimization Algorithms: with Pascal Programs. Prentice-Hall, Englewood Cliffs (1983)"},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/214392.214397","volume":"11","author":"S. Martello","year":"1985","unstructured":"Martello, S., Toth, P.: Algorithm 632: A Program for the 0\u20131 Multiple Knapsack Problem. ACM Transactions on Mathematical Software\u00a011(2), 135\u2013140 (1985)","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Lecture Notes in Computer Science","Computer Safety, Reliability, and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39878-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T19:56:36Z","timestamp":1552593396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39878-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201267","9783540398783"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39878-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}