Circular Coinductive Rewriting (2000)
Cached
Download Links
- [www-cse.ucsd.edu]
- [www-cse.ucsd.edu]
- [www.cs.ucsd.edu]
- [www.cse.ucsd.edu]
- [gureni.cs.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of Automated Software Engineering 2000 |
| Citations: | 42 - 11 self |
BibTeX
@INPROCEEDINGS{Goguen00circularcoinductive,
author = {Joseph Goguen and Kai Lin and Grigore Rosu},
title = {Circular Coinductive Rewriting},
booktitle = {In Proceedings of Automated Software Engineering 2000},
year = {2000},
pages = {123--131},
publisher = {IEEE}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our new BOBJ behavioral specification and computation system, which is used in examples throughout this paper. These examples demonstrate the surprising power of circular coinductive rewriting. The paper also sketches the underlying hidden algebraic theory and briefly describes BOBJ and some of its algorithms.
