ANOTHER INCOMPLETENESS RESULT FOR HOARE'S LOGICBERGSTRA JA; CHMIELINSKA A; TIURYN J et al.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 159-171; BIBL. 8 REF.Article

AN AXIOMATIC BASIS FOR PROVING TOTAL CORRECTNESS OF GOTO-PROGRAMS.WANG A.1976; B.I.T.; DANM.; DA. 1976; VOL. 16; NO 1; PP. 88-102; BIBL. 6 REF.Article

A VIEW OF PROGRAM VERIFICATION.LONDON RL.sdIN: INT. CONF. RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 534-545; BIBL. 2 P.Conference Paper

ZUR TESTFALLGENERIERUNG IN DER ENTWURFSPHASE = GENERATION DE CAS TEST A PARTIR DES SPECIFICATIONS DE CONCEPTIONGMEINER L.1983; KERNFORSCHUNGSZENTRUM KARLSRUHE; ISSN 0303-4003; DEU; DA. 1983; NO 3538; 111 P.; ABS. ENG; BIBL. 8 P.Serial Issue

ON FORMAL AND INFORMAL PROOFS FOR PROGRAM CORRECTNESSCULIK K.1983; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1983; VOL. 18; NO 1; PP. 23-28; BIBL. 12 REF.Article

DETERMINISTIC PROPOSITIONAL DYNAMIC LOGIC: FINITE MODELS, COMPLEXITY, AND COMPLETENESSMORDECHAI BAE BEN ARI; HALPERN JY; PNUELLI A et al.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 3; PP. 402-417; BIBL. 10 REF.Article

PROVING PROGRAMS INCORRECT.BRAND D.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 201-227; BIBL. 1 P.Conference Paper

WEAK MUTATION TESTING AND COMPLETENESS OF TEST SETSHOWDEN WE.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 4; PP. 371-379; BIBL. 29 REF.Article

GLOBAL AND LOCAL INVARIANTS IN TRANSITION SYSTEMSSIFAKIS JOSEPH.1981; ; FRA; DA. 1981; IMAG-RR/274; 26 P.; 30 CM; ABS. FRE; BIBL. 3 P.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR 274]Report

TECNICHE DI INTELLIGENZA ARTIFICIALE NELLA VERIFICA ED ANALISI DI PROGRAMMI = TECHNIQUES DE L'INTELLIGENCE ARTIFICIELLE POUR LA VERIFICATION ET L'ANALYSE DE PROGRAMMESDEGANO P; SIROVICH F.1981; RIV. INFORM.; ISSN 0390-668X; ITA; DA. 1981; VOL. 11; NO 3; SUPPL.; PP. 93-104; BIBL. 7 P.Article

Efficient execution in a class of term rewriting systemsSUGIYAMA, Y; TANIGUCHI, K; KASAMI, T et al.Systems, computers, controls. 1982, Vol 13, Num 4, pp 22-30, issn 0096-8765Article

NONSTANDARD RUNS OF FLOYD-PROVABLE PROGRAMSNEMETI I.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 186-204; BIBL. 23 REF.Conference Paper

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

FORMAL CORRECTNESS PROOFS OF A NONDETERMINISTIC PROGRAMUPFAL E.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 2; PP. 86-92; BIBL. 7 REF.Article

PROCEDURE CALL PROOF RULES AND THEIR APPLICATIONSARAKI K; USHIJIMA K.1982; TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS OF JAPAN. SECTION E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 6; PP. 318-324; BIBL. 14 REF.Article

CORRECTNESS OF PROGRAMS WITH FUNCTION PROCEDURESDE BAKKER JW; KLOP JW; MEYER JJC et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 94-112; BIBL. 23 REF.Conference Paper

ON INDUCTION VS-CONTINUITYKOZEN D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 167-176; BIBL. 15 REF.Conference Paper

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

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

ON PROGRAM TESTING CRITERIAKUO CHUNG TAI.1979; COMPSAC 79. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 3/1979/CHICAGO IL; USA; NEW YORK: IEEE; DA. 1979; PP. 494-499; BIBL. 7 REF.Conference Paper

SOCIAL PROCESSES AND PROOFS OF THEOREMS AND PROGRAMSDE MILLO RA; LIPTON RJ; PERLIS AJ et al.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 5; PP. 271-280; BIBL. 20 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

TOWARD A BETTER METHOD OF SOFTWARE TESTINGHALLIN TG; HANSEN RC.1978; COMPSAC 78. INTERNATIONAL COMPUTER SOFTWARE APPLICATIONS CONFERENCE. 2/1978-11-13/CHICAGO; USA; NEW YORK: IEEE; DA. 1978; PP. 153-157; BIBL. 8 REF.Conference Paper

AN EXERCISE IN PROVING PARALLEL PROGRAMS CORRECT.GRIES D.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 12; PP. 921-930; BIBL. 7 REF.Article

CARACTERISATION DE STRUCTURES DE DONNEES PAR LES FONCTIONS D'ACCES: APPLICATION A LA VERIFICATION DES PROGRAMMES.BERT D.1976; IN: PANORAMA NOUV. INF. FRANCE. CONGR. AFCET; GIF-SUR-YVETTE; 1976; PARIS; ITC; DA. 1976; VOL. 2; PP. 547-559; BIBL. 9 REF.Conference Paper