Proofs in parameterized specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1991

Proofs in parameterized specifications

Hélène Kirchner
Claude Kirchner


Theorem proving in parameterized specifications has strong connections with inductive theorem proving. An equational theorem holds in the generic theory of the parameterized specification if and only if it holds in the so-called generic algebra. Provided persistency, for any specification morphism, the translated equality holds in the initial algebra of the instantiated specification. Using a notion of generic ground reducibility, a persistency proof can be reduced to a proof of a protected enrichment. Effective tools for these proofs are studied in this paper.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1424.pdf (1.04 Mo) Télécharger le fichier

Dates and versions

inria-00075136 , version 1 (24-05-2006)


  • HAL Id : inria-00075136 , version 1


Hélène Kirchner, Claude Kirchner. Proofs in parameterized specifications. [Research Report] RR-1424, INRIA. 1991. ⟨inria-00075136⟩
44 View
133 Download


Gmail Facebook Twitter LinkedIn More