A simple mathematically based framework for rule extraction from an arbitrary programming language

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 valuable rules too often are not reused because the legacy program code is the only valid source for these rules, and extraction of the rules front the legacy code is thought to be too difficult. This problem is further exacerbated when a re-engineering project potentially involves rule recovery from multiple programs in multiple languages. This paper reviews the uses of mathematically based or mathematically formal approaches to business rule recovery and extraction. A simple framework for two different rule extraction approaches for an arbitrary program language is presented. These approaches are based on the mathematical assertions that programs are composed front language structures, and that extractable business rules can be functionally defined in terms of specific language structures and elements. The definition of an extractable rule function that specifies extractable rules in terms of language elements and structures is introduced. A simple C language example of rule extraction using each approach is presented, and the requirements, advantages, and limitations of each approach are examined. Directions for additional research are presented.