Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("FRANCEZ N")

Publication Year[py]

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

Discipline (document) [di]

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 33

  • Page / 2
Export

Selection :

  • and

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

A CASE FOR A FORWARD PREDICATE TRANSFORMER.FRANCEZ N.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 196-198; BIBL. 3 REF.Article

AN APPLICATION OF A METHOD FOR ANALYSIS OF CYCLIC PROGRAMSFRANCEZ N.1978; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1978; VOL. 4; NO 5; PP. 371-378; BIBL. 18 REF.Article

ANOTHER ADVANTAGE OF KEYWORD NOTATION FOR PARAMETER COMMUNICATION WITH SUBPROGRAMS.FRANCEZ N.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 8; PP. 604-605; BIBL. 4 REF.Article

Cooperating proofs for distributed programs with multiparty interactionsFRANCEZ, N.Information processing letters. 1989, Vol 32, Num 5, pp 235-242, issn 0020-0190Article

On the direction of fibring feature logics with concatenation logicsFRANCEZ, N.Report - Information systems. 1997, Num 6, pp 1-9, issn 1386-3681Article

ON THE NON-COMPACTNESS OF THE CLASS OF PROGRAM SCHEMAS. = SUR LA NON-COMPACITE DE LA CLASSE DES SCHEMAS DE PROGRAMMESFRANCEZ N; SLUTZKY G.1973; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1973; VOL. 2; NO 5; PP. 141-142; BIBL. 3 REF.Article

A WEAKEST PRECONDITION SEMANTICS FOR COMMUNICATING PROCESSESELRAD T; FRANCEZ N.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 78-90; BIBL. 19 REF.Conference Paper

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

Hypothetical-reasoning and radical non-constituent coordination in categorial logicFRANCEZ, N.Report - Information systems. 1997, Num 7, pp 1-11, issn 1386-3681Article

Product properties and their direct verificationFRANCEZ, N.Acta informatica. 1983, Vol 20, Num 4, pp 329-344, issn 0001-5903Article

ACHIEVING DISTRIBUTED TERMINATION WITHOUT FREEZINGFRANCEZ N; RODEH M.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 3; PP. 287-292; BIBL. 17 REF.Article

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

BACKTRACKING IN RECURSIVE COMPUTATIONS.FRANCEZ N; KLEBANSKY B; PNUELI A et al.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 2; PP. 125-144; BIBL. 15 REF.Article

SEMANTICS OF NONDETERMINISM, CONCURRENCY, AND COMMUNICATIONFRANCEZ N; HOARE CAR; LEHMANN DJ et al.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 290-308; BIBL. 23 REF.Article

Fairness and the axioms of control predicatesFRANCEZ, N; KATZ, S.International journal of parallel programming. 1987, Vol 16, Num 4, pp 263-278, issn 0885-7458Article

Modeling the distributed termination convention of CSPAPT, K. R; FRANCEZ, N.ACM transactions on programming languages and systems. 1984, Vol 6, Num 3, pp 370-379, issn 0164-0925Article

Fairness in context-free grammars under every choice-strategyPORAT, S; FRANCEZ, N.Information and computation (Print). 1989, Vol 80, Num 3, pp 249-268, issn 0890-5401Article

Symmetric intertask communicationFRANCEZ, N; YEMINI, S. A.ACM transactions on programming languages and systems. 1985, Vol 7, Num 4, pp 622-636, issn 0164-0925Article

Splitting the reference time : The analogy between nominal and temporal anaphora revisited = Eclatement du temps de référence : L'analogie entre l'anaphore nominale et temporelle revisitéeNELKEN, R; FRANCEZ, N.Journal of semantics (Nijmegen). 1997, Vol 14, Num 4, pp 369-416, issn 0167-5133Article

Bilattices and the semantics of natural language questions = Bitreillis et sémantique des questions en langage naturelNELKEN, R; FRANCEZ, N.Linguistics and philosophy. 2002, Vol 25, Num 1, pp 37-64, issn 0165-0157Article

Finite-state unification automata and relational languagesSHEMESH, Y; FRANCEZ, N.Information and computation (Print). 1994, Vol 114, Num 2, pp 192-213, issn 0890-5401Article

Program composition via unificationFIX, L; FRANCEZ, N; GRUMBERG, O et al.Theoretical computer science. 1994, Vol 131, Num 1, pp 139-179, issn 0304-3975Article

Appraising fairness in languages for distributed programmingAPT, K. R; FRANCEZ, N; KATZ, S et al.Distributed computing. 1988, Vol 2, Num 4, pp 226-241, issn 0178-2770Article

On fibring feature logics with concatenation logicsFRANCEZ, N.Lecture notes in computer science. 1999, pp 200-211, issn 0302-9743, isbn 3-540-65751-7Conference Paper

  • Page / 2