SUGGESTIONS FOR COMPOSING AND SPECIFYING PROGRAM DESIGN DECISIONSSINTZOFF M.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 311-326; BIBL. 2 P.Conference Paper

TRANSFORMATION METHODS FOR IMPROVING PARALLEL PROGRAMSSINTZOFF M.1982; PHILIPS TECHNICAL REVIEW; ISSN 0031-7926; NLD; DA. 1982; VOL. 40; NO 8-9; PP. 278-285; BIBL. 5 REF.Article

FORMAL DERIVATION OF STRONGLY CORRECT CONCURRENT PROGRAMSVAN LAMSWEERDE A; SINTZOFF M.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 1; PP. 1-31; BIBL. 21 REF.Article

CONSTRUCTING CORRECT AND EFFICIENT CONCURRENT PROGRAMS.SINTZOFF M; VAN LAMSWEERDE A.sdIN: INT. CONF. RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 319-326; BIBL. 24 REF.Conference Paper

DISTRIBUTED TERMINATION WITH INTERVAL ASSERTIONSFRANCEZ N; RODEH M; SINTZOFF M et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 280-291; BIBL. 10 REF.Conference Paper

Derivation of a parsing algorithm in Martin-Löf's theory of typesCHISHOLM, P; SINTZOFF, M.Science of computer programming. 1987, Vol 8, Num 1, pp 1-42, issn 0167-6423Article

A «division» transformation for program and data structures and the structure clash problemMICHEL, B; SINTZOFF, M.Science of computer programming. 1988, Vol 10, Num 3, pp 247-280, issn 0167-6423Article

Nondeterministic data flow programs: how to avoid the merge anomalyBROY, M; SINTZOFF, M.Science of computer programming. 1988, Vol 10, Num 1, pp 65-85, issn 0167-6423Article

Rewriting systems on FP expressions to reduce the number of sequences yieldedBELLEGARDE, F; SINTZOFF, M.Science of computer programming. 1986, Vol 6, Num 1, pp 11-34, issn 0167-6423Article

Algebraic composition and refinement of proofsSIMONS, M; SINTZOFF, M.Lecture notes in computer science. 1997, pp 494-508, issn 0302-9743, isbn 3-540-63888-1Conference Paper

Comparaison du rendement financier de deux peuplements équiennes d'épicea commun (Trou de la heurette, Hotte-Fauvillers) = Comparing financial yield for two Spruce evenaged forest standsDE RYCK, M; ROOSENS, N; SINTZOFF, M et al.Silva Belgica. 1993, Vol 100, Num 1, pp 13-15, issn 0776-7153Article

Generating function versions with rational strictness patternsHALL, C. V; WISE, D. S; SINTZOFF, M et al.Science of computer programming. 1989, Vol 12, Num 1, pp 39-74, issn 0167-6423Article

The origin of a binary-search paradigmMANNA, Z; WALDINGER, R; SINTZOFF, M et al.Science of computer programming. 1987, Vol 9, Num 1, pp 37-83, issn 0167-6423Article

McLaren's masterpieceGRIES, D; PRINS, J. F; SINTZOFF, M et al.Science of computer programming. 1987, Vol 8, Num 2, pp 139-145, issn 0167-6423Article

Script: a communication abstraction mechanism and its verificationNISSIM FRANCEZ; HAILPERN, B; TAUBENFELD, G et al.Science of computer programming. 1986, Vol 6, Num 1, pp 35-88, issn 0167-6423Article

Program derivation through transformations: the evolution of list-copying algorithmsVAN DIEPEN, N. W. P; DE ROEVER, W. P; SINTZOFF, M et al.Science of computer programming. 1986, Vol 6, Num 3, pp 213-272, issn 0167-6423Article

Formal derivation of a pattern matching algorithmBIRD, R. S; GIBBONS, J; JONES, G et al.Science of computer programming. 1989, Vol 12, Num 2, pp 93-104, issn 0167-6423Article