RATIONALIZING DISCRETE PROGRAMSGOULD FJ; RUBIN DS.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 343-345; BIBL. 1 REF.Serial Issue

TWO NOTIONS OF CORRECTNESS AND THEIR RELATION TO TESTINGBUDD TA; ANGLUIN D.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 1; PP. 31-45; BIBL. 33 REF.Article

SUBRECURSIVE PROGRAM SCHEMATA I & II. I. UNDECIDABLE EQUIVALENCE PROBLEMS; II. DECIDABLE EQUIVALENCE PROBLEMSCONSTABLE RL; MUCHNICK SS.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 6; PP. 480-537; BIBL. 17 REF.Serial Issue

A COMPLETENESS THEOREM FOR STRAIGHT-LINE PROGRAMS WITH STRUCTURED VARIABLES.HOFFMANN CM; LANDWEBER LH.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 203-220; BIBL. 14 REF.Article

SYNTHESIS AND OPTIMIZATION OF PROGRAMS BY MEANS OF P-FUNCTIONSTHAYSE A.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 1; PP. 34-40; BIBL. 15 REF.Article

OPERATIONAL AND SEMANTIC EQUIVALENCE RECURSIVE PROGRAMSRAOULT JC; VUILLEMIN J.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 772-796; BIBL. 25 REF.Article

A SYSTEM FOR PROVING EQUIVALENCES OF RECURSIVE PROGRAMSKOTT L.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 63-69; BIBL. 17 REF.Conference Paper

LANGAGES D'INTERPRETATION DES SCHEMAS RECURSIFS.COUSINEAU FG; RIFFLET JM.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 1; PP. 21-42; BIBL. 3 REF.Article

ON TERMINATION PROBLEMS FOR FINITELY INTERPRETED ALGOL-LIKE PROGRAMSLANGMAACK H.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 1; PP. 79-108; BIBL. 32 REF.Article

CONVERTING A CLASS OF RECURSIVE PROCEDURES INTO NON-RECURSIVE ONES.ROHL JS.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 2; PP. 231-238; BIBL. 2 REF.Article

A METHOD FOR PROGRAM ANALYSIS AND ITS APPLICATIONS TO PROGRAM - CORRECTNESS PROBLEMS.HUANG JC.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 203-227; BIBL. 11 REF.Article

PROGRAM EQUIVALENCE AND CANONICAL FORMS IN STABLE DISCRETE INTERPRETATIONS.BERRY G; COURCELLE B.sdIN: JOURN. ET. SCHEMAS PROGRAMME SEMANTIQUE LANG. PROGRAMMATION; MOLINES EN QUEYRAS; 1976; S.L.; DA. S.D.; PP. 1-21; BIBL. 13 REF.Conference Paper

SOME SIMPLIFIED UNDECIDABLE AND NP-HARD PROBLEMS FOR SIMPLE PROGRAMSGURANI EM; IBARRA OH.1982; THEOR. COMPUT. SCI.; NLD; DA. 1982; VOL. 17; NO 1; PP. 55-73; BIBL. 13 REF.Article

AN ENLARGED DEFINITION AND COMPLETE AXIOMATIZATION OF OBSERVATIONAL CONGRUENCE OF FINITE PROCESSESDARONDEAU P.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 47-62; BIBL. 6 REF.Conference Paper

AN APPROACH TO COMPILER CORRECTNESS.CHIRICA LM; MARTIN DF.sdIN: INT. CONF. RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 96-103; BIBL. 11 REF.Conference Paper

PROBABILISTIC ALGORITHMS FOR DECIDING EQUIVALENCE OF STRAIGHT-LINE PROGRAMSIBARRA OH; MORAN S.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 217-228; BIBL. 19 REF.Article

ON RELATIONS BETWEEN PROGRAMSBROY M; PEPPER P; WIRSING M et al.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 59-78; BIBL. 3 P.Conference Paper

JOURNEES D'ETUDES SUR LES SCHEMAS DE PROGRAMME ET LA SEMANTIQUE DES LANGAGES DE PROGRAMMATION; MOLINES EN QUEYRAS; 1976.sd; S.L.; DA. S.D.; PP. (147P.); BIBL. DISSEM.; 7 FASCConference Paper

SUR LA DESCRIPTION, L'ANALYSE ET LA VALIDATION DES SYSTEMES DE COMMANDE PARALLELES.VALETTE R.1976; ; S.L.; DA. 1976; PP. 1-175; ABS. ANGL.; BIBL. 10 P. 1/2Thesis

Downgrading policies and relaxed noninterferencePENG LI; ZDANCEWIC, Steve.ACM SIGPLAN notices. 2005, Vol 40, Num 1, pp 158-170, issn 1523-2867, 13 p.Conference Paper