Skip to main content
SpringerLink
Log in

Combining reductions and computations in ReDuX

  • Conference
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1996)

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

Abstract

We think that in order to be useful for theorem proving and rapid prototyping on nontrivial examples rewrite based specifications must have support for efficient rewriting in standard structures like monoids, (multi) sets, commutative rings and Boolean rigs. Evaluation domains form a very attractive solution to this requirement. Their implementation in ReDuX has been found be extremely effective.

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. R. Bündgen. Reduce the redex → ReDuX. In C. Kirchner, editor, Rewriting Techniques and Applications (LNCS 690), pages 446–450. Springer-Verlag, 1993.

    Google Scholar 

  2. R. Bündgen, W. Küchlin, and W. Lauterbach. Verification of the Sparrow processor. In IEEE Symposium and Workshop on Engineering of Computer-Based Systems. IEEE Press, 1996. (Proc. ECBS'96, to appear).

    Google Scholar 

  3. R. Bündgen and W. Lauterbach. Experiments with partial evaluation domains for rewrite specifications. In 11th Workshop on Abstract Data Types, 1995. (submitted, presented at WADT'95, Oslo, N, September 1995).

    Google Scholar 

  4. R. Bündgen, C. Sinz, and J. Walter. ReDuX 1.5: New facets of rewriting. In H. Ganzinger, editor, Rewriting Techniques and Applications. Springer-Verlag, 1996. (to appear).

    Google Scholar 

  5. U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In Proc. EDAC 1992, 1992.

    Google Scholar 

  6. M. H. Stone. The theory of representations of Boolean algebras. Trans. American Math. Society, 40:37–111, 1936.

    Google Scholar 

  7. P. Thole, U. Kebschull, E. Schubert, and W. Rosenstiel. The design and implementation of an educational computer system based on FPGAs. In Proc. 4th Eurochip Workshop on VLSI Design Training, 1993.

    Google Scholar 

  8. University of California, Berkeley, CA. Berkeley Logic Interchange Format (BLIF), July 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, D-72076, Tübingen

    Reinhard Bündgen & Werner Lauterbach

Authors
  1. Reinhard Bündgen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Lauterbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Wirsing Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bündgen, R., Lauterbach, W. (1996). Combining reductions and computations in ReDuX. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014360

Download citation

  • DOI: https://doi.org/10.1007/BFb0014360

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61463-0

  • Online ISBN: 978-3-540-68595-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation