Pub Date : 1993-09-20DOI: 10.1109/KBSE.1993.341190
C. Drummond, R. Holte, D. Ionescu
Discusses a novel method called 'active browsing' which increases the speed and accuracy with which a user may browse libraries for reusable software. Information inferred solely from the user's normal actions is employed by the system to locate software items relevant to the user's search goal. This paper describes our active browsing system and illustrates its operation with an example using typical browsing steps. An experiment, using an automated browsing agent, is described, demonstrating that active browsing accelerates searching.<>
{"title":"Accelerating browsing by automatically inferring a user's search goal","authors":"C. Drummond, R. Holte, D. Ionescu","doi":"10.1109/KBSE.1993.341190","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341190","url":null,"abstract":"Discusses a novel method called 'active browsing' which increases the speed and accuracy with which a user may browse libraries for reusable software. Information inferred solely from the user's normal actions is employed by the system to locate software items relevant to the user's search goal. This paper describes our active browsing system and illustrates its operation with an example using typical browsing steps. An experiment, using an automated browsing agent, is described, demonstrating that active browsing accelerates searching.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124589638","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341210
Lewis Johnson, K. Narayanaswamy, R. Balzer
The paper describes a family of tools called Binders that support the elaboration of generic designs. Rather than taking the approach of building new languages and environments, a Binder is designed to inter-operate with existing languages and tools. Binders support grammatical extensions to a language (for example, a language to describe architectures or a language to describe processes) that permits the inclusion of uninstantiated descriptions in the language. Design elaboration is performed interactively-the Binder informs the designer as to which elements of the design require further elaboration, and suggests possible ways in which the elaboration may be performed. The Binder relies upon application specific knowledge bases of design constraints to be satisfied, and methods for satisfying those constraints. Two Binders have been developed using the above methodology: an Architecture Binder for developing software architectures from generic architectures, and a Process Binder that supports refinement of generic processes during process enactment.<>
{"title":"Interactive elaboration of generic designs","authors":"Lewis Johnson, K. Narayanaswamy, R. Balzer","doi":"10.1109/KBSE.1993.341210","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341210","url":null,"abstract":"The paper describes a family of tools called Binders that support the elaboration of generic designs. Rather than taking the approach of building new languages and environments, a Binder is designed to inter-operate with existing languages and tools. Binders support grammatical extensions to a language (for example, a language to describe architectures or a language to describe processes) that permits the inclusion of uninstantiated descriptions in the language. Design elaboration is performed interactively-the Binder informs the designer as to which elements of the design require further elaboration, and suggests possible ways in which the elaboration may be performed. The Binder relies upon application specific knowledge bases of design constraints to be satisfied, and methods for satisfying those constraints. Two Binders have been developed using the above methodology: an Architecture Binder for developing software architectures from generic architectures, and a Process Binder that supports refinement of generic processes during process enactment.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134621393","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341200
R. Hall
Validation of reactive systems, such as telephone switching systems and traffic controllers, is made unusually difficult by the fact that such systems must perform heterogeneous behaviors robustly in complex, dynamic environments. This renders them unusually difficult to specify and even to state requirements for. In the ISAT project (Hall, 1992) end-user requirements are stated as concrete behavior scenarios, and a multi-functional apprentice system aids the human developer in acquiring and maintaining a knowledge-based specification consistent with the scenarios. This paper describes ISAT's novel approach to validating the acquired specification by using sound scenario generalization to construct descriptions of scenario classes with guaranteed behavior. It also describes the key technical problems that must be solved in order to implement sound scenarios generalization using explanation-based techniques, as well as ISAT's solution to the problems. The approach is implemented and has been tested on two reactive systems; an email system and a telephone switching system.<>
{"title":"Validation of rule-based reactive systems by sound scenario generalization","authors":"R. Hall","doi":"10.1109/KBSE.1993.341200","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341200","url":null,"abstract":"Validation of reactive systems, such as telephone switching systems and traffic controllers, is made unusually difficult by the fact that such systems must perform heterogeneous behaviors robustly in complex, dynamic environments. This renders them unusually difficult to specify and even to state requirements for. In the ISAT project (Hall, 1992) end-user requirements are stated as concrete behavior scenarios, and a multi-functional apprentice system aids the human developer in acquiring and maintaining a knowledge-based specification consistent with the scenarios. This paper describes ISAT's novel approach to validating the acquired specification by using sound scenario generalization to construct descriptions of scenario classes with guaranteed behavior. It also describes the key technical problems that must be solved in order to implement sound scenarios generalization using explanation-based techniques, as well as ISAT's solution to the problems. The approach is implemented and has been tested on two reactive systems; an email system and a telephone switching system.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116722407","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341206
D. Redmiles
There exist a wide variety of techniques for performing empirical studies which researchers in human-computer interaction have adapted from fields of cognitive psychology, sociology and anthropology. An analysis of several of these techniques is presented through an approach that balances empirical study with tool development. The analysis is based on, and illustrated with, a several-year experience of consulting in a scientific software environment and in building an evaluating a prototype knowledge-based tool to capture aspects of that experience. Guidelines for applying specific techniques and cautions about potential pitfalls are discussed. Many additional examples of using the techniques are cited from the literature.<>
{"title":"Observations on using empirical studies on developing a knowledge-based software engineering tool","authors":"D. Redmiles","doi":"10.1109/KBSE.1993.341206","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341206","url":null,"abstract":"There exist a wide variety of techniques for performing empirical studies which researchers in human-computer interaction have adapted from fields of cognitive psychology, sociology and anthropology. An analysis of several of these techniques is presented through an approach that balances empirical study with tool development. The analysis is based on, and illustrated with, a several-year experience of consulting in a scientific software environment and in building an evaluating a prototype knowledge-based tool to capture aspects of that experience. Guidelines for applying specific techniques and cautions about potential pitfalls are discussed. Many additional examples of using the techniques are cited from the literature.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123500612","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341197
Douglas R. Smith, E. Parra
The authors have used KIDS (Kestrel Interactive Development System) to derive extremely fast and accurate transportation schedulers from formal specifications. As test data, strategic transportation plans which are generated by US government planners are used. In one such problem, the derived scheduler was able to schedule 15,460 individual movement requirements in 71 cpu seconds. The computed schedules use relatively few resources and satisfy all specified constraints. The speed of this scheduler derives from the synthesis of strong problem-specific constraint checking and constraint propagation code.<>
作者使用KIDS (Kestrel Interactive Development System)从正式的规范中推导出极其快速和准确的运输调度程序。作为测试数据，我们使用了美国政府规划者制定的战略交通计划。在一个这样的问题中，派生的调度器能够在71 cpu秒内调度15,460个单独的移动需求。计算的调度使用相对较少的资源并满足所有指定的约束。该调度器的速度来自于强问题特定约束检查和约束传播代码的综合。
{"title":"Transformational approach to transportation scheduling","authors":"Douglas R. Smith, E. Parra","doi":"10.1109/KBSE.1993.341197","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341197","url":null,"abstract":"The authors have used KIDS (Kestrel Interactive Development System) to derive extremely fast and accurate transportation schedulers from formal specifications. As test data, strategic transportation plans which are generated by US government planners are used. In one such problem, the derived scheduler was able to schedule 15,460 individual movement requirements in 71 cpu seconds. The computed schedules use relatively few resources and satisfy all specified constraints. The speed of this scheduler derives from the synthesis of strong problem-specific constraint checking and constraint propagation code.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131005504","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341205
P. D. Bailor, F. Young, Kim Kanzaki
Presents the results of an experiment at applying knowledge-based software engineering technology to hardware/software co-design. The Reacto verification system, developed by the Kestrel Institute, was used to create a high-level, formal-based interface to VHDL which can effectively model both hardware and software design components. In addition to the theorem proving and simulation capabilities already provided to Reacto, extensions were made to incorporate time constraints, and compiler-based language mappings for generating VHDL from Reacto specifications were defined. Our experimental results clearly indicated the complimentary nature and benefits of developing high-level, formally defined interfaces between languages like Reacto and VHDL.<>
{"title":"An experiment in applying knowledge-based software engineering technology","authors":"P. D. Bailor, F. Young, Kim Kanzaki","doi":"10.1109/KBSE.1993.341205","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341205","url":null,"abstract":"Presents the results of an experiment at applying knowledge-based software engineering technology to hardware/software co-design. The Reacto verification system, developed by the Kestrel Institute, was used to create a high-level, formal-based interface to VHDL which can effectively model both hardware and software design components. In addition to the theorem proving and simulation capabilities already provided to Reacto, extensions were made to incorporate time constraints, and compiler-based language mappings for generating VHDL from Reacto specifications were defined. Our experimental results clearly indicated the complimentary nature and benefits of developing high-level, formally defined interfaces between languages like Reacto and VHDL.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133382877","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341211
Tanya Korelsky, D. McCullough, Owen Rambow
The automatic generation of project management reports for software engineering projects puts special demands on the knowledge representation of software engineering environments (SEEs). This knowledge can best be represented as a process model, and must include a rich type hierarchy and various kinds of entity relations. Furthermore, histories must be maintained for certain types of information, and specific information about problems must be available. These types of knowledge, while useful in particular for automatic project reporting, are more generally important if a SEE is to provide comprehensive and useful services to a user.<>
{"title":"Knowledge requirements for the automatic generation of project management reports","authors":"Tanya Korelsky, D. McCullough, Owen Rambow","doi":"10.1109/KBSE.1993.341211","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341211","url":null,"abstract":"The automatic generation of project management reports for software engineering projects puts special demands on the knowledge representation of software engineering environments (SEEs). This knowledge can best be represented as a process model, and must include a rich type hierarchy and various kinds of entity relations. Furthermore, histories must be maintained for certain types of information, and specific information about problems must be available. These types of knowledge, while useful in particular for automatic project reporting, are more generally important if a SEE is to provide comprehensive and useful services to a user.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130615182","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341201
Tobiah E. Smith, D. Setliff
This paper presents research into the automation of design phase software synthesis. Key features of an application domain, real-time multi-tasking software, are incorporated into a design selection heuristic. This heuristic captures the mathematical underpinnings inherent in the domain. A design phase synthesis algorithm, incorporating the design selection heuristic, is described. This paper then illustrates this algorithm's ability to synthesize the design of a real-time multi-tasking software set.<>
{"title":"Towards supporting design phase synthesis","authors":"Tobiah E. Smith, D. Setliff","doi":"10.1109/KBSE.1993.341201","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341201","url":null,"abstract":"This paper presents research into the automation of design phase software synthesis. Key features of an application domain, real-time multi-tasking software, are incorporated into a design selection heuristic. This heuristic captures the mathematical underpinnings inherent in the domain. A design phase synthesis algorithm, incorporating the design selection heuristic, is described. This paper then illustrates this algorithm's ability to synthesize the design of a real-time multi-tasking software set.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130678496","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341196
Venkatesh Srinivasan, L. Sterling
The paper describes a general purpose scheduler into which one can add knowledge necessary to solve specific scheduler problems. The approach typifies how software should be developed for specific classes of applications. Using a general scheduler is analogous to the use of an expert system shell to which one adds application specific rules. The authors performed experiments for adding knowledge to three classes of schedulers-job shop schedulers, transportation schedulers and time tabling schedulers. They show how the framework provides flexibility in performing experiments.<>
{"title":"A knowledge based framework for developing and customizing schedulers","authors":"Venkatesh Srinivasan, L. Sterling","doi":"10.1109/KBSE.1993.341196","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341196","url":null,"abstract":"The paper describes a general purpose scheduler into which one can add knowledge necessary to solve specific scheduler problems. The approach typifies how software should be developed for specific classes of applications. Using a general scheduler is analogous to the use of an expert system shell to which one adds application specific rules. The authors performed experiments for adding knowledge to three classes of schedulers-job shop schedulers, transportation schedulers and time tabling schedulers. They show how the framework provides flexibility in performing experiments.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293447","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 : 1993-09-20DOI: 10.1109/KBSE.1993.341193
Richard MacMillan, E. Lusher, Martha L. Farinacci, S. Laskowski, Leonard J. Seligman, Adrienne J. Kleiboemer
Text analysis systems that handle large amounts of free-form narrative text are beginning to use natural language processing algorithms, employing linguistic-based techniques to deduce meaning. Existing natural language/text processing (NL/TP) systems often serve similar purposes and use similar components, but component reuse is rare. We have designed a domain-designed architecture to promote reusability of NL/TP software and data components. It is constructed from an ontology of the NL/TP domain, which was derived from a survey of NL/TP applications and users, and is represented by an object-oriented model. The architecture also includes interoperability standards, interface protocols, and tools for developing reusable components intended to promote reuse of software and data across a wide range of NL/TP applications and technologies, from keyword searching to semantic analysis.<>
{"title":"A common architecture to encourage reuse of natural language/text processing tools","authors":"Richard MacMillan, E. Lusher, Martha L. Farinacci, S. Laskowski, Leonard J. Seligman, Adrienne J. Kleiboemer","doi":"10.1109/KBSE.1993.341193","DOIUrl":"https://doi.org/10.1109/KBSE.1993.341193","url":null,"abstract":"Text analysis systems that handle large amounts of free-form narrative text are beginning to use natural language processing algorithms, employing linguistic-based techniques to deduce meaning. Existing natural language/text processing (NL/TP) systems often serve similar purposes and use similar components, but component reuse is rare. We have designed a domain-designed architecture to promote reusability of NL/TP software and data components. It is constructed from an ontology of the NL/TP domain, which was derived from a survey of NL/TP applications and users, and is represented by an object-oriented model. The architecture also includes interoperability standards, interface protocols, and tools for developing reusable components intended to promote reuse of software and data across a wide range of NL/TP applications and technologies, from keyword searching to semantic analysis.<<ETX>>","PeriodicalId":371606,"journal":{"name":"Proceedings of 8th Knowledge-Based Software Engineering Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131831365","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
扫码关注我们
求助内容：
应助结果提醒方式：