Building Equational Proving Tools by Reflection in Rewriting Logic

Building Equational Proving Tools by Reflection in Rewriting Logic (1998)

by Manuel Clavel , Francisco Durán , Steven Eker , José Meseguer

Venue:	In Cafe: An Industrial-Strength Algebraic Formal Method
Citations:	37 - 18 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Building Equational Proving Tools by Reflection in Rewriting Logic	user correction - Legacy Corrections
AUTHOR NAME	Manuel Clavel	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Science Laboratory; SRI International	user correction - Legacy Corrections
AUTHOR NAME	Francisco Durán	user correction - Legacy Corrections
AUTHOR NAME	Steven Eker	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Science Laboratory; SRI International	user correction - Legacy Corrections
AUTHOR NAME	José Meseguer	user correction - Legacy Corrections
ABSTRACT	This paper explains the design and use of two equational proving tools, namely an inductive theorem prover -- to prove theorems about equational specifications with an initial algebra semantics -- and a Church-Rosser checker---to check whether such specifications satisfy the Church-Rosser property. These tools can be used to prove properties of order-sorted equational specifications in Cafe [11] and of membership equational logic specifications in Maude [7, 6]. The tools have been written entirely in Maude and are in fact executable specifications in rewriting logic of the formal inference systems that they implement.	user correction - Legacy Corrections
YEAR	1998	user correction - Legacy Corrections
VENUE	In Cafe: An Industrial-Strength Algebraic Formal Method	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1--31	INFERENCE
TECH	CafeOBJ Project	INFERENCE
CITATIONS	7 found	ParsCit 1.0