{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:59Z","timestamp":1775053499468,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540426622","type":"print"},{"value":"9783540454397","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45439-x_10","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T17:44:53Z","timestamp":1185039893000},"page":"144-155","source":"Crossref","is-referenced-by-count":46,"title":["An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs"],"prefix":"10.1007","author":[{"given":"Stanley","family":"Chow","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Harold","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Vladimir A.","family":"Zakharov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E.F. Brickell","year":"1991","unstructured":"Brickell E.F., Davenport D.M. On the classification of ideal secret sharing schemes. J. Cryptology, 4, 1991, p.123\u2013134.","journal-title":"J. Cryptology"},{"key":"10_CR2","unstructured":"Chow S., Johnson H., and Gu Y., Tamper resistant software \u2014 control flow encoding. Filed under the Patent Co\u00f6peration Treaty on August 18, 2000, under Serial No. PCT\/CA00\/00943."},{"key":"10_CR3","unstructured":"Collberg C., Thomborson C., Low D., A taxonomy of obfuscating transformations, Tech. Report, N 148, Dept. of Computer Science, Univ. of Auckland, 1997."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Collberg C., Thomborson C., Low D., Manufacturing cheap, resilient and stealthy opaque constructs, Symp. on Principles of Prog. Lang., 1998, p.184\u2013196.","DOI":"10.1145\/268946.268962"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Collberg C., Thomborson C., Low D. Breaking abstraction and unstructuring data structures, in IEEE Int. Conf. on Computer Languages, 1998, p.28\u201338.","DOI":"10.1109\/ICCL.1998.674154"},{"key":"10_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S., Computers and Intractability, W.H Freeman and Co., San Francisco, 1979."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Glenn A., Larus J., Improving Data-Flow Analysis with Path Profilers. In Proc. of the SIGPLAN \u201998 Conf. on Prog. Lang. Design and Implementation, Montreal, Canada, published as SIGPLAN Notices, SIGPLAN Notices, N 5, 1998, pp. 72\u201384.","DOI":"10.1145\/277652.277665"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/239912.239913","volume":"19","author":"S. Horowitz","year":"1997","unstructured":"Horowitz S., Precise flow-insensitive May-Alias analysis is NP-hard, TOPLAS, 1997, 19, N 1, p.1\u20136.","journal-title":"TOPLAS"},{"key":"10_CR9","unstructured":"Jalali M., Hachez G., Vasserot C. FILIGRANE (Flexible IPR for Software AGent ReliANcE) A security framework for trading of mobile code in Internet, in Autonomous Agents 2000 Workshop: Agents in Industry, 2000."},{"issue":"5","key":"10_CR10","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1145\/322003.322016","volume":"24","author":"N.D. Jones","year":"1977","unstructured":"Jones N.D., Muchnik S.S. Even simple programs are hard for analysis, J. Assoc. Comput. Mach., 1977, 24 N 5, p.338\u2013350.","journal-title":"J. Assoc. Comput. Mach."},{"key":"10_CR11","first-page":"5","volume-title":"Program Flow Analysis: Theory and Applications","author":"K. Kennedy","year":"1981","unstructured":"Kennedy K., A Survey of Data Flow Analysis Techniques, in Program Flow Analysis: Theory and Applications, S.S. Muchnick and N.D. Jones (eds.). Prentice-Hall, Englewood Cliffs, NJ, 1981, pp. 5\u201354."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Kozen D., Automata and Computability, Springer, 1997.","DOI":"10.1007\/978-1-4612-1844-9"},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/773473.178256","volume":"29","author":"J. Knoop","year":"1994","unstructured":"Knoop J., Ruthing O., Steffen B., Partial Dead Code Elimination, in Proc. of the SIGPLAN \u201994 Conf. on Prog. Lang. Design and Implementation, Orlando, FL, published as SIGPLAN Notices, 29, N 6, June 1994, pp. 147\u2013158.","journal-title":"SIGPLAN Notices"},{"key":"10_CR14","volume-title":"Theory of program schemata","author":"V.E. Kotov","year":"1991","unstructured":"Kotov V.E., Sabelfeld V.K., Theory of program schemata, M.: Nauka, 1991, 246 p. (in Russian)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S.Y. Kuroda","year":"1964","unstructured":"Kuroda S.Y., Classes of languages and linear bounded automata, Information and Control, 1964, v.7, p.207\u2013223.","journal-title":"Information and Control"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/161494.161501","volume":"1","author":"W. Landi","year":"1992","unstructured":"Landi W., Undecidability of static analysis, ACM Lett.on Prog. Lang. and Syst., 1, 1992, 1, N 4, p.323\u2013337.","journal-title":"ACM Lett.on Prog. Lang. and Syst."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Mambo M., Murayama T., Okamoto E., A tentative approach to constructing tamper-resistant software, Workshop on New Security Paradigms, 1998, p.23\u201333.","DOI":"10.1145\/283699.283736"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch W.J., Relationship between nondeterministic and deterministic tape complexities, J. of Comput. and Syst. Sci., 4, 1970, p.177\u2013192.","journal-title":"J. of Comput. and Syst. Sci."},{"key":"10_CR19","unstructured":"SourceGuard, commercial version of HashJava, http:\/\/www.4thpass.coml"},{"key":"10_CR20","unstructured":"Tamper Resistant Software, http:\/\/www\/cloakware.com\/technology.html"},{"key":"10_CR21","unstructured":"Wang C., Hill J., Knight J., Davidson J., Software tamper resistance: obstructing static analysis of programs, Tech. Report, N 12, Dept. of Comp. Sci., Univ. of Virginia, 2000"},{"key":"10_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-45132-3_8","volume-title":"The equivalence problem for computational models: decidable and undecidable cases","author":"V. Zakharov","year":"2001","unstructured":"Zakharov V. The equivalence problem for computational models: decidable and undecidable cases, Lecture Notes in Computer Science, 2055, 2001, p.133\u2013152."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45439-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T08:51:03Z","timestamp":1587804663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45439-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426622","9783540454397"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45439-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}