Abstract
Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker [10]. We propose in this paper to embed Context Induction in the implicit induction framework of [8]. The proof system we obtain applies to conditional specifications. It allows for many rewriting techniques and for the refutation of false observational conjectures. Under reasonable assumptions our method is refutationally complete, i.e. it can refute any conjecture which is not observationally valid. Moreover this proof system is operational: it has been implemented within the Spike prover and interesting computer experiments are reported.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Bauer and R. Hennicker. Proving the correctness of algebraic implementations by the ISAR system. In DISCO'93, volume 722 of Lecture Notes in Computer Science, pages 2–16. Springer-Verlag, 1993.
G. Bernot, M. Bidoit, and T. Knapik. Behavioural approaches to algebraic specifications: A comparative study. Acta Informatica, 31(7):651–671, 1994.
N. Berregeb, A. Bouhoula, and M. Rusinowitch. Observational proofs by implicit context induction. Technical Report 3151, INRIA, 1997.
M. Bidoit and R. Hennicker. How to prove observational theorems with LP. In U. Martin and J. Wing, editors, Proc. of First International Workshop on Larch. Springer-Verlag, 1992.
M. Bidoit and R. Hennicker. Behavioural theories and the proof of behavioural properties. Theoretical Computer Science, 165(1):3–55, 1996.
A. Bouhoula. Using Induction and Rewriting to Verify and Complete Parameterized Specifications. Theoretical Computer Science, 170(1–2):245–276, 1996.
A. Bouhoula. Automated theorem proving by test set induction. Journal of Symbolic Computation, 23(1):47–77, 1997.
A. Bouhoula and M. Rusinowitch. Implicit induction in conditional theories. Journal of Automated Reasoning, 14(2):189–235, 1995.
J. Guttag. The specification and Application to Programming of Abstract Data Types. PhD Thesis, University of Toronto, 1975.
R. Hennicker. Context induction: a proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing, 3(4):326–345, 1991.
S. Kaplan and M. Choquer. On the decidability of quasi-reducibility. Bulletin of European Association for Theoretical Computer Science, 28:32–34, February 1986.
E. Kounalis. Testing for the ground (co-)reducibility property in term-rewriting systems. Theoretical Computer Science, 106:87–117, 1992.
O. Lysne. Extending Bachmair's method for proof by consistency to the final algebra. Information Processing Letters, 51:303–310, 1994.
G. Malcolm and J. Goguen. Proving correctness of refinement and implementation. Technical Monograph PRG-114, Oxford University Computing Laboratory, November 1994.
P. Padawitz. Computing in Horn Clause Theories. Springer-Verlag, 1988.
L. Puel. Proofs in the final algebra. IXth Colloquium on Trees in Algebra and Programming. Bordeaux, France, March 1984.
D.T. Sanella and A. Tarlecki. Towards formal development of ml programs: foundations and methodology. In J. Diaz and F. Orejas, editors, TAPSOFT'89, volume 352 of Lecture Notes in Computer Science, pages 375–389. Springer-Verlag, 1989.
M. Wirsing. Algebraic specifications. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 13. Elsevier Science Publishers B. V. (North-Holland) and The MIT press, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berregeb, N., Bouhoula, A., Rusinowitch, M. (1998). Observational proofs with critical contexts. In: Astesiano, E. (eds) Fundamental Approaches to Software Engineering. FASE 1998. Lecture Notes in Computer Science, vol 1382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053582
Download citation
DOI: https://doi.org/10.1007/BFb0053582
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64303-6
Online ISBN: 978-3-540-69723-7
eBook Packages: Springer Book Archive