CIRC: A circular coinductive prover

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

Volumn 4624 LNCS, Issue , 2007, Pages 372-378

  Lucanu, Dorel ^a   Roşu, Grigore ^b  

^a ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; THEOREM PROVING;

CIRCULAR COINDUCTIVE PROVERS; INDUCTIVE PROVING;

BINARY TREES;

EID: 38049087152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73859-6_25     Document Type: Conference Paper

References (13)

1. Clavel, M., Durán, F.J., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and Programming in Rewriting Logic. Theoretical Computer Science 285, 187-243 (2002), Also extended Maude manual available at http://maude.csl.sri.com, http://mande.cs.uiuc.edu
2. Diaconescu, R., Futatsugi, K.: Behavioral coherence in object-oriented algebraic specification. JUCS 6(1), 74-96 (2000)
3. Goguen, J., Lin, K., Roşu, G.: Circular coinductive rewriting. In: Proceedings of Automated Software Engineering 2000, pp. 123-131. IEEE Computer Society Press, Los Alamitos (2000)
4. Goguen, J., Lin, K., Roşu, G.: Conditional circular coinductive rewriting with case analysis. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) Recent Trends in Algebraic Development Techniques. LNCS, vol. 2755, pp. 216-232. Springer, Heidelberg (2003)
5. Goguen, J., Malcolm, G.: A hidden agenda. J. of TCS 245(1), 55-101 (2000)
6. Hausmann, D., Mossakowski, T., Schröder, L.: Iterative circular coinduction for CoCASL in Isabelle/HOL. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 341-356. Springer, Heidelberg (2005)
7. Hennicker, R.: Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing 3(4), 326-345 (1991)
8. Hennicker, R., Bidoit, M.: Observational logic. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 263-277. Springer, Heidelberg (1998)
9. Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science 62, 222-259 (1997)
10. Lucanu, D., Roşu, G.: CIRC prover http://fsl.cs.uiuc.edu/index. php/Circ
11. Padawitz, P.: Swinging data types: Syntax, semantics, and theory. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Recent Trends in Data Type Specification. LNCS, vol. 1130, pp. 409-435. Springer, Heidelberg (1996)
12. Rosu, G.: Hidden Logic. PhD thesis, University of California at San Diego (2000)
13. 0-complete problem. In: the 11th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP'06), ACM Press, New York (2006)