Currently a certifiably secure multiuser operating system does not exist; no operating system has been able to withstand mallcious attacks by skilled penetrators. While there is a strongly felt need in both the military and civilian sectors for reliably secure operating system software, any solution to the security problem must also take into account the enormous investment in existing equipment and software. In the present paper, hypervisors are discussed as one approach to retrofitting security, but rejected due to the high cost and complexity of installing them on existing equipment. Encapsulation, an alternative solution proposed for batch and remote batch entry applications, requires only a small amount of additional hardware and verified software. The resulting system can be certified to be secure, and is thus suitable for stringent military requirements. The solution is applicable---essentially unchanged---to a wide class of hardware and software, and it is not sensitive to special versions of (or changes to) operating system code. Operating efficiency and construction costs of the encapsulation method are discussed to demonstrate its feasibility. This work has been performed under Advanced Research Projects Agency Contract DAHC15 72 C 0308. It is part of a larger effort to provide securable operating systems in DOD environments.
目前还不存在可认证安全的多用户操作系统;没有任何操作系统能够抵御熟练的渗透者的恶意攻击。虽然军事和民用部门都强烈感到需要可靠安全的操作系统软件，但安全问题的任何解决方案也必须考虑到对现有设备和软件的巨大投资。在本文中，管理程序作为改进安全性的一种方法进行了讨论，但由于在现有设备上安装它们的高成本和复杂性而被拒绝。封装是为批处理和远程批处理输入应用程序提出的另一种解决方案，它只需要少量的额外硬件和经过验证的软件。由此产生的系统可以被证明是安全的，因此适用于严格的军事要求。该解决方案适用于——基本上不变的——广泛的硬件和软件类别，并且它对操作系统代码的特殊版本(或更改)不敏感。讨论了该封装方法的运行效率和造价，论证了其可行性。这项工作是根据高级研究计划局合同DAHC15 72 C 0308进行的。它是在国防部环境中提供安全操作系统的更大努力的一部分。
{"title":"Encapsulation: an approach to operating system security","authors":"R. Bisbey, G. Popek","doi":"10.1145/1408800.1408877","DOIUrl":"https://doi.org/10.1145/1408800.1408877","url":null,"abstract":"Currently a certifiably secure multiuser operating system does not exist; no operating system has been able to withstand mallcious attacks by skilled penetrators. While there is a strongly felt need in both the military and civilian sectors for reliably secure operating system software, any solution to the security problem must also take into account the enormous investment in existing equipment and software.\u0000 In the present paper, hypervisors are discussed as one approach to retrofitting security, but rejected due to the high cost and complexity of installing them on existing equipment. Encapsulation, an alternative solution proposed for batch and remote batch entry applications, requires only a small amount of additional hardware and verified software. The resulting system can be certified to be secure, and is thus suitable for stringent military requirements. The solution is applicable---essentially unchanged---to a wide class of hardware and software, and it is not sensitive to special versions of (or changes to) operating system code. Operating efficiency and construction costs of the encapsulation method are discussed to demonstrate its feasibility.\u0000 This work has been performed under Advanced Research Projects Agency Contract DAHC15 72 C 0308. It is part of a larger effort to provide securable operating systems in DOD environments.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121845693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The structured programmer often produces code in an order relatively unrelated to the order required by a specific programming language. The task of reordering the structured code to the specifications of the chosen language is tedious and error prone, particularly for large programs. A programming aid, "STRUCTURE", is described that relieves the programmer of this burden. In addition, it provides a listing of the program in the hierarchical order of the solution, making the program more amenable to manipulation by the programmer.
{"title":"A programming aid for structured programmers","authors":"Douglas E. Jones","doi":"10.1145/1408800.1408879","DOIUrl":"https://doi.org/10.1145/1408800.1408879","url":null,"abstract":"The structured programmer often produces code in an order relatively unrelated to the order required by a specific programming language. The task of reordering the structured code to the specifications of the chosen language is tedious and error prone, particularly for large programs. A programming aid, \"STRUCTURE\", is described that relieves the programmer of this burden. In addition, it provides a listing of the program in the hierarchical order of the solution, making the program more amenable to manipulation by the programmer.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121925146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modes of information presentation for the blind programmer","authors":"M. Rahimi, J. B. Eulenberg","doi":"10.1145/1408800.1408820","DOIUrl":"https://doi.org/10.1145/1408800.1408820","url":null,"abstract":"","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128181328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Impact analysis is the assessment in terms of monetary loss of any potential threat to the organization. Impact analysis combines the Bayesian decisionprocess withthe Delphi method, as modified herein. A computer can be used to produce a statistical summary useful in fore-casting. This paper will describe impact analysis.First, brief summaries of the Bayesian decision process and the Delphi technique are offered.Then, the method for impact analysis is outlined, followed by a description of a recent application.The application was developed at the Weyer- haeuser Company, Tacoma, ashington. Weyer- haeuser is one of the largest forest products companies in the world. The paper concludes with suggestions for other applications.
{"title":"Impact analysis","authors":"James S. Ketchel, John P. Dolan","doi":"10.1145/800182.810419","DOIUrl":"https://doi.org/10.1145/800182.810419","url":null,"abstract":"Impact analysis is the assessment in terms of monetary loss of any potential threat to the organization. Impact analysis combines the Bayesian decisionprocess withthe Delphi method, as modified herein. A computer can be used to produce a statistical summary useful in fore-casting.\u0000 This paper will describe impact analysis.First, brief summaries of the Bayesian decision process and the Delphi technique are offered.Then, the method for impact analysis is outlined, followed by a description of a recent application.The application was developed at the Weyer- haeuser Company, Tacoma, ashington. Weyer- haeuser is one of the largest forest products companies in the world. The paper concludes with suggestions for other applications.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"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.
{"title":"Inverse compilation feasibility","authors":"F. Friedman","doi":"10.1145/1408800.1408927","DOIUrl":"https://doi.org/10.1145/1408800.1408927","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.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117201544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper is an attempt at presenting a high level model of the set and graph aspects of the graph algorithmic language GRAAL [5]. The problem area for which the language GRAAL was designed was the solution of graph problems of the type primarily arising in applications. It was designed with two objectives in mind. The first was to develop a language which permitted the writing of graph algorithms in a highly readable form with as natural a set of primitives as possible for describing the algorithm. The second was to allow for a wide variety of graphs of different types and complexity with as little degradation as possible in the efficient implementation and execution of an algorithm designed for a specific type of problem.
{"title":"Sets and graphs in GRAAL","authors":"V. Basili","doi":"10.1145/800182.810415","DOIUrl":"https://doi.org/10.1145/800182.810415","url":null,"abstract":"This paper is an attempt at presenting a high level model of the set and graph aspects of the graph algorithmic language GRAAL [5]. The problem area for which the language GRAAL was designed was the solution of graph problems of the type primarily arising in applications. It was designed with two objectives in mind. The first was to develop a language which permitted the writing of graph algorithms in a highly readable form with as natural a set of primitives as possible for describing the algorithm. The second was to allow for a wide variety of graphs of different types and complexity with as little degradation as possible in the efficient implementation and execution of an algorithm designed for a specific type of problem.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123118851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper describes a commercial hardware/software system which reads handprinted documents. The system recognizes a full upper case alphabet, all ten digits, and several special characters, intermixed, with minimal constraints imposed on the style of printing. The recognition algorithm, which incorporates a large number of heuristic methods, is described. On a test of over sixty thousand previously unseen characters produced by untrained clerks, fewer than six percent of the characters were “rejected” as unrecognizable, and only a few tenths of a percent were misrecognized.
{"title":"Handprint recognition on the GRAFIX I:: A commercial application of heuristic programming","authors":"A. Griffith","doi":"10.1145/800182.810427","DOIUrl":"https://doi.org/10.1145/800182.810427","url":null,"abstract":"This paper describes a commercial hardware/software system which reads handprinted documents. The system recognizes a full upper case alphabet, all ten digits, and several special characters, intermixed, with minimal constraints imposed on the style of printing. The recognition algorithm, which incorporates a large number of heuristic methods, is described. On a test of over sixty thousand previously unseen characters produced by untrained clerks, fewer than six percent of the characters were “rejected” as unrecognizable, and only a few tenths of a percent were misrecognized.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133215545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Professor Edward Feigenbaum will open the panel with comments on the current status of the field. Short presentations of specific current research will be made by the panelists: (1) Professor C. Kulikowski of Rutgers describing work on a causal-associative network developed with an associated model of the therapies to serve as a basis of a consultation program in glaucoma; (2) Dr. P. P. Tsiang of University of Missouri and (3) Dr. A. Gevins, University of California Medical Center, discussing their respective papers "Computer Analysis of Chest Radiographs" and "Heuristic Real Time Feature Extraction of the EEG", abstracts of which appear elsewhere in the program booklet; (4) Dr. Bruce Buchanan, on applications of AI to structure elucidation based on gas chromatography/mass spectrometry data; (5) Dr. Edward Shortliffe, Stanford University, on an antimicrobial therapy consultation system utilizing a flexible representation of knowledge and (6) T. Rindfleisch describing SUMEX-AIM, a new nationally shared resource for application of AI to medicine.
爱德华·费根鲍姆教授将对该领域的现状发表评论，开启小组讨论。小组成员将对当前的具体研究进行简短的介绍:(1)罗格斯大学的C. Kulikowski教授描述了在青光眼咨询项目的基础上开发的因果关联网络与相关治疗模型的工作;(2)密苏里大学的p.p. jiang博士和(3)加州大学医学中心的A. Gevins博士，讨论他们各自的论文《胸部x线片的计算机分析》和《脑电图的启发式实时特征提取》，论文摘要见节选手册;(4) Bruce Buchanan博士，关于AI在基于气相色谱/质谱数据的结构解析中的应用;(5)斯坦福大学的Edward Shortliffe博士介绍了一种利用灵活知识表示的抗菌治疗咨询系统;(6)T. Rindfleisch描述了SUMEX-AIM，这是一种新的国家共享资源，用于将人工智能应用于医学。
{"title":"Artificial intelligence research in medicine","authors":"E. Levinthal","doi":"10.1145/1408800.1408903","DOIUrl":"https://doi.org/10.1145/1408800.1408903","url":null,"abstract":"Professor Edward Feigenbaum will open the panel with comments on the current status of the field. Short presentations of specific current research will be made by the panelists: (1) Professor C. Kulikowski of Rutgers describing work on a causal-associative network developed with an associated model of the therapies to serve as a basis of a consultation program in glaucoma; (2) Dr. P. P. Tsiang of University of Missouri and (3) Dr. A. Gevins, University of California Medical Center, discussing their respective papers \"Computer Analysis of Chest Radiographs\" and \"Heuristic Real Time Feature Extraction of the EEG\", abstracts of which appear elsewhere in the program booklet; (4) Dr. Bruce Buchanan, on applications of AI to structure elucidation based on gas chromatography/mass spectrometry data; (5) Dr. Edward Shortliffe, Stanford University, on an antimicrobial therapy consultation system utilizing a flexible representation of knowledge and (6) T. Rindfleisch describing SUMEX-AIM, a new nationally shared resource for application of AI to medicine.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134446096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For the purposes of this discussion, I would like to define "tuning" as the adjustment of the variables in a generalized system to optimize it for a particular environment. The generalized systems we are talking about are called Generalized Data Base Management Systems or GDBMS, and I am going to talk about one of these: IBM's Information Management System, or IMS.
{"title":"Tuning the IMS data base management system","authors":"W. P. Grafton","doi":"10.1145/1408800.1408899","DOIUrl":"https://doi.org/10.1145/1408800.1408899","url":null,"abstract":"For the purposes of this discussion, I would like to define \"tuning\" as the adjustment of the variables in a generalized system to optimize it for a particular environment. The generalized systems we are talking about are called Generalized Data Base Management Systems or GDBMS, and I am going to talk about one of these: IBM's Information Management System, or IMS.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130276853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A general syntax-directed strategy is described for translating computer programs written in a machine-level source language into equivalent programs in a higher-level target language. This translation process is referred to as decompilation or inverse compilation. Work on decompilation is potentially applicable in such areas as software portability, source-level debugging and diagnostic systems, and program analysis and validation.
{"title":"A syntax-directed approach to inverse compilation","authors":"C. R. Hollander","doi":"10.1145/1408800.1408926","DOIUrl":"https://doi.org/10.1145/1408800.1408926","url":null,"abstract":"A general syntax-directed strategy is described for translating computer programs written in a machine-level source language into equivalent programs in a higher-level target language. This translation process is referred to as decompilation or inverse compilation. Work on decompilation is potentially applicable in such areas as software portability, source-level debugging and diagnostic systems, and program analysis and validation.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"43 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130839346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：