Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DEFINITION HOARE")

Document Type [dt]

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

Publication Year[py]

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

Results 1 to 20 of 20

  • Page / 1
Export

Selection :

  • and

REMARQUES SUR LES FONDEMENTS DE LA SEMANTIQUE AXIOMATIQUE.MOHAND ARESKI NAIT ABDALLAH.1976; ; S.L.; DA. 1976; PP. (127P.); BIBL. 7 P. 1/2; (THESE DOCT. 3E. CYCLE, SPEC. MATH.; PARIS VII)Thesis

THE LOGIC OF ALIASINGCARTWRIGHT R; OPPEN D.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 365-384; BIBL. 17 REF.Article

SELECTIVE BACKTRACKING FOR LOGIC PROGRAMSPEREIRA LM; PORTO A.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 306-317; BIBL. 12 REF.Conference Paper

CORRECTNESS PROOFS FOR ASSIGNMENT STATEMENTS.DE BAKKER JW.1976; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1976; NO 55; PP. 1-20; BIBL. 6 REF.Serial Issue

A COMPLETE AND CONSISTENT HOARE AXIOMATICS FOR A SIMPLE PROGRAMMING LANGUAGE.CHERNIAVSKY J; KAMIN S.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES, CALIF.; 1977; NEW YORK, N.Y.; ASSOC. COMPUT. MACH.; DA. 1977; PP. 1-9; BIBL. 9 REF.Conference Paper

TRANSFORMATION DE PROGRAMMES RECURSIFS.VEILLON G.1976; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., INFORM.; FR.; DA. 1976; VOL. 10; NO 9; PP. 7-20; BIBL. 6 REF.Article

PROGRAMMING LANGUAGE CONSTRUCTS FOR WHICH IT IS IMPOSSIBLE TO OBTAIN GOOD HOARE-LIKE AXION SYSTEMS.CLARKE EM JR.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 10-20; BIBL. 11 REF.Conference Paper

RULES OF INFERENCE FOR PROCEDURE CALLS.ERNST GW.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 2; PP. 145-152; BIBL. 5 REF.Article

A GENERAL, VERIFIABLE ITERATIVE CONTROL STRUCTURE.ADAMS JM.1977; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1977; VOL. 3; NO 2; PP. 144-149Article

EXERCISES IN DENOTATIONAL SEMANTICS.APT KR; DE BAKKER JW.1976; STICHTG MATH., CENTRUM, INFORMAT.; NEDERL.; DA. 1976; NO 57; PP. 1-11; BIBL. 12 REF.Serial Issue

LAR: A LOGIC OF ALGORITHMIC REASONING.KROEGER F.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 3; PP. 243-266; BIBL. 17 REF.Article

PROOF THEORY OF PARTIAL CORRECTNESS VERIFICATION SYSTEMS.GERHART SL.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 355-377; BIBL. 27 REF.Article

GOTO STATEMENTS: SEMANTICS AND DEDUCTION SYSTEMSDE BRUIN A.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 385-424; BIBL. 18 REF.Article

TOTAL CORRECTNESS FOR PROCEDURES.SOKOLOWSKI S.1977; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1977; NO 53; PP. 475-483; BIBL. 10 REF.; (MATH. FOUND. COMPUT. SCI. 1977. SYMP. 6. PROC.; TATRANSKA LOMNICA; 1977)Conference Paper

A NEW INCOMPLETENESS RESULT FOR HOARE'S SYSTEM.WAND M.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 168-175; BIBL. 15 REF.Article

PROOF OF TERMINATION WITHIN A WEAK LOGIC OF PROGRAMS.LUCKHAM DC; SUZUKI N.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 1; PP. 21-36; BIBL. 16 REF.Article

AN AXIOMATIC PROOF TECHNIQUE FOR PARALLEL PROGRAMS I.OWICKI S; GRIES D.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 319-340; BIBL. 19 REF.Article

VERIFYING PROGRAMS BY ALGEBRAIC AND LOGICAL REDUCTION.SUZUKI N.sdIN: INT. CONF. RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 473-481; BIBL. 11 REF.Conference Paper

ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 4; LOS ANGELES, CALIF.; 1977.1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. (284P.); BIBL. DISSEM.Conference Proceedings

THE "HOARE LOGIC" OF CONCURRENT PROGRAMSCAMPORT L.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 14; NO 1; PP. 21-37; BIBL. 7 REF.Article

  • Page / 1