Conditional circular coinductive rewriting with case analysis

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

Volumn 2755, Issue , 2003, Pages 216-232

  Goguen, Joseph A ^a   Lin, Kai ^a   Roşu, Grigore ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ALGORITHMIC APPROACH; CASE ANALYSIS; HIDDEN ALGEBRAS;

ALGEBRA;

EID: 0348216690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40020-2_12     Document Type: Article

References (22)

1. G. Bernot, M. Bidoit, and T. Knapik. Observational specifications and the indistinguishability assumption. Theoretical Computer Science, 139:275-314, 1995.
2. N. Berregeb, A. Bouhoula, and M. Rusinowitch. Observational proofs with critical contexts. In Fundamental Approaches to Software Engineering, volume 1382 of LNCS, pages 38-53. Springer, 1998.
3. M. Bidoit and R. Hennicker. Behavioral theories and the proof of behavioral properties. Theoretical Computer Science, 165(1):3-55, 1996.
4. M. Bidoit and R. Hennicker. Observer complete definitions are behaviourally coherent. In K. Futatsugi, J. Goguen, and J. Meseguer, editors, OBJ/CafeOBJ/Maude at Formal Methods '99, pages 83-94. Theta, 1999.
5. S. Buss and G. Roşu. Incompleteness of behavioral logics. In H. Reichel, editor, Proceedings of Coalgebraic Methods in Computer Science, volume 33 of Electronic Notes in Theoretical Computer Science, pages 61-79. Elsevier Science, 2000.
6. R. Diaconescu and K. Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, volume 6.
7. R. Diaconescu and K. Futatsugi. Behavioral coherence in object-oriented algebraic specification. Journal of Universal Computer Science, 6(1):74-96, 2000.
8. K. Futatsugi and K. Ogata. Rewriting can verify distributed real-time systems - how to verify in CafeOBJ. In Y. Toyama, editor, Proc. Int. Workshop on Rewriting in Proof and Computation, pages 60-79. Tohoku University, 2001.
9. J. Goguen. Types as theories. In G.M. Reed, A.W. Roscoe, and R.F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357-390. Oxford, 1991.
10. J. Goguen, K. Lin, and G. Roşu. Circular coinductive rewriting. In Proceedings, Automated Software Engineering, pages 123-131. IEEE, 2000.
11. J. Goguen and G. Malcolm. A hidden agenda. Theoretical Computer Science, 245(1):55-101, 2000.
12. J. Goguen and G. Roşu. Hiding more of hidden algebra. In Proceeding, FM'99, volume 1709 of LNCS, pages 1704-1719. Springer, 1999.
13. R. Hennicker. Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing, 3(4):326-345, 1991.
14. R. Hennicker and M. Bidoit. Observational logic. In Proceedings, AMAST'98, volume 1548 of LNCS, pages 263-277. Springer, 1999.
15. B. Jacobs. Mongruences and cofree coalgebras. In M. Nivat, editor, Algebraic Methodology and Software Technology (AMAST95), pages 245-260. Springer, 1995. LNCS 936.
16. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of European Association for Theoretical Computer Science, 62:222-259, 1997.
17. P. Padawitz. Towards the one-tiered design of data types and transition systems. In Proceedings, WADT'97, volume 1376 of LNCS, pages 365-380. Springer, 1998.
18. G. Roşu. Behavioral coinductive rewriting. In K. Futatsugi, J. Goguen, and J. Meseguer, editors, OBJ/CafeOBJ/Maude at Formal Methods '99, pages 179-196. Theta, 1999.
19. G. Roşu. Hidden Logic. PhD thesis, University of California, San Diego, 2000.
20. G. Roşu and J. Goguen. Hidden congruent deduction. In R. Caferra and G. Salzer, editors, Automated Deduction in Classical and Non-Classical Logics, volume 1761 of LNAI, pages 252-267. Springer, 2000.
21. G. Roşu and J. Goguen. Circular coinduction. In International Joint Conference on Automated Reasoning (IJCAR'01). 2001.
22. J. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249:3-80, 2000.