{"title":"Integrating tools and support-code with the developed program","authors":"S. Rotenstreich","doi":"10.1109/ICSI.1990.138682","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138682","url":null,"abstract":"Wide-spectrum support for program development that allows easy implementation of tools such as debuggers, test procedures and performance measurement elements as well as the production of support code that is well maintained and strongly connected to the developed program is suggested. The framework which is an extension of regular programming languages, makes it possible to change, adapt and extend tools written in the extended language. The developed program and its support code are combined syntactically and semantically by a programming language called an orthogonal language, that is, an extension of the language in which the developed program is written. Orthogonal-C, which is an orthogonal extension of C, is considered.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132867582","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":"Efficient reconfiguration of WSI arrays","authors":"D. Bhatia, F. Leighton, F. Makedon","doi":"10.1109/ICSI.1990.138661","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138661","url":null,"abstract":"A new technique for efficient reconfiguration of large VLSI arrays suitable for wafer-scale integration (WSI) is introduced. Under the common assumption of uniformly distributed faults, the VLSI arrays are reconstructed in polynomial time using a matching technique first introduced by F.T. Leighton and P.W. Shor (1986). In addition, a randomized method for reducing the maximum wire length and the total wire length is developed and it is shown experimentally that the technique performs better than previous methods.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114774585","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 Byzantine general's new territory (network model)","authors":"S.C. Wang, Y. H. Chin, K. Yan","doi":"10.1109/ICSI.1990.138744","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138744","url":null,"abstract":"Traditionally, the Byzantine agreement (BA) problem is solved either in a fully connected network or in a broadcast network with processors in malicious failure only. A generalized network model for the BA is proposed. The conventional fully connected network or broadcast network is a special case of the new network architecture. Under the new generalized network, the BA problem is reexamined with the assumption of malicious faults on both processors and transmission media (TMs); the proposed algorithm uses the minimal number of message exchanges and can tolerate the maximal number of allowable faulty components to make each health processor reach a common agreement for the cases of processor failures, TM failures, or processor/TM failures.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132049173","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":"PDPS: a protocol design system by production systems approach","authors":"Chung-Ming Huang, Ye-In Chang, Ming T. Liu","doi":"10.1109/ICSI.1990.138683","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138683","url":null,"abstract":"The Protocol Design Production System (PDPS) is proposed for a protocol design system using the production systems approached based on OPS5. Using this approach, communication protocols are specified as triples of object-attribute-value, and the occurrences of send and receive transitions in the communication protocols can be specified by production rules. The inference of reachable global states and all logical errors are formally defined in terms of production rules. An incremental verification algorithm based on the production systems approach is also presented. From this approach, one can obtain the advantages of clear knowledge representations, strong modularity, modifiability, and expressability. Furthermore, since more production systems integrate the abstract specifications and the procedural computations into a single system, the special-purpose compiler which is used to facilitate the automation of communication protocol implementation is no longer required between the specification phase and the implementation phase. By combining the production systems with the RETE pattern matching algorithm and a parallel multiprocessor machine like the Encore Multimax, the proposed PDPS can achieve a remarkable performance in parallel execution.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"41 1.2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132089907","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":"Test data selection criteria for (software) integration testing","authors":"U. Linnenkugel, M. Müllerburg","doi":"10.1109/ICSI.1990.138737","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138737","url":null,"abstract":"When large programs are tested, a distinction is made between module testing and integration testing. During module testing, one concentrates on testing algorithms and their data, whereas during integration testing, one concentrates on testing the relations and the interfaces between the modules. The authors use the well-known criteria for module testing to define similar criteria, based on control and data flow, for the purposes of integration testing. An advantage is that it is possible to use strong test data selection criteria, such as all-loop-iteration-free-paths, when testing a single module because, generally, a module will be small. For integration testing, data flow criteria are especially useful since the aim of integration testing is to show the correctness of the interfaces between the modules which, in the case of procedures, are determined by the data flow between the calling and the called procedure.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121324869","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":"Post-facto integration technology: new discipline for an old practice","authors":"L. Power","doi":"10.1109/ICSI.1990.138657","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138657","url":null,"abstract":"Experience in building major pieces of a software development platform by integrating existing software components into a uniform programming environment is reported. These components are written in incompatible languages and follow idiosyncratic protocols and conventions. These are examples of a common software engineering practice called post-facto integration. In this style of integration, the integrated system is designed after its major subcomponents have been built, often for a rather different purpose. A research effort has been initiated to better understand this style of integration and to develop tools and methods to make it a more productive and reliable software engineering practice. Two models for post-facto integration have been identified, one for tools integration and one for information integration. A model is proposed for post-facto tool integration which is based on a module interconnection language for loosely coupled, communication processes where existing tools are encapsulated as concurrent objects.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122533354","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":"Software factory: using process modeling for integration purposes","authors":"L. Hubert, G. Perdreau","doi":"10.1109/ICSI.1990.138658","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138658","url":null,"abstract":"The ESF (Eureka Software Factory) program relies on the idea of a software factory for improving software development productivity and quality. HAPPI, one of the ESF project, aims at developing a first prototype of a software factory. Attention is given to the main choices made by HAPPI to integrate people and their tools inside a whole system. A process model view of integration is then described which uses a specific language to formulate both organization of work and interoperability of tools. The demonstration built in the HAPPI project is discussed. This factory involves five people working together to accomplish some task in a running project. These people use their own heterogeneous tools on several machines and operating systems (Sun/Unix, PC/MSDos) and their work precisely follows a defined methodology and is controlled by a process model.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128235285","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":"Modeling and performance evaluation of RISC/B processor","authors":"Yangjun Chen, Ted C. Yang","doi":"10.1109/ICSI.1990.138663","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138663","url":null,"abstract":"Consideration is given to the performance analysis of a RISC (reduced instruction set computer) machine (RISC/B) based on timed Petri net (TPN) models. The operation flow graph is created according to the RISC/B instruction execution patterns and the pipeline structures. A TPN is used to model the operation in the graph. A sequence of discrete-time Markov chains (DTMCs) is built from the TPN in the instruction execution path. The DTMC model is useful for the study of various design and analysis issues in processor architecture. The model has been validated by comparing the analytical results with those obtained from the RISC/B prototype machine. Bottlenecks in the prototype have been identified through the model and cache performance tradeoffs have been investigated from both the architectural and the organizational viewpoints.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121648654","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":"Preprocessing of engineering drawings for 3D reconstruction","authors":"D. Dori","doi":"10.1109/ICSI.1990.138693","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138693","url":null,"abstract":"The necessity of a preprocessing step which should precede the application of any 3-D reconstruction algorithm from a set of views provided by any manually or automatically prepared engineering machine drawing is discussed as a task of a machine drawing understanding system (MDUS). The essence of this preprocessing step is the distinction between, and separation of, geometry and annotation entities. Since the core of annotation is dimensioning, a graph-theoretic approach to the analysis of dimensioning of a restricted class of engineering machine drawings that describe two-and-one-half-dimensional objects represented by normalons is introduced. Drafting standards require that the induced dimensioning graph of a properly dimensioned normalon be a tree, as proved by the normalon proper dimensioning theorem. The theorem provides the theoretical basis for a MDUS view-level phase that assesses the completeness of the set of dimension sets detected individually in a previous, syntax-based dimension-set-level phase.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127761571","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 graphics-based system that supports the program understanding process","authors":"Brady R. Rimes, D. Carver","doi":"10.1109/ICSI.1990.138671","DOIUrl":"https://doi.org/10.1109/ICSI.1990.138671","url":null,"abstract":"A visual system called PEEC (program execution environment configuration) that is designed to support the program understanding process through the use of the program's flow model represented in three-dimensional space is described. PEEC augments the control model by localizing source code and displaying identifiers based on their scope definition. The building blocks, tiers, used to construct a graphical model of the program's execution flow are defined. The format of the flow model in three-dimensional space is also defined. The tiers and the three-dimensional configuration of these tiers form the basis for the graphical representation of the program's execution environment. Examples of the flow model are provided that demonstrate the user's options as he/she browses the flow model.<<ETX>>","PeriodicalId":322954,"journal":{"name":"Systems Integration '90. Proceedings of the First International Conference on Systems Integration","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127882168","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}