Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139428
Walter Cabot, G. Knafl
Explicit abstraction levels are used to organize decision making in information system analysis and design. These levels partition the concerns of a system analyst/designer at particular points in time. A methodology for the information system analysis/design is seen as a series of multiple systems specifications on different description levels. An ongoing investigation of a set of formalized techniques that support the production of such description levels for an information system is presented. New methodologies can be created and new analysis/design styles can be developed by providing appropriately chosen sets of transformation rules governing the transitions between the levels. To test these ideas, the authors are in the process of developing a prototype of an expert workstation for analysis/design of information systems. The workstation is being used to experiment with different methodologies for information system analysis and design. The goal is to propose the generic methodology, and to identify the relationships between generic analysis/design activities, to develop a taxonomy of information systems applications, to build reusable skeletal systems for applications in each class, and to develop a library of design cases.<>
{"title":"Expert workstation for information systems development","authors":"Walter Cabot, G. Knafl","doi":"10.1109/CMPSAC.1990.139428","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139428","url":null,"abstract":"Explicit abstraction levels are used to organize decision making in information system analysis and design. These levels partition the concerns of a system analyst/designer at particular points in time. A methodology for the information system analysis/design is seen as a series of multiple systems specifications on different description levels. An ongoing investigation of a set of formalized techniques that support the production of such description levels for an information system is presented. New methodologies can be created and new analysis/design styles can be developed by providing appropriately chosen sets of transformation rules governing the transitions between the levels. To test these ideas, the authors are in the process of developing a prototype of an expert workstation for analysis/design of information systems. The workstation is being used to experiment with different methodologies for information system analysis and design. The goal is to propose the generic methodology, and to identify the relationships between generic analysis/design activities, to develop a taxonomy of information systems applications, to build reusable skeletal systems for applications in each class, and to develop a library of design cases.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130723687","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139447
B. Ratcliff
The PRESTIGE workbench is an integrated CASE (computer-aided software environment) intended to provide full implementation support for Jackson System Development (JSD). JSD is an operational software development method, and thus implementation in JSD is essentially a transformational process. The main objective is to offer a generalized transformational facility that the JSD implementor can apply as desired to suit the needs of any particular implementation scenario, although a default implementation capability is also provided. Many of the transformations required can be automated, and the so-called 'inversion' transformations play a pivotal role in that capability. The author addresses a variety of technical issues that need to be considered in providing a user-controlled inversion facility within the PRESTIGE environment. The issues discussed include schedulerless implementation, rough merges, multiple inversion, buffering, and write inversions.<>
{"title":"An inversion capability for the PRESTIGE workbench: some basic issues","authors":"B. Ratcliff","doi":"10.1109/CMPSAC.1990.139447","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139447","url":null,"abstract":"The PRESTIGE workbench is an integrated CASE (computer-aided software environment) intended to provide full implementation support for Jackson System Development (JSD). JSD is an operational software development method, and thus implementation in JSD is essentially a transformational process. The main objective is to offer a generalized transformational facility that the JSD implementor can apply as desired to suit the needs of any particular implementation scenario, although a default implementation capability is also provided. Many of the transformations required can be automated, and the so-called 'inversion' transformations play a pivotal role in that capability. The author addresses a variety of technical issues that need to be considered in providing a user-controlled inversion facility within the PRESTIGE environment. The issues discussed include schedulerless implementation, rough merges, multiple inversion, buffering, and write inversions.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590978","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139339
D. Goldberg, A. Orooji
The concept of independent revocation is described where an authorizer specifies revocation independently of the current status of authorization. Some of the aspects relating to the implementation of a system providing independent revocation were discussed. Revocation is first discussed in terms of formal models of authorization. The concept of an access matrix is introduced, and extended to allow for the specification of a condition for database systems. Then the general idea of independent revocation is considered in terms of this extended access matrix. Second, an actual implementation of a system which provides independent revocation is presented. The system, RRDS (Relational Replicated Database System) provides a DISALLOW command which gives the authorizer the capability to specify the data that a user should not be allowed to access. Finally, the applicability of independent revocation to database system in general is explored. It is concluded that independent revocation is applicable to a variety of systems, including some major systems currently in existence.<>
{"title":"A symmetrical approach to granting and revoking access rights in database management systems","authors":"D. Goldberg, A. Orooji","doi":"10.1109/CMPSAC.1990.139339","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139339","url":null,"abstract":"The concept of independent revocation is described where an authorizer specifies revocation independently of the current status of authorization. Some of the aspects relating to the implementation of a system providing independent revocation were discussed. Revocation is first discussed in terms of formal models of authorization. The concept of an access matrix is introduced, and extended to allow for the specification of a condition for database systems. Then the general idea of independent revocation is considered in terms of this extended access matrix. Second, an actual implementation of a system which provides independent revocation is presented. The system, RRDS (Relational Replicated Database System) provides a DISALLOW command which gives the authorizer the capability to specify the data that a user should not be allowed to access. Finally, the applicability of independent revocation to database system in general is explored. It is concluded that independent revocation is applicable to a variety of systems, including some major systems currently in existence.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132098767","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139432
Kuo-Chung Tai
The author defines two condition testing strategies, BRO (Boolean and relational operator) and BRE (Boolean and relational expression) testing. These two testing strategies are different from existing condition testing strategies in that they are based on the detection of both Boolean and relational expression errors in a condition. For a condition with n operands, the number of tests required by BRO or BRE testing is at most 2(n+1). Based on empirical studies of the algorithms SBEMIN and SBEMINSEN and the theoretical properties of BRO and BRE testing, it is believed that BRO and BRE testing is practical and effective for testing programs containing complicated conditions.<>
{"title":"Condition-based software testing strategies","authors":"Kuo-Chung Tai","doi":"10.1109/CMPSAC.1990.139432","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139432","url":null,"abstract":"The author defines two condition testing strategies, BRO (Boolean and relational operator) and BRE (Boolean and relational expression) testing. These two testing strategies are different from existing condition testing strategies in that they are based on the detection of both Boolean and relational expression errors in a condition. For a condition with n operands, the number of tests required by BRO or BRE testing is at most 2(n+1). Based on empirical studies of the algorithms SBEMIN and SBEMINSEN and the theoretical properties of BRO and BRE testing, it is believed that BRO and BRE testing is practical and effective for testing programs containing complicated conditions.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572257","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139394
D. Lubinsky
The relationship between DLC (distinct line count) and NCSL (noncomment source lines) is studied on a number of programs, and it is found that, as a simple rule of thumb, the NCSL count can be estimated by twice the DLC. A more accurate model is derived by predicting NCSL from DLC and the number of lines that occur exactly once. It is also shown that, for unrelated programs, the proportion of common lines is very small; hence, DLC is approximately additive. It is concluded that, overall, the DLC is a very attractive measure of size that has two basic advantages over NCSL: it is an intuitively more appealing measure of effort than NCSL, and the problems of measuring size of subsequent releases disappear when using DLC.<>
{"title":"Measuring software size by distinct lines","authors":"D. Lubinsky","doi":"10.1109/CMPSAC.1990.139394","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139394","url":null,"abstract":"The relationship between DLC (distinct line count) and NCSL (noncomment source lines) is studied on a number of programs, and it is found that, as a simple rule of thumb, the NCSL count can be estimated by twice the DLC. A more accurate model is derived by predicting NCSL from DLC and the number of lines that occur exactly once. It is also shown that, for unrelated programs, the proportion of common lines is very small; hence, DLC is approximately additive. It is concluded that, overall, the DLC is a very attractive measure of size that has two basic advantages over NCSL: it is an intuitively more appealing measure of effort than NCSL, and the problems of measuring size of subsequent releases disappear when using DLC.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133253707","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139308
A. Hác
The performance of the make and load building algorithms is analyzed. The average time of compilation of an application is calculated by using the make algorithm. This time depends on the number of changed files, their compilation time, and the number of files affected by the change that have to be compiled. The load building algorithm chooses the files in an application that have to be compiled and places them on the compile list. The files that are not affected by changes are not compiled. This reduces the turnaround time for compilation and load building. The average time of compilation of an application is calculated by using the load building algorithm. This time depends on the number of files in an application, the number of changed files, and the interdependencies between files. It is proven analytically how the system performance can be improved by using the load building algorithm. A relative performance analysis of the make and load building algorithms shows that the load building algorithm allows for better performance if some files in the application do not have to be compiled, and the average time of analysis by the load building algorithm is smaller than the average time of compilation of files that are unnecessarily recompiled by using the make algorithm.<>
{"title":"Performance analysis of the make and load building algorithms","authors":"A. Hác","doi":"10.1109/CMPSAC.1990.139308","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139308","url":null,"abstract":"The performance of the make and load building algorithms is analyzed. The average time of compilation of an application is calculated by using the make algorithm. This time depends on the number of changed files, their compilation time, and the number of files affected by the change that have to be compiled. The load building algorithm chooses the files in an application that have to be compiled and places them on the compile list. The files that are not affected by changes are not compiled. This reduces the turnaround time for compilation and load building. The average time of compilation of an application is calculated by using the load building algorithm. This time depends on the number of files in an application, the number of changed files, and the interdependencies between files. It is proven analytically how the system performance can be improved by using the load building algorithm. A relative performance analysis of the make and load building algorithms shows that the load building algorithm allows for better performance if some files in the application do not have to be compiled, and the average time of analysis by the load building algorithm is smaller than the average time of compilation of files that are unnecessarily recompiled by using the make algorithm.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133837029","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139458
M. Papazoglou
The issue of employing higher level programming techniques and knowledge representation facilities for designing and developing an expert-like distributed database management system interface for multiple interoperable information sources is examined. A decentralized architectural framework for distributed information systems is introduced, and it is explained how it establishes a meaningful form of communication/cooperation between disparate information sources. The author considers the architectural perspectives and design requirements for the development of a knowledge-aided loosely coupled distributed information system (DIS) whereby multiple heterogeneous DBMSs can communicate as autonomous, self-descriptive components. This DIS can process voluminous heterogeneous data by permitting access to a set of large information sources scattered across the nodes of a common communication network each having a global view of the problem solving in the network.<>
{"title":"Knowledge-driven distributed information systems","authors":"M. Papazoglou","doi":"10.1109/CMPSAC.1990.139458","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139458","url":null,"abstract":"The issue of employing higher level programming techniques and knowledge representation facilities for designing and developing an expert-like distributed database management system interface for multiple interoperable information sources is examined. A decentralized architectural framework for distributed information systems is introduced, and it is explained how it establishes a meaningful form of communication/cooperation between disparate information sources. The author considers the architectural perspectives and design requirements for the development of a knowledge-aided loosely coupled distributed information system (DIS) whereby multiple heterogeneous DBMSs can communicate as autonomous, self-descriptive components. This DIS can process voluminous heterogeneous data by permitting access to a set of large information sources scattered across the nodes of a common communication network each having a global view of the problem solving in the network.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124652971","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139460
M. Mutka
A system that considers users' deadlines when scheduling background jobs is described which will enhance the quality of the computing environments it serves by exploiting underutilized workstation capacity without interfering with an owner's local workstation stage. By developing and evaluating a simulation model of the structure, the author shows that this scheduler can effectively schedule jobs according to their deadline constraints to improve the quality of service for the users. In the proposed approach, adaptive techniques for estimating the amount of capacity available for sharing in a workstation cluster are combined with user supplied information of the expected demand of their jobs. The improvement in deadline miss ratio due to the proposed structure was evaluated by means of simulation. The scheduling structure showed improvements over a wide range of user loads and tightness of deadlines.<>
{"title":"Executing jobs with deadline constraints in a privately owned workstation environment","authors":"M. Mutka","doi":"10.1109/CMPSAC.1990.139460","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139460","url":null,"abstract":"A system that considers users' deadlines when scheduling background jobs is described which will enhance the quality of the computing environments it serves by exploiting underutilized workstation capacity without interfering with an owner's local workstation stage. By developing and evaluating a simulation model of the structure, the author shows that this scheduler can effectively schedule jobs according to their deadline constraints to improve the quality of service for the users. In the proposed approach, adaptive techniques for estimating the amount of capacity available for sharing in a workstation cluster are combined with user supplied information of the expected demand of their jobs. The improvement in deadline miss ratio due to the proposed structure was evaluated by means of simulation. The scheduling structure showed improvements over a wide range of user loads and tightness of deadlines.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124925308","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139321
B. Holtkamp, V. Lum, N. Rowe
A description is given of the DEMOM media object data model, which aims at providing a uniform framework for managing different types of media data i.e. images, text, sound or graphics. According to DEMOM, media objects are defined as a class hierarchy of objects, i.e., images, text, sound, and graphics are subtypes of the general type media object. Representation-specific objects are regarded as subordinate types of the corresponding subtype, e.g., a SUN raster image in pixrect format is an instance of the subtype pixrect which is in turn a subtype of image. Using images as an example the authors discuss the media object hierarchy, the corresponding access operations, and implementation issues. Content-oriented search of media data on the basis of predicate calculus is considered as an essential part of DEMOM and hence briefly outlined. Finally, concerns related to the integration of alphanumeric and media objects are also included.<>
{"title":"DEMOM-A description based media object data model","authors":"B. Holtkamp, V. Lum, N. Rowe","doi":"10.1109/CMPSAC.1990.139321","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139321","url":null,"abstract":"A description is given of the DEMOM media object data model, which aims at providing a uniform framework for managing different types of media data i.e. images, text, sound or graphics. According to DEMOM, media objects are defined as a class hierarchy of objects, i.e., images, text, sound, and graphics are subtypes of the general type media object. Representation-specific objects are regarded as subordinate types of the corresponding subtype, e.g., a SUN raster image in pixrect format is an instance of the subtype pixrect which is in turn a subtype of image. Using images as an example the authors discuss the media object hierarchy, the corresponding access operations, and implementation issues. Content-oriented search of media data on the basis of predicate calculus is considered as an essential part of DEMOM and hence briefly outlined. Finally, concerns related to the integration of alphanumeric and media objects are also included.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"269 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122551844","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139318
C. Dony
An attempt is made to explain how the object-oriented formalism can improve the expressive power of an exception handling system and how it can simplify its implementation and its utilization. Using the proposed approach, a user-friendly, powerful, extensible and reusable exception handling system has been implemented. A specification of such a system using an 00L is described. Several classical exception handling requirements have been easily implemented and new functionalities have been proposed, among which the most important may be the ability for users to reuse and customize the existing system in order to provide specific exception handling in application programs. The system has been implemented in the Lore object-oriented language and in Smalltalk.<>
{"title":"Improving exception handling with object-oriented programming","authors":"C. Dony","doi":"10.1109/CMPSAC.1990.139318","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139318","url":null,"abstract":"An attempt is made to explain how the object-oriented formalism can improve the expressive power of an exception handling system and how it can simplify its implementation and its utilization. Using the proposed approach, a user-friendly, powerful, extensible and reusable exception handling system has been implemented. A specification of such a system using an 00L is described. Several classical exception handling requirements have been easily implemented and new functionalities have been proposed, among which the most important may be the ability for users to reuse and customize the existing system in order to provide specific exception handling in application programs. The system has been implemented in the Lore object-oriented language and in Smalltalk.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117256769","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
扫码关注我们
求助内容：
应助结果提醒方式：