{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:38:28Z","timestamp":1725521908741},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418627"},{"type":"electronic","value":"9783540453093"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45309-1_22","type":"book-chapter","created":{"date-parts":[[2008,11,28]],"date-time":"2008-11-28T00:39:26Z","timestamp":1227832766000},"page":"335-351","source":"Crossref","is-referenced-by-count":7,"title":["Typestate Checking of Machine Code"],"prefix":"10.1007","author":[{"given":"Zhichen","family":"Xu","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[]},{"given":"Barton P.","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"22_CR1","volume-title":"Monographs in Computer Science","author":"M. Abadi","year":"1996","unstructured":"M. Abadi, and L. Cardelli. A Theory of Objects. Monographs in Computer Science, D. Gries, and F. B. Schneider (Ed.). Springer-Verlag New York (1996)."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating Array Bounds Checks on Demand. SIGPLAN Conference on Programming Language Design and Implementation. Vancouver B.C., Canada (June 2000).","DOI":"10.1145\/349299.349342"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"S. Chandra, and T. Reps. Physical Type Checking for C. PASTE\u2019 99: SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering. Toulouse, France (September 1999).","DOI":"10.1145\/316158.316183"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"D. R. Chase, M. Wegman, and F. Zadeck. Analysis of Pointers and Structures. SIGPLAN Conference on Programming Language Design and Implementation. New York, NY (1990).","DOI":"10.1145\/93542.93585"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"B. Chatterjee, B. G. Ryder, and W. A. Landi. Relevant Context Inference. ACM Symposium on Principles of Programming Languages. San Antonio, TX (January 1999).","DOI":"10.1145\/292540.292554"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. The 4th ACM Symposium on Principles of Programming Languages. Los Angeles, California (January 1977).","DOI":"10.1145\/512950.512973"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot, and N. Halbwachs. Automatic Discovery of Linear Restraints Among Variables of a Program. Fifth Annual ACM Symposium on Principles of Programming Languages. Tucson, AZ (January 1978).","DOI":"10.1145\/512760.512770"},{"key":"22_CR8","unstructured":"JavaSoft. Java Native Interface Specification. Release 1.1 (May 1997)."},{"key":"22_CR9","unstructured":"jPVM: A Native Methods Interface to PVM for the Java Platform. http:\/\/www.chmsr.gatech.edu\/jPVM (2000)."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"A. Mycroft. Type-Based Decompilation (or Program Reconstruction via Type Reconstruction). 8th European Symposium on Programming, ESOP\u201999. Amsterdam, The Netherlands (March 1999).","DOI":"10.1007\/3-540-49099-X_14"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"B. P. Miller, M. D. Callaghan, J. M. Cargille, J. K. Hollingsworth, R. B. Irvin, K. L. Karavanic, K. Kunchithapadam, and T. Newhall.The Paradyn Parallel Performance Measurement Tools. IEEE Computer 28, 11 (November 1995).","DOI":"10.1109\/2.471178"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17, 3 (1978).","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"R. Rivest. The MD5 Message-Digest Algorithm. Request for Comments: 1321. MIT Laboratory for Computer Science and RSA Data Security, Inc (April 1992).","DOI":"10.17487\/rfc1321"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"R. Rugina and M. Rinard. Symbolic Bounds Analysis of Pointers, Array Indices, and Accessed Memory Regions. SIGPLAN Conference on Programming Language Design and Implementation. Vancouver B.C., Canada (June 2000).","DOI":"10.1145\/349299.349325"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"M. Siff, S. Chandra, T. Ball, K. Kunchithapadam, and T. Reps. Coping with type casts in C. Seventh European Software Engineering Conference and Seventh ACM SIGSOFT Symposium on the Foundations of Software Engineering. Toulouse, France (September 1999).","DOI":"10.1007\/3-540-48166-4_12"},{"key":"22_CR16","unstructured":"N. P. Smith. Stack Smashing Vulnerabilities in the UNIX Operating System. http:\/\/www.destroy.net\/machines\/_security (2000)."},{"key":"22_CR17","unstructured":"C. Small, and M. A. Seltzer. Comparison of OS Extension Technologies. USENIX 1996 Annual Technical Conference. San Diego, CA (January 1996)."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"F. Smith, D. Walker, and G. Morrisett. Alias Types. European Symposium on Programming. Berlin, Germany (March 2000).","DOI":"10.1007\/3-540-46425-5_24"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"N. Susuki, and K. Ishihata. Implementation of an Array Bound Checker. 4th ACM Symposium on Principles of Programming Languages. Los Angeles, CA (January 1977).","DOI":"10.1145\/512950.512963"},{"key":"22_CR20","unstructured":"A. Tamches, and B. P. Miller. Fine-Grained Dynamic Instrumentation of Commodity Operating System Kernels. Third Symposium on Operating System Design and Implementation. New Orleans, LA (February 1999)."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"C. Verbrugge, P. Co, and L. Hendren. Generalized Constant Propagation A Study in C. 6th International Conference on Compiler Construction. Link\u00f6ping, Sweden (April 1996).","DOI":"10.1007\/3-540-61053-7_54"},{"key":"22_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Mathematical Foundations of Computer Science","author":"P. Wadler","year":"1993","unstructured":"P. Wadler. A taste of linear logic. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 711. Springer-Verlag. Gdansk, Poland (August 1993)."},{"key":"22_CR23","unstructured":"D. Wegner, J. Foster, E. Brewer, and A. Aiken. A First Step Towards Automated Detection of Buffer Overrun Vulnerabilities. The 2000 Network and Distributed Systems Security Conference. San Diego, CA (February 2000)."},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Z. Xu, B. P. Miller, and T. W. Reps. Safety Checking of Machine Code. SIGPLAN Conference on Programming Language Design and Implementation. Vancouver B.C., Canada (June 2000).","DOI":"10.1145\/349299.349313"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45309-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T20:30:23Z","timestamp":1557952223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45309-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418627","9783540453093"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45309-1_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}