Regular Strategies as Proof Tactics for CIRC

Authors:
Dorel Lucanu;Grigore Roşu;Gheorghe Grigoraş
Affiliations:
Faculty of Computer Science, Alexandru Ioan Cuza University, Iaşi, Romania;Department of Computer Science, University of Illinois, Urbana-Champaign, USA;Faculty of Computer Science, Alexandru Ioan Cuza University, Iaşi, Romania
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 10
Cited 0

Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Building program optimizers with rewriting strategies

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Circular Coinductive Rewriting

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Equality of streams is a Π0 over 2-complete problem

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Towards a Strategy Language for Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
Testing extended regular language membership incrementally by rewriting

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
CIRC: a circular coinductive prover

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Iterative circular coinduction for CoCasl in isabelle/HOL

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.