Using induction and rewriting to verify and complete parameterized specifications

Theoretical Computer Science

Volumn 170, Issue 1-2, 1996, Pages 245-276

  Bouhoula, Adel ^a  

^a Campus Scientifique ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SIMULATION; FORMAL LOGIC; THEOREM PROVING;

COMPLETE PARAMETERIZED CONDITIONAL SPECIFICATIONS; COMPLETENESS THEOREMS; IMPLICIT INDUCTION; SOFTWARE PACKAGE SPIKE; TERM REWRITING SYSTEMS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0030402474     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00005-9     Document Type: Article

References (39)