{"title":"Future directions in programming languages","authors":"Guy L. Steele","doi":"10.1109/ICCL.1988.13061","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13061","url":null,"abstract":"Possibilities for the programming languages of the future are explored. Projections are based on past accomplishments and future programming tool proposals. Influencing programming language directions at both the high levels of software development (e.g. problem decomposition) and at the lower levels (e.g. algorithm implementation) will be parallel execution. There could (finally) come a serious break with the traditional languages such as Fortran, Algol, PL-1, Pascal, C, and Ada. Very-high-level languages (VHLL) could take over in popularity. Within an increasing number of domains, the programming, in addition to man-machine interfaces, will be accomplished through multiple media (VHLL, speech, natural language, mouse, menus, touch screen, etc.).<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130641434","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":"Specifications for the development of a software environment for evaluation and translation of assembly languages","authors":"N. Bourbakis","doi":"10.1109/ICCL.1988.13086","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13086","url":null,"abstract":"The author presents specifications for the development of a RISC (reduced-instruction-set-computer)-type universal assembly language (UAL) and its environment. The development of such an environment will be used as a testbed for evaluation of assembly languages, as a basis for translation of an assembly program into another assembly language (automatic compiler generator), and as an educational portable software package.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132992916","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":"Language aspects of ENVISAGER: an object-oriented environment for the specification of real-time systems","authors":"José P. Diaz-Gonzalez, J. E. Urban","doi":"10.1109/ICCL.1988.13067","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13067","url":null,"abstract":"A specification language based on an object-oriented conceptual model is presented. Interval temporal logic, a variation of modal logic that provides mechanisms for specifying time-varying properties of systems, is used in the language as the underlying formalism for representing behavioral constraints on the objects. The mechanism used for the interpretation and satisfaction of the constraints is discussed.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131767846","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":"An intentional language as the basis of a 3-D spreadsheet design","authors":"W. Du, W. Wadge","doi":"10.1109/ICCL.1988.13036","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13036","url":null,"abstract":"Plane Lucid is an extension of the language Lucid, a language based on intentional logic. The language allows values of expressions in a program to vary in space as well as in time; it provides spatial and temporal operators to combine values from different contexts (or different points in space and time). As an application of Plane Lucid, an intentional 3-D spreadsheet has been designed in which Plane Lucid is the definition language of the spreadsheet. The spreadsheet is considered as a single entity (called the spreadsheet variable) which varies in spatial and temporal dimensions; values of cells in the spreadsheet are values of the spreadsheet variable at different spatial and temporal points.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128563456","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}
Carl K. Chang, J. Brackett, A. Davis, P. C. Grabon, T. Haizuka, P. Hsia
{"title":"Specification languages-assessment and trends","authors":"Carl K. Chang, J. Brackett, A. Davis, P. C. Grabon, T. Haizuka, P. Hsia","doi":"10.1109/ICCL.1988.13055","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13055","url":null,"abstract":"The following topics are covered: perception of formal specification languages as hindering, rather than enhancing effective communication among customers, end users, requirements analysts and software developers; past prospects and trends; verification and validation, notation, and consistency; and current status of specification languages in Japan.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133449241","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":"Using obviously synchronizable series expressions instead of loops","authors":"R. Waters","doi":"10.1109/ICCL.1988.13082","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13082","url":null,"abstract":"It has been known for a long time that series expressions (functional expressions on data aggregates) are easier to write and maintain than loops. However, as typically implemented, series expressions are much less efficient than loops. At the cost of placing modest limits on what can be written, obviously synchronizable series expressions solve this problem by guaranteeing that every series expression can be automatically converted into a highly efficient loop. It is demonstrated using Lisp and Pascal prototypes that obviously synchronizable series expressions can be added to any programming language.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133498337","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":"Data security in an object-oriented environment such as Smalltalk-80","authors":"R. S. Tosten","doi":"10.1109/ICCL.1988.13069","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13069","url":null,"abstract":"Information-flow theory is used to develop a protocol which supports data security in Smalltalk-80. First, the general approach is explained along with its specific issues and problems. This approach establishes a protocol for data flow among objects in the environment. The basic strategy of this protocol is to develop security levels in which objects reside. In these security levels, information can be passed up to an object in an upper or more secure level, but cannot be passed down to an object in a lower of less secure level. This strategy dictates that a security-checking system be developed to control creating objects and passing messages. Solutions to various problems and modifications in the Smalltalk-80 environment are given. These solutions consist of detailed protocols, refined algorithms, and actual Smalltalk code. The main security-verifying algorithm for Smalltalk methods is demonstrated, along with a rigid evaluation of the algorithm and the general security system.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125574254","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":"Describing data control in programming languages","authors":"M. Oudshoorn, C. Marlin","doi":"10.1109/ICCL.1988.13048","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13048","url":null,"abstract":"The authors describe a multipass, multilayered model of the semantics of the data-control aspect of programming languages, illustrating the model by using it to define the data-control aspect of the language Pascal. The model is an information structure model in which the information structures are defined in a relatively precise manner, using algebraic specification techniques for abstract data types. The use of abstract data types is also the key to the layering of the description: the outermost layer describes the semantics of the language feature, the middle layer contains definitions for the manipulation of the information structures used within the model, and the innermost layer contains precise descriptions of these information structures. The fact that the model is layered allows various potential users of the semantic description to choose a level of detail appropriate to their needs.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124432054","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":"The influence of language semantics on program slices","authors":"J. C. Hwang, M. Du, C. Chou","doi":"10.1109/ICCL.1988.13050","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13050","url":null,"abstract":"The authors present observations on the influence of language semantics on program slices. These observations serve to illustrate that, whenever a program slice is designed for a specific language, the semantic features should be carefully examined, and the corresponding slicing algorithm adjusted accordingly. The authors can show that it is impossible to develop a single slicing routine which can be applied to all programming languages. In other words, a program slicer should be language-dependent. Its algorithm should be flexible enough to correspond to the semantics of a given language.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115200820","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":"Using higher order logic and functional languages to synthesize correct hardware","authors":"Shiu-Kai Chin, E. Stabler, K. J. Greene","doi":"10.1109/ICCL.1988.13089","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13089","url":null,"abstract":"Higher-order logic (HOL), the HOL proof checker, and the functional language SCHEME have been used to describe and verify several hardware synthesis functions, including one which synthesizes Pezaris-like array multipliers. The synthesis functions are shown to be equivalence preserving transformations. The synthesis functions produce functional forms corresponding to gate level interconnection lists. Proofs of theorems relating the synthesized functional forms to functional specifications are developed within HOL. Unlike simulation-based methods, which require exhaustive case analysis for each implementation, these theorems assert the corrections of all implementations produced by the synthesis functions. The combinations of machine executable synthesis functions and correctness theorems are additional features which would logically extend CAD systems for design synthesis and design verification.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132315655","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}