Affiliation:
1. Indian Institute of Technology, Kanpur, India
Abstract
In this paper an algorithm to detect logical errors in a limited-entry decision table and in loop-free programs with embedded decision tables is developed. All the conditions in the decision tables are assumed to be inequalities or equalities relating linear expressions. It is also assumed that actions in a decision table are linear in variables which occur in the condition stub of the decision table (or tables) to which control is transferred from the table. The algorithm is based on determining whether a set of linear inequalities has or does not have a solution. The algorithm described in the paper is implemented in Fortran IV.
Publisher
Association for Computing Machinery (ACM)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Using $\mathcal{SOIQ}$ (D) to Formalize Semantics within a Semantic Decision Table;Rules on the Web: Research and Applications;2012
2. Towards Directly Applied Ontological Constraints in a Semantic Decision Table;Rule-Based Modeling and Computing on the Semantic Web;2011
3. No ifs, ands, or buts;ACM SIGPLAN Notices;2007-10-21
4. Incremental validation of policy-based systems;Proceedings. Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, 2004. POLICY 2004.;2004
5. An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables;IEEE Transactions on Software Engineering;1987-12