Regular Strategies as Proof Tactics for CIRC

CIRC is an automated circular coinductive prover implemented as an extension of Maude. The main engine of CIRC consists of a set of rewriting rules implementing the circularity principle. The power of the prover can be increased by adding new capabilities implemented also by rewriting rules. In this paper we prove the correctness of the coinductive prover and show how rewriting strategies, expressed as regular expressions, can be used for specifying proof tactics for CIRC. We illustrate the strength of the method by defining a proof tactic combining the circular coinduction with a particular form of simplification for proving the equivalence of context-free processes.

[1]  Koushik Sen,et al.  Generating Optimal Monitors for Extended Regular Expressions , 2003, RV@CAV.

[2]  Eelco Visser,et al.  Building program optimizers with rewriting strategies , 1998, ICFP '98.

[3]  Rolf Hennicker,et al.  Context induction: A proof principle for behavioural abstractions and algebraic implementations , 1991, Formal Aspects of Computing.

[4]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[5]  Till Mossakowski,et al.  Iterative Circular Coinduction for CoCasl in Isabelle/HOL , 2005, FASE.

[6]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[7]  Mahesh Viswanathan,et al.  Testing Extended Regular Language Membership Incrementally by Rewriting , 2003, RTA.

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

[9]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[10]  Hans Hüttel,et al.  Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes , 1998, J. Log. Comput..

[11]  Grigore Rosu,et al.  Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[12]  José Meseguer,et al.  Towards a Strategy Language for Maude , 2005, WRLA.

[13]  Grigore Rosu,et al.  Equality of streams is a Π0 over 2-complete problem , 2006, ICFP '06.

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

[15]  J. Meseguer,et al.  Building Equational Proving Tools by Reflection in Rewriting Logic , 2000 .

[16]  Tetsuo Tamai,et al.  CAFE: An Industrial-Strength Algebraic Formal Method , 2000 .