A CONTRIBUTION TO TOPOLOGICAL APPROACH IN PATTERN RECOGNITIONMILACIC MM.1983; INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH; ISSN 0020-7543; GBR; DA. 1983; VOL. 21; NO 3; PP. 413-424; ABS. FRE/GER; BIBL. 4 REF.Article

COFIBRATIONS AND THE REALIZATION OF NON-DETERMINISTIC AUTOMATAKASANGIAN S; KELLY GM; ROSSI F et al.1983; CAHIERS DE TOPOLOGIE ET GEOMETRIE DIFFERENTIELLE; ISSN 0008-0004; FRA; DA. 1983; VOL. 24; NO 1; PP. 23-46; BIBL. 12 REF.Article

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

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

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

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

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

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

A FORMAL SYSTEM FOR PARALLEL PROGRAMS IN DISCRETE TIME AND SPACEKAWAI H.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 156-165; BIBL. 15 REF.Conference Paper

A SPECIFICATION SCHEMA FOR INDENTING PROGRAMSMATETI P.1983; SOFTWARE, PRACTICE AND EXPERIENCE; ISSN 0038-0644; GBR; DA. 1983; VOL. 13; NO 2; PP. 163-179; BIBL. 7 REF.Article

EXTENDED NAMING CONVENTIONS FOR COMMUNICATING PROCESSESFRANCEZ N.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 40-45; BIBL. 7 REF.Conference Paper

FAIRNESS AND RELATED PROPERTIES IN TRANSITION SYSTEMS. A TIME LOGIC TO DEAL WITH FAIRNESSQUEILLE JP; SIFAKIS J.1982; ; FRA; DA. 1982; IMAG-RR/292; 30 P.; 30 CM; ABS. FRE; BIBL. 2 P.;[RAPP. RECH. - LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-292]Report

ON EFFECTIVE AXIOMATIZATIONS OF HOARE LOGICSCLARKE EM JR; GERMAN SM; HALPERN JY et al.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 309-321; BIBL. 12 REF.Conference Paper

UNFOLD/FOLD PROGRAM TRANSFORMATIONS = TRANSFORMATIONS DE PROGRAMME PAR PLIAGE/DEPLIAGEKOTT LAURENT.1982; ; FRA; DA. 1982; INRIA/RR-155; 28 P.; 30 CM; ABS. FRE; BIBL. 25 REF.;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 155]Report

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 CHARACTERIZATION OF FLOYD-PROVABLE PROGRAMSANDREKA H; NEMETI I; SAIN I et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 162-171; BIBL. 11 REF.Conference Paper

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

MORE ON ADVICE ON STRUCTURING COMPILERS AND PROVING THEM CORRECTTHATCHER JW; WAGNER EG; WRIGHT JB et al.1980; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1980; NO 94; PP. 165-188; BIBL. 2 P.Conference Paper