关注
Nissim Francez
Nissim Francez
Computer Science Faculty, Technion
在 cs.technion.ac.il 的电子邮件经过验证
标题
引用次数
引用次数
年份
Fairness
N Francez
Springer Science & Business Media, 2012
8692012
Finite-memory automata
M Kaminski, N Francez
Theoretical Computer Science 134 (2), 329-363, 1994
4891994
A proof system for communicating sequential processes
KR Apt, N Francez, WP De Roever
ACM Transactions on Programming Languages and Systems (TOPLAS) 2 (3), 359-385, 1980
4871980
Distributed termination
N Francez
ACM Transactions on Programming Languages and Systems (TOPLAS) 2 (1), 42-55, 1980
3681980
Decomposition of distributed programs into communication-closed layers
T Elrad, N Francez
Science of Computer programming 2 (3), 155-173, 1982
2791982
Appraising fairness in languages for distributed programming
KR Apt, N Francez, S Katz
Distributed Computing 2, 226-241, 1988
2381988
Interacting processes: A multiparty approach to coordinated distributed programming
N Francez, IR Forman
ACM Press/Addison-Wesley Publishing Co., 1996
2371996
Program verification
N Francez
Addison-Wesley Longman Publishing Co., Inc., 1992
1601992
A compositional approach to superimposition
L Bougé, N Francez
Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of …, 1988
1491988
Achieving distributed termination without freezing
N Francez, M Rodeh
IEEE Transactions on Software Engineering, 287-292, 1982
1441982
Semantics of nondeterminism, concurrency, and communication
N Francez, CAR Hoare, DJ Lehmann, WP Roever
J. Comput. Syst. Sci. 19 (3), 290-308, 1979
1401979
Proof-theoretic semantics
N Francez
College Publications, 2015
1332015
Temporal prepositions and temporal generalized quantifiers
I Pratt, N Francez
Linguistics and Philosophy 24, 187-222, 2001
1182001
Asynchronous unison
JM Couvreur, N Francez, MG Gouda
ICDCS 92, 486-493, 1992
1081992
Script: A communication abstraction mechanism and its verification
N Francez, B Hailpern, G Taubenfeld
Science of Computer Programming 6, 35-88, 1986
108*1986
A linear-history semantics for languages for distributed programming
N Francez, D Lehmann, A Pnueli
Theoretical Computer Science 32 (1-2), 25-46, 1984
911984
A proof rule for fair termination of guarded commands
O Grumberg, N Francez, JA Makowsky, WP de Roever
Information and Control 66 (1-2), 83-102, 1985
891985
E-type pronouns, i-sums, and donkey anaphora
S Lappin, N Francez
Linguistics and Philosophy 17, 391-428, 1994
871994
A proof method for cyclic programs
N Francez, A Pnueli
Acta Informatica 9, 133-157, 1978
841978
Proof-theoretic semantics for a natural language fragment
N Francez, R Dyckhoff
Linguistics and Philosophy 33, 447-477, 2010
802010
系统目前无法执行此操作，请稍后再试。
文章 1–20