{"title":"逆编译可行性","authors":"F. Friedman","doi":"10.1145/1408800.1408927","DOIUrl":null,"url":null,"abstract":"The feasibility of the use of techniques of inverse compilation (decompilation) for the solution of Software Transport problems depends to a great extent upon the level of adaptability of software systems designed to automate the decompilation process. The attainment of a sufficiently high level of adaptability requires the development of very general and <u>efficient</u> techniques of program structure and variable usage analysis. However, while such techniques are necessary for the development of adaptable decompilation software, they are not by themselves sufficient. What is further needed is a highly sophisticated medium of program description that 1) is comparatively easy to map to and from assembly languages for a wide variety of machines, 2) is suitable for direct input to a program analyzer, and 3) is easily produced by a high-level language compiler.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Inverse compilation feasibility\",\"authors\":\"F. Friedman\",\"doi\":\"10.1145/1408800.1408927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The feasibility of the use of techniques of inverse compilation (decompilation) for the solution of Software Transport problems depends to a great extent upon the level of adaptability of software systems designed to automate the decompilation process. The attainment of a sufficiently high level of adaptability requires the development of very general and <u>efficient</u> techniques of program structure and variable usage analysis. However, while such techniques are necessary for the development of adaptable decompilation software, they are not by themselves sufficient. What is further needed is a highly sophisticated medium of program description that 1) is comparatively easy to map to and from assembly languages for a wide variety of machines, 2) is suitable for direct input to a program analyzer, and 3) is easily produced by a high-level language compiler.\",\"PeriodicalId\":204185,\"journal\":{\"name\":\"ACM '74\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '74\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1408800.1408927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '74","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1408800.1408927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The feasibility of the use of techniques of inverse compilation (decompilation) for the solution of Software Transport problems depends to a great extent upon the level of adaptability of software systems designed to automate the decompilation process. The attainment of a sufficiently high level of adaptability requires the development of very general and efficient techniques of program structure and variable usage analysis. However, while such techniques are necessary for the development of adaptable decompilation software, they are not by themselves sufficient. What is further needed is a highly sophisticated medium of program description that 1) is comparatively easy to map to and from assembly languages for a wide variety of machines, 2) is suitable for direct input to a program analyzer, and 3) is easily produced by a high-level language compiler.