Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROGRAMME CORRECTNESS")

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

Language

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

Author Country

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

Results 1 to 25 of 116

  • Page / 5
Export

Selection :

  • and

VERIFICATION OF PROGRAMS WITH PROCEDURE-TYPE PARAMETERSERNST GW; NAVLAKHA JK; OGDEN WF et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 149-169; BIBL. 8 REF.Article

TRANSFORMING PROGRAMS TO MONITOR CORRECT SEQUENCINGMIDDLETON AG; BOYD RN.1982; A GENERAL SURVEY OF SYSTEMS METHODOLOGY. SOCIETY FOR GENERAL SYSTEMS RESEARCH. ANNUAL MEETING. 26/1982-01-05/WASHINGTON DC; USA; LOUISVILLE: SOCIETY FOR GENERAL SYSTEMS RESEARCH; DA. 1982; PP. 338-341; BIBL. 7 REF.Conference Paper

SPECIFIED PROGRAMMINGBLIKLE A.1978; PRACE I.P.I. P.A.N.; POL; DA. 1978; NO 333; 26 P.; ABS. RUS/POL; BIBL. 2 P.Article

SOCIAL PROCESSES AND PROOFS OF THEOREMS AND PROGRAMS.DE MILLO RA; LIPTON RJ; PERLIS J et al.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 206-214; BIBL. 23 REF.Conference Paper

APPROCHE AXIOMATIQUE DE LA DEMONSTRATION DE L'EXACTITUDE DES PROGRAMMESSOLAKHYAN SA.1976; AKAD. NAUK ARM.S.S.R., DOKL.; S.S.S.R.; DA. 1976; VOL. 63; NO 4; PP. 199-204; ABS. ARM.; BIBL. 7 REF.Article

WRITING A NUMBER AS THE SUM OF TWO SQUARES. A NEW SOLUTIONBACKHOUSE R.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 1; PP. 15-17; BIBL. 3 REF.Article

ON THE USE OF HISTORY VARIABLESCLINT M.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 1; PP. 15-30; BIBL. 12 REF.Article

RECURSIVE ASSERTIONS AND PARALLEL PROGRAMSAPT KR.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 3; PP. 219-232; BIBL. 8 REF.Article

A SURVEY OF MICROPROGRAM VERIFICATION AND VALIDATION METHODSLUCIDO TP; CHATTERGY R; POOCH UW et al.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 2; PP. 139-142; BIBL. 29 REF.Article

PROVING THE CORRECTNESS OF REGULAR DETERMINISTIC PROGRAMS: A UNIFYING SURVEY USING DYNAMIC LOGICHAREL D.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 12; NO 1; PP. 61-81; BIBL. 52 REF.Article

SPECIFIED PROGRAMMINGBLIKLE A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 75; PP. 228-251; BIBL. 2 P.Conference Paper

A FORMAL SEMANTICS FOR CONCURRENT SYSTEMSSHIELDS MW; LAUER PE.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 571-584; BIBL. 9 REF.Conference Paper

SOFTWARE MALPRACTICE. A DISTASTEFUL EXPERIENCE.SPIER MJ.1976; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1976; VOL. 6; NO 3; PP. 293-299; BIBL. 3 REF.Article

DETERMINATENESS OF PROGRAM EQUIVALENCE OVER PEANO AXIOMSCSIRMAZ L.1982; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 2; PP. 231-235; BIBL. 1 REF.Article

PROVING TOTAL CORRECTNESS OF NONDETERMINISTIC PROGRAMS IN INFINITARY LOGICBACK RJR.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 3; PP. 233-249; BIBL. 21 REF.Article

ERROR SENSITIVE TEST CASES ANALYSIS (ESTCA)FOSTER KA.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 3; PP. 258-264; BIBL. 6 REF.Article

ON DEVELOPMENT OF ITERATIVE PROGRAMS FROM FUNCTION SPECIFICATIONSBASU SK.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 2; PP. 170-182; BIBL. 15 REF.Article

PROGRAM TESTING COMPLEXITY AND TESTING CRITERIAKUO CHUNG TAI.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 6; PP. 531-538; BIBL. 35 REF.Article

STUDIES IN ABSTRACT CONCRETE MAPPINGS IN PROVING ALGORITHM CORRECTNESSDUNCAN AG; YELOWITZ L.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 218-229; BIBL. 14 REF.Conference Paper

THE MODAL LOGIC OF PROGRAMSMANNA Z; PNUELI A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 385-409; BIBL. 7 REF.Conference Paper

ON PROVING PROGRAM CORRECTNESS BY MEANS OF STEPWISE REFINEMENT METHODBANACHOWSKI L.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 27-44; BIBL. 4 REF.Conference Paper

PROGRAM CORRECTNESS AND MACHINE ARITHMETICDEKKER TJ.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; NO 142; PP. 48-80; BIBL. 2 P.Article

ALGEBRAICALLY SPECIFIED PROGRAMMING SYSTEMS AND HOARE'S LOGICBERGSTRA JA; TUCKER JV.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 348-362; BIBL. 30 REF.Conference Paper

AXIOMS FOR THE TERM-WISE CORRECTNESS OF PROGRAMSSOKOXOWSKI S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 499-507; BIBL. 3 REF.Conference Paper

CONSTRUCTING SPECIFICATIONS OF ABSTRACT DATA TYPES BY REPLACEMENTSEHRICH HD; LOHBERGER VG.1979; LECTURE NOTES COMPUTERS SCI.; DEU; DA. 1979; VOL. 73; PP. 180-191; BIBL. 21 REF.Conference Paper

  • Page / 5