Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Equivalence programme")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 42

  • Page / 2
Export

Selection :

  • and

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

ON SOME SYNTACTIC EQUIVALENCES OF PROGRAM SCHEMAS AND RELATED TRANSFORMATIONSFLE MP; ROUCAIROL G.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 116-131; BIBL. 12 REF.Conference Paper

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

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

ON FRACTIONAL PROGRAMMING AND EQUIVALENCE.CRAVEN BD; MOND B.1975; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 405-410; BIBL. 6 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

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

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

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

STRAIGHT-LINE PROGRAMS WITH ONE INPUT VARIABLEIBARRA OH; LEININGER BS.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 1-14; BIBL. 7 REF.Article

THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR STRAIGHT-LINE PROGRAMSIBARRA OH; LEININGER BS.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 273-280; BIBL. 17 REF.Conference Paper

LES TESTS ET LEUR CARACTERISATION SYNTAXIQUE.GUESSARIAN I.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 2; PP. 133-156; BIBL. 1 P. 1/2Article

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

FLOYD'S PRINCIPLE, CORRECTNESS THEORIES AND PROGRAM EQUIVALENCEBERGSTRA JA; TIURYN J; TUCKER JV et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 113-149; BIBL. 35 REF.Article

INFINITE TREES IN NORMAL FORM AND RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTIONCOURCELLE B.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 131-180; BIBL. 36 REF.Article

PROGRAM EQUIVALENCE AND PROBABILITYCOUSINEAU G; ENJALBERT P.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 237-245; BIBL. 14 REF.Conference Paper

LINDENMAYER GRAMMARS AND SYMBOLIC TESTING.HOWDEN WE.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 1; PP. 36-39; BIBL. 11 REF.Article

  • Page / 2