ELIOS-OBJ theorem proving in a specification language - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

ELIOS-OBJ theorem proving in a specification language

Isabelle Gnaedig


In the context of the executable specification language OBJ3 an order-sorted completion procedure is implemented, providing automatically convergent specifications from user-given ones. This feature is of first importance to ensure unambiguity and termination of the rewriting execution process. We describe here how we specified a modular completion design in terms of inference rules and control language, using OBJ3 itself. On another hand, the specific problems encountered to integrate a completion process in an already reduction-oriented environment are pointed out.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1668.pdf (898.66 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00074889 , version 1


Isabelle Gnaedig. ELIOS-OBJ theorem proving in a specification language. [Research Report] RR-1668, INRIA. 1992. ⟨inria-00074889⟩
45 View
70 Download


Gmail Facebook X LinkedIn More