CONSTRUCTIVE VERSIONS OF TARSKI'S FIXED POINT THEOREMS.COUSOT P; COUSOT R.1977; MATH. APPL. INFORMAT., RAPP. RECH.; FR.; DA. 1977; NO 85; PP. 1-17; BIBL. 1 P. 1/2Serial Issue

A CONSTRUCTIVE CHARACTERIZATION OF THE LATTICES OF ALL RETRACTIONS, PRECLOSURE, QUASI-CLOSURE AND CLOSURE OPERATORS ON A COMPLETE LATTICECOUSOT P; COUSOT R.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 128; PP. 1-15; BIBL. 1 P.Serial Issue

AUTOMATIC SYNTHESIS OF OPTIMAL INVARIANT ASSERTIONS: MATHEMATICAL FOUNDATIONS.COUSOT P; COUSOT R.1977; SIGPLAN NOT.; U.S.A.; DA. 1977; VOL. 12; NO 8; PP. 1-12; BIBL. 15 REF.; (SYMP. ARTIF. INTELL. PROGRAM. LANG. PROC.; ROCHESTER, N.Y.; 1977)Conference Paper

STATIC VERIFICATION OF DYNAMIC TYPE PROPERTIES OF VARIABLES.COUSOT P; COUSOT R.1975; VSM-INPG-MATH. APPL. INF.-RR-25; FR.; DA. 1975; PP. 1-18; BIBL. 1 P. 1/2Report

A la Burstall' intermittent assertions induction principles for proving inevitability properties of programsCOUSOT, P; COUSOT, R.Theoretical computer science. 1993, Vol 120, Num 1, pp 123-155, issn 0304-3975Article