Copyright © 2008 Elsevier B.V. All rights reserved.
Regular Strategies as Proof Tactics for CIRC
aFaculty of Computer Science, Alexandru Ioan Cuza University, Iaşi, Romania
bDepartment of Computer Science, University of Illinois, Urbana-Champaign, USA
Abstract
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.
Keywords: Behavioral equivalence; circular coinduction; regular strategies; proof tactics
References
J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Decidability of bisimulation equivalence for process generating context-free languages,
Journal of the ACM 40 (1993), pp. 653–682.
View Record in Scopus |
Cited By in Scopus (45)
M. Clavel, F. Durán, S. Eker and J. Meseguer, Building Equational Proving Tools by Reflection in Rewriting Logic, Cafe: An Industrial-Strength Algebraic Formal Method, Elsevier (2000).
Goguen, J., K. Lin and G. Roşu, Circular coinductive rewriting, in: Proceedings of Automated Software Engineering 2000 (2000), 123–131.
D. Hausmann, T. Mossakowski and L. Schröder, Iterative Circular Coinduction for CoCASL in Isabelle/HOL, Fundamental Approaches to Software Engineering 2005, LNCS 3442 (2005), pp. 341–356.
J. Hopcroft and J.D. Ullman, Introduction to automata theory, languages, and computation, Addison–Wesley (1979).
B. Jacobs and J. Rutten, A tutorial on (co)algebras and (co)induction, Bulletin of the European Association for Theoretical Computer Science 62 (1997), pp. 222–259.
D. Lucanu and G. Roşu, The CIRC Prover http://fsl.cs.uiuc.edu/index.php/Circ.
Lucanu, D. and G. Roşu, Circ: A Circular Coinductive Prover, in: 2nd Conference on Algebra and Coalgebra in Computer Science (CALCO 2007), Bergen, Norway, 2007, to appear in Lecture Notes in Computer Science.
Roşu, G., “Hidden Logic,” Ph.D. thesis, University of California at San Diego (2000).
Roşu, G.,
Equality of Streams is a 
-Complete Problem, in:
the 11th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP'06) (2006).
G. Roşu and M. Viswanathan, Testing Extended Regular Language Membership Incrementally by Rewriting RTA'03, LNCS 2706 (2003), pp. 499–514.
K. Sen and G. Rosu, Generating Optimal Monitors for Extended Regular Expressions, Electr. Notes Theor. Comput. Sci. 89 (2003).
E. Visser, Z.e.A. Benaissa and A. Tolmach, Building program optimizers with rewriting strategies, ACM SIGPLAN Notices 34 (1999), pp. 13–26.
1 Partially supported by CEEX grant 47/2005 and CNCSIS grant 1162/2007.
2 Partially supported by NSF grants CCF-0448501 and CNS-0509321.
Abstract
PDF (337 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
doi:10.1016/j.entcs.2008.03.055 
, Grigore Roşu2, b, 
PDF (380 K)
| View Record in Scopus | Cited By in Scopus (138)