Abstract
Our goal is to produce a powerful inference system capable of dealing with a large number of KB rules, and conjectures with diverse features. To achieve this goal, we have built KITP-93 with a logical framework that allows convenient user interaction and easy incorporation of existing inference techniques. We have developed a management mechanism for supporting controlled use of KB rules, high-level user interaction, and incremental development of proofs. We have designed an inference engine by incorporating a variety of efficient inference techniques, and emphasizing the role of term-rewriting, goal-oriented deduction, and decision procedures, as well as interactive proof utilities. KITP-93 has been incorporated as an inference server by a number of formal environments. Significantly, it has been used successfully by a large industrial user in the control flow analysis of Ada procedures. A review of the use of KITP in solving real world problems is included in [2]. Besides proving theorems, other inference services that KITP-93 provides include disproving a non-theorem, simplifying program fragments, and deducing antecedents.
Preview
Unable to display preview. Download preview PDF.
References
Bundy, A., Sterling, L.: Meta-level inference: Two applications. J. Automatic Reasoning, 4(1) (1988) 15–18
Jüllig, R. K.: Applying formal software synthesis. IEEE Software, 10(3) (1993) 11–22
Milner, R.: A theory of type polymorphism in programming. J. Comput. System Science, 17 (1978) 348–375
Wang, T. C., Bledsoe, W. W.: Hierarchical Deduction. J. Automatic Reasoning, 3(1) (1987) 35–71
Wang, T. C., Goldberg, A.: RVF: an automated formal verification system. Proceedings CADE-11 (ed. D. Kapur), LNCS 607 (1992) 735–739
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, T.C., Goldberg, A. (1994). KITP-93: An automated inference system for program analysis. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_70
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive