{"title":"Ada translation tools development: mappings from FORTRAN to Ada","authors":"M. Parsian","doi":"10.1109/ADA.1988.4793","DOIUrl":"https://doi.org/10.1109/ADA.1988.4793","url":null,"abstract":"The problem addressed is how existent syntactically and semantically correct Fortran programs can be translated into Ada programs (library units). A system that use one possible form of translation and provides complex mappings from FORTRAN to Ada is presented.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130178020","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":"A tool set for distributed Ada programming","authors":"G. Mcfarland, P. Brennan, J. Litke, M.S. Restivo","doi":"10.1109/ADA.1988.4787","DOIUrl":"https://doi.org/10.1109/ADA.1988.4787","url":null,"abstract":"A tool set for a distributed Ada programmable testbed is described. The testbed includes an Ada compiler to produce distributed programs and a unique tool set to permit safe and rapid program partitioning. The testbed, and the tool set in particular, are designed to support rapid prototyping of distributed systems and to support research on software-fault-tolerant and distributed-program-construction techniques.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124443047","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":"Packaging fault-tolerant software with Ada","authors":"D. Morris","doi":"10.1109/ADA.1988.4784","DOIUrl":"https://doi.org/10.1109/ADA.1988.4784","url":null,"abstract":"The ability of the Ada programming language to support a software-engineering approach to building fault-tolerant applications systems by distributed redundant abstract data types (ADTs) is discussed. It is shown that the package, the separation of the specification from the implementation parts, the typing and exception handling mechanisms, and the nondeterministic rendezvous of the Ada language contribute to the fault-tolerance of systems constructed in this fashion.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125231300","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":"A system for evaluating Ada implementations using synthesized benchmarks","authors":"J. Knight, R. Crowe","doi":"10.1109/ADA.1988.4786","DOIUrl":"https://doi.org/10.1109/ADA.1988.4786","url":null,"abstract":"A system is described that allows project designers to evaluate the suitability of an Ada implementation for a particular application using tailored benchmarks. Specification of the load that an application is expected to generate is written in an Ada-like notation. An Ada program is then synthesized that generates the specified load. Studies of the way in which performance varies with various parameters of the application can be performed by the system automatically.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117080106","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":"Generating multitasking Ada programs from high-level specifications","authors":"Y. Shi, N. Prywes","doi":"10.1109/ADA.1988.4794","DOIUrl":"https://doi.org/10.1109/ADA.1988.4794","url":null,"abstract":"A method for automatic generation of large-scale multitasking systems in an Ada programming environment is presented. The method allows the human designers to independently develop each functional tasks and independently develop the system integration. Thus individual task developers are allowed to have completely independent naming spaces. A dataflow graph in intertask communications is specified through a separate language: CSL (Configuration Specification Language). It is processed by a component of the MODEL system called Configurator. The Configurator conducts verification and validation of the overall data flow graph and produces an Ada shell to control the execution and communication of the functional tasks. It also produces an optimized implementation for the intertask (possibly interprocessor) communications. Individual functional tasks can also be generated automatically using the MODEL compiler.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423575","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":"Seer: a graphical retrieval system for reusable Ada software modules","authors":"L. Latour, E. Johnson","doi":"10.1109/ADA.1988.4792","DOIUrl":"https://doi.org/10.1109/ADA.1988.4792","url":null,"abstract":"The authors describe Seer, a student's engineering environment for reusable software. It is also a retrieval and evaluation system that is both flexible and unobtrusive, allowing the software engineer to easily explore complex module information webs, comparing them with other webs in a module classification scheme. A prototype of Seer has been constructed around the classification scheme of an existing commercial module library and seeded with a number of information webs associated with modules of that library. The functionality of this prototype is provided primarily by SeeGraph, a network database with flexible graphical interface.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134584123","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":"Gaia: an object-oriented framework for an Ada environment","authors":"Don Vines, Tim King","doi":"10.1109/ADA.1988.4788","DOIUrl":"https://doi.org/10.1109/ADA.1988.4788","url":null,"abstract":"Gaia is a framework that provides the basis for the high degree of integration required by Ada environments that will involve complex data structures, toolsets, and development processes. This framework is implemented in Ada and provides an object model for representing the complex structure of data entities as well as the complex tools that can be applied to those entities within an Ada environment. The framework provides a common set of machine-independent interfaces supporting the integration of new and existing tools without modification. It also provides users with object-oriented guidance in selecting objects and applying tools.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032537","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":"Symbolic execution-based verification of Ada tasking programs","authors":"L. Dillon","doi":"10.1109/ADA.1988.4780","DOIUrl":"https://doi.org/10.1109/ADA.1988.4780","url":null,"abstract":"Symbolic execution has been used successfully with sequential programs for generating the verification conditions required for correctness proofs. It is shown how the symbolic execution model for sequential programs can be extended to a tasking subset of Ada. The criteria for correct operation of a concurrent program include safety properties, such as mutual exclusion and freedom from deadlock. The extended model, therefore, provides a basis for the automatic generation of verification conditions for proving general safety properties of Ada tasking programs.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122134213","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":"Development of a high performance, memory based, relational database system using Ada","authors":"R.S. Birch, A. Bolwell, J. Maloney","doi":"10.1109/ADA.1988.4783","DOIUrl":"https://doi.org/10.1109/ADA.1988.4783","url":null,"abstract":"An attempt is made to describe the development, in Ada, of a memory-based relational database system to support a high-performance, real-time wagering system which must run at a minimum of 200 transactions per second. The authors report the background to the task at hand; why Ada was chosen; the initial problems of starting the project; why a memory-based, relational database system was needed; and how it was developed. The usage of Ada to this point in the project and some of the problems encountered are summarized.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257858","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":"Three techniques supporting the developing of large prototype systems","authors":"J. Wileden, L. Clarke, A. Wolf","doi":"10.1109/ADA.1988.4782","DOIUrl":"https://doi.org/10.1109/ADA.1988.4782","url":null,"abstract":"Experiments with various techniques that can facilitate prototyping are reported. It has been recognized that three of these used most extensively represent three distinct approaches to supporting the development of large prototype systems. All three are successful at controlling the impact of change, but they differ in how they achieve that control as well as in the ways and extents to which they support reuse and consistency management. The authors characterize the approaches, describe the tools developed for them and experiences with them. A comparative evaluation of the approaches is included.<<ETX>>","PeriodicalId":217451,"journal":{"name":"[Proceedings 1988] The Third International IEEE Conference on Ada Applications and Environments","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122493506","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}