论文信息 - CIRC: A Behavioral Verification Tool Based on Circular Coinduction

CIRC: A Behavioral Verification Tool Based on Circular Coinduction

CIRC is a tool for automated inductive and coinductive theorem proving. It includes an engine based on circular coinduction, which makes CIRC particularly well-suited for proving behavioral properties of infinite data-structures. This paper presents the current status of the coinductive features of the CIRC prover, focusing on new features added over the last two years. The presentation is by examples, showing how CIRC can automatically prove behavioral properties.

Grigore Rosu | Dorel Lucanu | Georgiana Caltais | Eugen-Ioan Goriac

[1] Grigore Rosu,et al. Circular Coinduction: A Proof Theoretical Foundation , 2009, CALCO.

[2] Jeffrey Shallit,et al. The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[3] Hans Zantema. Well-Definedness of Streams by Termination , 2009, RTA.

[4] Grigore Rosu,et al. Conditional Circular Coinductive Rewriting with Case Analysis , 2002, WADT.

[5] Grigore Rosu,et al. Circular Coinduction with Special Contexts , 2009, ICFEM.

[6] Grigore Rosu,et al. CIRC : A Circular Coinductive Prover , 2007, CALCO.

[7] L. T. Fan,et al. Fractals in Chaos , 1991 .

[8] Jean-Paul Allouche,et al. A relative of the Thue-Morse sequence , 1995, Discret. Math..

[9] Alexander Kurz,et al. Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings , 2009, CALCO.

[10] Martin Wirsing,et al. Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[11] Dorel Lucanu,et al. Automated Proving of the Behavioral Attributes , 2009, 2009 Fourth Balkan Conference in Informatics.

[12] Manfred Schroeder,et al. Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise , 1992 .

[13] Dorel Lucanu,et al. A Rewrite Stack Machine for ROC! , 2008, 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.