Automated proving of the behavioral attributes

2009 4th Balkan Conference in Informatics, BCI 2009

Volumn , Issue , 2009, Pages 33-38

  Grigoraş, Gheorghe ^a   Lucanu, Dorel ^a   Caltais, Georgiana ^a   Goriac, Eugen Ioan ^a  

^a ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVITY; BEHAVIORAL EQUIVALENCE; COINDUCTION; COINDUCTIVE TECHNIQUES; COMMUTATIVITY; REWRITE RULES; THEOREM PROVERS;

BRAIN COMPUTER INTERFACE;

EID: 77951229415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BCI.2009.40     Document Type: Conference Paper

References (20)

1. J. Adámek. Introduction to coalgebra. Theory and Applications of Categories, 14(8):157-199, 2005.
2. L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In Resolution of Equations in Algebraic Structures, volume 2, pages 1-30. Academic Press, 1989.
3. Y. Bertot and E. Komendantskaya. Inductive and coinductive components of corecursive functions in coq. Electron. Notes Theor. Comput. Sci., 203(5):25-47, 2008.
4. M. Bidoit, R. Hennicker, and A. Kurz. Observational logic, constructor-based logic, and their duality. Theoretical Computer Science, 3(298):471-510, 2003.
5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. L. Talcott, editors. All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, volume 4350 of Lecture Notes in Computer Science. Springer, 2007.
6. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(1):36-72, 1993.
7. T. Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, TYPES, volume 806 of Lecture Notes in Computer Science, pages 62-78. Springer, 1993
8. E. A. Emerson. Model checking and the mu-calculus. In DIMACS Series in Discrete Mathematics, pages 185-214. American Mathematical Society, 1997.
9. J. Goguen and G. Malcolm. A hidden agenda. Theoretical Computer Science, 245(1):55-101, August 2000.
10. J. Goguen and J. Meseguer. Completeness of Many-Sorted Equational Logic. Houston Journal of Mathematics, 11(3):307-334, 1985.
11. D. Hausmann, T. Mossakowski, and L. Schröder. Iterative circular coinduction for cocasl in isabelle/hol. In M. Cerioli, editor, FASE, volume 3442 of Lecture Notes in Computer Science, pages 341-356. Springer, 2005.
12. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for The-oretical Computer Science, 62:222-259, 1997.
13. Lucanu D., Goriac E.-I., Caltais G., Roşu.G., CIRC: A behavioral verification tool based on circular coinduction, In CALCO'09, LNCS, 2009. To appear.
14. D. Lucanu, E.-I. Goriac, G. Caltais, and G. Roşu. CIRC : A behavioral verification tool based on circular coinduction. In CALCO'09, LNCS, 2009. To appear.
15. D. Lucanu and G. Roşu. Circ : A circular coinductive prover. In T. Mossakowski, U. Montanari, and M. Haveraaen, editors, CALCO, volume 4624 of Lecture Notes in Computer Science, pages 372-378. Springer, 2007.
16. D. Lucanu and G. Roşu. Circular Coinduction with Special Contexts. Technical Report UIUCDCS-R-2009-3039, University of Illinois at Urbana-Champaign, 2009. Submitted.
17. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
18. T. Mossakowski, Reichel H., M. Roggenbach, and L. Schroder. Algebraic-coalgebraic specification in Co-CASL. In Proceedings of WADT'02, volume 2755 of LNCS, pages 376-392. Springer, 2002.
19. G. Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
20. G. Roşu and D. Lucanu. Circular Coinduction -A Proof Theoretical Foundation. In CALCO'09, LNCS. Springer, 2009. To appear.