Observational proofs with critical contexts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1382, Issue , 1998, Pages 38-53

  Berregeb, Narjes ^a   Bouhoula, Adel ^a   Rusinowitch, Michaël ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER EXPERIMENT; CONTEXT INDUCTION; PROOF SYSTEM; SOFTWARE CORRECTNESS;

SOFTWARE ENGINEERING;

EID: 84957068625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053582     Document Type: Conference Paper

References (18)

1. 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.
2. G. Bemot, M. Bidoit, and T. Knapik. Behavioural approaches to algebraic specifications: A comparative study. Acta Informatica, 31(7): 651-671, 1994.
3. N. Berregeb, A. Bouhoula, and M. Rusinowitch. Observational proofs by implicit context induction. Technical Report 3151, INRIA, 1997.
4. 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.
5. M. Bidoit and R. Hennicker. Behavioural theories and the proof of behavioural properties. Theoretical Computer Science, 165(1): 3-55, 1996.
6. A. Bouhoula. Using Induction and Rewriting to Verify and Complete Parameterized Specifications. Theoretical Computer Science, 170(l-2): 245-276, 1996.
7. A. Bouhoula. Automated theorem proving by test set induction. Journal of Symbolic Computation, 23(1): 47-77, 1997.
8. A. Bouhoula and M. Rusinowitch. Implicit induction in conditional theories. Journal of Automated Reasoning, 14(2): 189-235, 1995.
9. J. Guttag. The specification and Application to Programming of Abstract Data Types. PhD Thesis, University of Toronto, 1975.
10. R. Hennicker. Context induction: a proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing, 3(4): 326-345, 1991.
11. S. Kaplan and M. Choquer. On the decidability of quasi-reducibility. Bulletin of European Association for Theoretical Computer Science, 28: 32-34, February 1986.
12. E. Kounalis. Testing for the ground (co-)reducibility property in term-rewriting systems. Theoretical Computer Science, 106: 87-117, 1992.
13. O. Lysne. Extending Bachmair's method for proof by consistency to the final algebra. Information Processing Letters, 51: 303-310, 1994.
14. G. Malcolm and J. Goguen. Proving correctness of refinement and implementation. Technical Monograph PRG-114, Oxford University Computing Laboratory, November 1994.
15. P. Padawitz. Computing in Horn Clause Theories. Springer-Verlag, 1988.
16. L. Puel. Proofs in the final algebra. IXth Colloquium on Trees in Algebra and Programming. Bordeaux, France, March 1984.
17. 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.
18. 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.