Abstract

During the last decade a variety of industrial strength formal methods has emerged and has been applied to industrial test cases to demonstrate their adequacy and scalability. Formal techniques require a sufficient tool support especially when dealing with proof obligations. The size and the complexity of the arising problems demand for techniques to structure the deduction. In this paper we present techniques to realize a general divide-and-conquer approach in the framework of proof planning. In order to tackle different subgoals by different proof methods we propose the use of the color-calculus as an underlying constraint mechanism to resolve possible threats. 1 Introduction The application of formal methods in an industrial setting (cf. [6]) results in an increased complexity of the specification and the correspondent verification. While various techniques have been developed to decompose specifications of large systems into modules of reasonable size (e.g. enrichment, parameteri...

Citations

165	A theory of abstraction - Giunchiglia, Walsh - 1992
157	Rippling: A Heuristic for Guiding Inductive Proofs - Bundy, Stevens, et al. - 1991
101	the tree theorem, and Vazsonyi’s conjecture - Well-quasi-ordering - 1960
25	Colouring Terms to Control Equational Reasoning - Hutter - 1997
20	Deduction in the verification support environment (VSE - Hutter, Langenstein, et al. - 1996
15	Semi-automated mathematics - Guard, Oglesby, et al. - 1969
4	Parameterized Abstractions used for Proof Planning - Autexier, Hutter - 1997
4	Uniform Strategies: The CADE-11 Theorem Proving Contest - Lusk, McCune - 1993
1	Using Rippling for Equational Reasoning 20th KI-96, Ed - Hutter - 1996
1	Hierarchical Proof Planning Using Abstractions 10th FLAIRS'97, Daytona Beach - Hutter