Reduction of behavioral equivalence to inductive theorems
We shall demonstrate that proving the behavioral equivalence of two algebraic specifications can be reduced to proving a set of inductive theorems. So we can prove automatically this behavioral equivalence by applying automatic deduction techniques such as proof by consistency.
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97229 |
| Acceso en línea: | https://hdl.handle.net/2117/97229 |
| Access Level: | acceso abierto |
| Palabra clave: | Behavioral equivalence Inductive theorems Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | We shall demonstrate that proving the behavioral equivalence of two algebraic specifications can be reduced to proving a set of inductive theorems. So we can prove automatically this behavioral equivalence by applying automatic deduction techniques such as proof by consistency. |
|---|