A simple mathematically based framework for rule extraction using wide spectrum language

Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation Pub Date : 2002-10-01 DOI:10.1109/SCAM.2002.1134104

Frederick V. Ramsey, J. Alpigini

{"title":"A simple mathematically based framework for rule extraction using wide spectrum language","authors":"Frederick V. Ramsey, J. Alpigini","doi":"10.1109/SCAM.2002.1134104","DOIUrl":null,"url":null,"abstract":"Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a substantial and valuable business or intellectual asset. These rules often are not reused because the legacy program code is the only valid source for these rules, and extraction of the rules from the legacy code is thought to be too difficult. This problem is exacerbated when a re-engineering project potentially involves rule recovery from multiple programs in multiple languages. This paper reviews the uses of mathematically formal approaches to business rule recovery and extraction. The applications of provable transformations from different programming languages to Wide Spectrum Language (WSL) are reviewed, and a simple framework for two different rule extraction approaches using WSL is presented. An example of rule extraction using each approach is presented, and the requirements, advantages, and limitations of each approach are examined.","PeriodicalId":301735,"journal":{"name":"Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCAM.2002.1134104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a substantial and valuable business or intellectual asset. These rules often are not reused because the legacy program code is the only valid source for these rules, and extraction of the rules from the legacy code is thought to be too difficult. This problem is exacerbated when a re-engineering project potentially involves rule recovery from multiple programs in multiple languages. This paper reviews the uses of mathematically formal approaches to business rule recovery and extraction. The applications of provable transformations from different programming languages to Wide Spectrum Language (WSL) are reviewed, and a simple framework for two different rule extraction approaches using WSL is presented. An example of rule extraction using each approach is presented, and the requirements, advantages, and limitations of each approach are examined.

查看原文本刊更多论文

一个简单的基于数学的框架的规则提取使用广泛的语言

程序使用规则来规定或约束特定的决策或操作。这些规则通常经过不断的测试、修订和更新;因此，它们代表了大量有价值的商业或智力资产。这些规则通常不会被重用，因为遗留程序代码是这些规则的唯一有效源，并且从遗留代码中提取规则被认为过于困难。当重新工程项目可能涉及到从多种语言的多个程序中恢复规则时，这个问题会更加严重。本文回顾了用于业务规则恢复和提取的数学形式化方法。本文综述了从不同编程语言到广谱语言(WSL)的可证明转换的应用，并给出了两种不同的使用WSL的规则提取方法的简单框架。给出了使用每种方法的规则提取示例，并检查了每种方法的需求、优点和局限性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation

自引率

0.00%

发文量