{"title":"A knowledge-based toolkit for software visualisation","authors":"D. Sidarkevičiūtė, E. Tyugu, A. Kuusik","doi":"10.1109/KBSE.1996.552830","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552830","url":null,"abstract":"Understanding an existing program includes the analysis of the program code, as, very often, the program code is the only reliable source of information about the program. Many code analysis tools offer the user a possibility to examine the program code through a predefined set of graphical views. These tools can be considerably improved by using knowledge-based techniques. Knowledge-based code analysis tools allow the user to employ his own knowledge about programs and their analysis. The paper discusses a knowledge-based toolkit for graphical presentation, or visualisation, of programs. It is advocated that the introduction of knowledge-based techniques increases the extensibility and modifiability of the code analysers. In addition, the user of a knowledge-based toolkit is offered an intelligent environment for storing knowledge about programs and performing reasoning on it.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115159339","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":"Complementing semi-formal specifications with Z","authors":"Y. Ledru","doi":"10.1109/KBSE.1996.552823","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552823","url":null,"abstract":"The insertion of formal techniques into the daily practice of software engineering definitely improves the quality of specifications. An approach is proposed where semi-formal specifications are translated into the formal specification language Z and enriched by formal annotations. The paper starts from a specification of an access control system using classical description techniques: entity-relationship schemas, data-flow diagrams, and state machine descriptions. It shows how these can be combined with formal definitions of types, constraints and functions.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114138802","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 synthesis for trade-off design","authors":"Akiyoshi Sato, Masato Miki, Toru Yamanouchi, Masanobu Watanabe","doi":"10.1109/KBSE.1996.552832","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552832","url":null,"abstract":"This paper details a case study of trade-off design in software synthesis. Domain-oriented software synthesis technology enables software designers to encode their own specific knowledge of software design into transformation rules. Thus, generated software is optimal and actually usable for the domain. However, the optimal implementation cannot be decided in advance if performance specifications, e.g., memory size limits and execution time limits, are unclear. That is, it is difficult to develop transformation rules which generate optimal software for their domain or situation if performance requirements are unclear beforehand. This paper proposes a method of trade-off design in software synthesis, and applies this method to develop a file access program generator called POT-DB. The proposed method includes procedures for: extracting trade-off parameters as input specifications; designing transformation rules for trade-off parameters to generate programs; and designing performance measurement rules to allow designers to notice the effects of trade-off parameters. Based on the results of applying POT-DB in developing a sales analysis and ordering system, all performance requirements have been satisfied, and application productivity has been improved 1.9 times.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121946499","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":"Trusting your assistant","authors":"R. Hall","doi":"10.1109/KBSE.1996.552822","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552822","url":null,"abstract":"The assistant interface metaphor has the potential to shield the human user from low-level, task-specific details, while allowing the automation of the many idiosyncratic, mundane tasks falling between the capabilities of commercial software packages. However, a user will not willingly put resources (money, privacy, information) at risk unless the assistant can be trusted to carry out the task in accord with the user's goals and priorities. This risk is significant, because assistant behaviors, being idiosyncratic and highly customized, will not be as well supported or documented as is commercial software. This paper describes a solution to this problem, allowing the assistant to safely execute partially trusted behaviors and to interactively increase the user's trust in the behavior so that more of the steps can be carried out autonomously. The approach is independent of how the behavior was acquired and is based on using incremental formal validation to populate a trust library for the behavior.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132444524","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":"Knowledge-based re-engineering of legacy programs for robustness in automated design","authors":"J. Keane, T. Ellman","doi":"10.1109/KBSE.1996.552828","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552828","url":null,"abstract":"Systems for automated design optimization of complex real-world objects can, in principle, be constructed by combining domain-independent numerical routines with existing domain-specific analysis and simulation programs. Unfortunately, such \"legacy\" analysis codes are frequently unsuitable for use in automated design. They may crash for large classes of input, be numerically unstable or locally non-smooth, or be highly sensitive to control parameters. To be useful, analysis programs must be modified to reduce or eliminate only the undesired behaviors, without altering the desired computation. To do this by direct modification of the programs is labor-intensive, and necessitates costly revalidation. We have implemented a high-level language and runtime environment that allow failure-handling strategies to be incorporated into existing Fortran and C analysis programs while preserving their computational integrity. Our approach relies on globally managing the execution of these programs at the level of discretely callable functions so that the computation is only affected when problems are detected. Problem handling procedures are constructed from a knowledge base of generic problem management strategies. We show that our approach is effective in improving analysis program robustness and design optimization performance in the domain of conceptual design of jet engine nozzles.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131713869","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":"Integrating software process models and design rationales","authors":"Barbara Dellen, Kirstin Kohler, F. Maurer","doi":"10.1109/KBSE.1996.552826","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552826","url":null,"abstract":"We describe an approach which allows us to acquire, represent and manage fine-grained causal dependencies between products. These dependencies are basically derived automatically from a software process model. By representing causal dependencies and their rationales, the traceability of the software development processes is improved. Our dependency-based system is able to support users in reacting to changes. Thereby, the costs of software development can be reduced. Based on the theoretical work, the CoMo-Kit System was implemented consisting of a modeling component and a process engine. The use of the system is illustrated.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127933132","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":"Synthesis of local search algorithms by algebraic means","authors":"R. P. Graham, P. D. Bailor","doi":"10.1109/KBSE.1996.552820","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552820","url":null,"abstract":"Algebraic techniques have been applied successfully to algorithm synthesis by the use of algorithm theories and design tactics, an approach pioneered in the KIDS system but described and implemented only partly in algebraic terms. Local search is an effective and popular algorithmic approach to solving optimization problems, so that a formal characterization of this family is desirable. This paper describes a more purely algebraic approach to algorithm design and its application to the synthesis of local search algorithms.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116292031","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":"Constructing transition models of AI planner behavior","authors":"A. Howe, Larry D. Pyeatt","doi":"10.1109/KBSE.1996.552821","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552821","url":null,"abstract":"Evaluation and debugging of AI systems require coherent views of program performance and behavior. We have developed a family of methods, called Dependency Detection, for analyzing execution traces for small patterns. Unfortunately, these methods provide only a local view of program behavior. The approach described here integrates two methods, dependency detection and CHAID-based analysis, to produce an abstract model of system behavior: a transition diagram of merged states. We present the algorithm and demonstrate it on synthetic examples and data from two AI planning and control systems. The models produced by the algorithm summarize sequences and cycles evident in the synthesized models and highlight some key aspects of behavior in the two systems. We conclude by identifying some of the inadequacies of the current algorithm and suggesting enhancements.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428490","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":"Set differentiation: a method for the automatic generation of filtering algorithms","authors":"Fawzia Derrough Darche","doi":"10.1109/KBSE.1996.552831","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552831","url":null,"abstract":"We present a method and its implementation in the GAP system for the automatic generation of filtering algorithms. The evaluation of left-hand sides of rules relies on the matching of condition elements with working memory elements. The filtering is the inference engine phase that performs this matching. Our automatic generation method is based on set differentiation, taking into account both qualitative and quantitative aspects. We present GAP's architecture and show how generic filtering algorithm skeletons are built using set differentials.","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133392940","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":"Addressing complexity, coordination, and automation in software development with the KBSA/ADM","authors":"Kevin Benner","doi":"10.1109/KBSE.1996.552825","DOIUrl":"https://doi.org/10.1109/KBSE.1996.552825","url":null,"abstract":"This paper describes how the Knowledge-Based Software Assistant/Advanced Development Model brings together technologies from the KBSE domain along with more traditional software engineering practices in order to address the pervasive software development problems associated with complexity coordination, and automation. This paper describes how the KBSA/ADM realizes and refines the vision of Rome Laboratory's Knowledge-Based Software Assistant research program. The most innovative aspects of this work have been in the areas of contextual knowledge (i.e., design history, discussion databases, and object linking), process support (i.e., personalized agendas and process enactment), evolution transformations (i.e., transformations which automate stereotypical changes to a model), and critics (i.e., integrating intelligent analysis with process enactment).","PeriodicalId":423237,"journal":{"name":"Proceedings of the 11th Knowledge-Based Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128423681","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}