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.
Preview
Unable to display preview. Download preview PDF.
References
R. Bündgen. Reduce the redex → ReDuX. In C. Kirchner, editor, Rewriting Techniques and Applications (LNCS 690), pages 446–450. Springer-Verlag, 1993.
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).
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).
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).
U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In Proc. EDAC 1992, 1992.
M. H. Stone. The theory of representations of Boolean algebras. Trans. American Math. Society, 40:37–111, 1936.
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.
University of California, Berkeley, CA. Berkeley Logic Interchange Format (BLIF), July 1992.
Author information
Authors and Affiliations
Editor information
Rights 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