Skip to main content
SpringerLink
Log in

Proofs in parameterized specifications

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 488))

Included in the following conference series:

Abstract

Theorem proving in parameterized specifications has strong connections with inductive theorem proving. An equational theorem holds in the generic theory of the parameterized specification if and only if it holds in the so-called generic algebra. Provided persistency, for any specification morphism, the translated equality holds in the initial algebra of the instantiated specification. Using a notion of generic ground reducibility, a persistency proof can be reduced to a proof of a protected enrichment. Effective tools for these proofs are studied in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bachmair. Proof methods for equational theories. PhD thesis, University of Illinois, Urbana-Champaign, 1987. Revised version, August 1988.

    Google Scholar 

  2. L. Bachmair. Proof by consistency in equational theories. In 3rd Symp. Logic in Computer Science, pages 228–233, Edinburgh, Scotland, 1988. IEEE.

    Google Scholar 

  3. L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In H. Ait-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2: Rewriting Techniques, pages 1–30. Academic Press, 1989.

    Google Scholar 

  4. R. Bundgen. Design, implementation and application of an extended ground reducibility test. Technical Report 88-05, University of Delaware USA, December 1987.

    Google Scholar 

  5. H. Comon. An effective method for handling initial algebras. In P. Lescanne J. Grabowski and W. Wechler, editors, Proc. Int. Workshop on Algebraic and Logic Programming, pages 108–118. Akademie Verlag, 1988. Also in Springer-Verlag Lecture Notes in Computer Science, volume 343.

    Google Scholar 

  6. N. Dershowitz. Computing with rewrite systems. Information and Control, 65(2/3):122–157, 1985.

    Google Scholar 

  7. L. Duponcheel, L. Jadoul, and W. Van Puymbroeck. Generic proofs by consistency. Technical report, Bell telephone Mfg. Co., Francis Wellesplein 1, B-2018 Antwerp, Belgium, 1989.

    Google Scholar 

  8. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Equations and initial semantics, volume 6 of EATCS Monographs on Theorical Computer Science. Springer-Verlag, 1985.

    Google Scholar 

  9. H. Ganzinger. Parameterized specifications: parameter passing and implementation with respect to observability. ACM Transactions on Programming Languages and Systems, 5(3):318–354, 1983.

    Google Scholar 

  10. H. Ganzinger. Ground term confluence in parametric conditional equational specifications. In F. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proceedings STACS 87, volume 247 of Lecture Notes in Computer Science, pages 286–298. Springer-Verlag, 1987.

    Google Scholar 

  11. J. Goguen. Parameterized programming. Transactions on Software Engineering, SE-10(5):528–543, September 1984.

    Google Scholar 

  12. J. Goguen, J. Meseguer, and D. Plaisted. Programming with parameterized abstract objects in OBJ. In Theory and Practice of Software Technology, pages 163–193. North-Holland, 1983.

    Google Scholar 

  13. G. Huet and D. Oppen. Equations and rewrite rules: A survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349–405. Academic Press, New York, 1980.

    Google Scholar 

  14. J.-P. Jouannaud and E. Kounalis. Proof by induction in equational theories without constructors. In Proceedings 1st Symp. on Logic In Computer Science, pages 358–366, Boston (USA), 1986.

    Google Scholar 

  15. J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Information and Computation, 82:1–33, 1989.

    Google Scholar 

  16. D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395–415, 1987.

    Google Scholar 

  17. E. Kounalis. Testing for inductive (co)-reducibility. In A. Arnold, editor, Proceedings 15th CAAP, Copenhagen (Denmark), volume 431 of Lecture Notes in Computer Science, pages 221–238. Springer-Verlag, May 1990.

    Google Scholar 

  18. E. Kounalis and M. Rusinowitch. Mechanizing inductive reasoning. In Proceedings of the AAAI Conference, pages 240–245, Boston, 1990. AAAI Press and the MIT Press.

    Google Scholar 

  19. G. A. Kucherov. A new quasi-reducibility testing algorithm and its application to proofs by induction. In P. Lescanne J. Grabowski and W. Wechler, editors, Proc. workshop on Algebraic and Logic Programming, pages 204–213. Akademie Verlag, 1988. Also in Springer-Verlag Lecture Notes in Computer Science, volume 343.

    Google Scholar 

  20. M. Navarro and F. Orejas. Parameterized Horn clause specifications: proof theory and correctness. In Proceedings TAPSOFT Conference, volume 249 of Lecture Notes in Computer Science. Springer-Verlag, 1987.

    Google Scholar 

  21. T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. In 6th GI Conference, volume 145 of Lecture Notes in Computer Science, pages 257–268. Springer-Verlag, 1983.

    Google Scholar 

  22. F. Orejas. A characterization of passing compatibility for parameterized specifications. Theoretical Computer Science, pages 205–214, 1987.

    Google Scholar 

  23. P. Padawitz. The equational theory of parameterized specifications. Information and Computation, 76:121–137, 1988.

    Google Scholar 

  24. D. Plaisted. Semantic confluence and completion method. Information and Control, 65:182–215, 1985.

    Google Scholar 

  25. A. Poigné. Parameterisation for order-sorted algebraic specifications. Technical report, Dept. of Computing, Imperial College, London, 1986.

    Google Scholar 

  26. U. Reddy. Term rewriting induction. In M. Stickel, editor, Proceedings 10th International Conference on Automated Deduction, Kaiserslautern (Germany), volume 449 of Lecture Notes in Computer Science, pages 162–177. Springer-Verlag, 1990.

    Google Scholar 

  27. J.L. Rémy and H. Zhang. Reveur4: a system for validating conditional algebraic specifications of abstract data types. In T. O'Shea, editor, Proceedings of the 5th European Conference on Artificial Intelligence, Pisa, Italy, 1984. ECAI, Elsevier Science Publishers (North Holland).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIN & INRIA-Lorraine, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France

    Hélène Kirchner

Authors
  1. Hélène Kirchner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ronald V. Book

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kirchner, H. (1991). Proofs in parameterized specifications. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-53904-2_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53904-9

  • Online ISBN: 978-3-540-46383-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation