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

SELF-STABILIZING PROGRAMS: THE FAULT-TOLERANT CAPABILITY OF SELF-CHECKING PROGRAMSMILI A.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 7; PP. 685-689; BIBL. 6 REF.Article

COMPARING AND PUTTING TOGETHER RECURSIVE PATH ORDERING, SIMPLIFICATION ORDERINGS AND NON-ASCENDING PROPERTY FOR TERMINATION PROOFS OF TERM REWRITING SYSTEMSPETTOROSSI A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 432-447; BIBL. 12 REF.Conference Paper

TIMESETS: A NEW METHOD FOR TEMPORAL REASONING ABOUT PROGRAMSLAMPORT L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 177-196; BIBL. 7 REF.Conference Paper

PROVING PROGRAMS CORRECT THROUGH REFINEMENT.CORRELL CH.1978; ACTA INFORMAT.; ALLEM.; DA. 1978; VOL. 9; NO 2; PP. 121-132; BIBL. 16 REF.Article

A PROOF METHOD FOR CYCLIC PROGRAMS.FRANCEZ N; PNUELI A.1978; ACTA INFORMAT.; ALLEM.; DA. 1978; VOL. 9; NO 2; PP. 133-157; BIBL. 12 REF.Article

ABSTRACTIONS, INSTANTIATIONS, AND PROOFS OF MARKING ALGORITHMS.YELOWITZ L; DUNCAN AG.1977; SIGPLAN NOT.; U.S.A.; DA. 1977; VOL. 12; NO 8; PP. 13-21; BIBL. 1 P.; (SYMP. ARTIF. INTELL. PROGRAM. LANG. PROC.; ROCHESTER, N.Y.; 1977)Conference Paper

IN DEFENSE OF PROGRAM TESTING OR CORRECTNESS PROOFS CONSIDERED HARMFULL.TANENBAUM AS.1976; SIGPLAN NOT.; U.S.A.; DA. 1976; VOL. 11; NO 5; PP. 64-68; BIBL. 10 REF.Article

FINDING INVARIANT ASSERTIONS FOR PROVING PROGRAMS.CAPLAIN M.sdIN: INT. CONF. RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 165-171; BIBL. 8 REF.Conference Paper

HOW TO WRITE CORRECT PROGRAMS AND KNOW IT.MILLS HD.sdIN: INT. CONF. RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 363-370; BIBL. 23 REF.Conference Paper

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

HOARE'S LOGIC IS INCOMPLETE WHEN IT DOES NOT HAVE TO BEBERGSTRA J; CHMIELINSKA A; TIURYN J et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 9-23; BIBL. 6 REF.Conference Paper

THE INTERPLAY BETWEEN MATHEMATICS AND COMPUTER SCIENCESCHWARTZ JT.1978; ACM 78. ASSOCIATION FOR COMPUTING MACHINERY. ANNUAL CONFERENCE/1978-12-4/WASHINGTON DC; USA; NEW YORK: THE ASSOCIATION FOR COMPUTING MACHINERY; DA. 1978; PP. 1-9Conference Paper

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