World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
5156
World Ranking
13514
National Ranking
204

Overview

Nissim Francez is affiliated with the Technion - Israel Institute of Technology in Israel and conducts research primarily in the field of Computer Science. Their work spans multiple subfields, including Artificial Intelligence, Computational Theory and Mathematics, Language and Linguistics, Experimental and Cognitive Psychology, and Algebra and Number Theory.

The scientist's research involves topics related to Logic, Reasoning, and Knowledge, Logic, Programming, and Type Systems, Advanced Algebra and Logic, Semantic Web and Ontologies, Philosophy and Theoretical Science, Syntax, Semantics, and Linguistic Variation, as well as Advanced Topics in Algebra.

Nissim Francez has authored several papers, notably:

  • "Poly-Connexivity: Connexive Conjunction and Disjunction" (2022), Notre Dame Journal of Formal Logic
  • "Proof-theoretic semantics as a resource for expressing semantic variability" (2022), Synthese
  • "A Dialectic Contra-Classical Logic" (2023), Logica Universalis
  • "Calculi for Many-Valued Logics" (2021), Logica Universalis
  • "Toward a generalization of the logic of grounding" (2020), THEORIA An International Journal for Theory History and Foundations of Science

The frequent co-authors that appear in conjunction with Nissim Francez include:

  • Michael Kaminski
  • Francesca Poggiolesi

Repeated publication venues for their work include:

  • Logica Universalis
  • Notre Dame Journal of Formal Logic
  • Logics
  • THEORIA An International Journal for Theory History and Foundations of Science
  • Synthese

Best Publications

  • A Proof System for Communicating Sequential Processes

    Krzysztof R. Apt;Nissim Francez;Willem P. de Roever

  • Finite-memory automata

    Michael Kaminski;Nissim Francez

  • Distributed Termination

    Nissim Francez

  • Decomposition of distributed programs into communication-closed layers

    Tzilla Elrad;Nissim Francez

  • Appraising Fairness in Languages for Distributed Programming

    Krzysztof R. Apt;Nissim Francez;Shmuel Katz

  • Interacting processes: a multiparty approach to coordinated distributed programming

    Nissim Francez;Ira R. Forman

  • Program Verification

    Nissim Francez

  • Achieving Distributed Termination without Freezing

    N. Francez;M. Rodeh

  • A compositional approach to superimposition

    L. Bougé;N. Francez

  • Semantics of nondeterminism, concurrency, and communication☆

    Nissim Francez;C.A.R. Hoare;Daniel J. Lehmann;Willem P. De Roever

  • Temporal prepositions and temporal generalized quantifiers

    Ian Pratt;Nissim Francez

  • Script: a communication abstraction mechanism and its verification

    N. Francez;B. Hailpern;G. Taubenfeld

  • Asynchronous unison

    J.-M. Couvreur;N. Francez;M. Gouda

  • A proof rule for fair termination of guarded commands

    Orna Grumberg;Nissim Francez;Johann A. Makowsky;Willem P. de Roever

  • E-type pronouns, I-sums, and donkey anaphora

    Shalom Lappin;Nissim Francez

  • A proof method for cyclic programs

    Nissim Francez;Amir Pnueli

  • Fairness and hyperfairness in multi-party interactions

    Paul C. Attie;Nissim Francez;Orna Grumberg

  • A linear-history semantics for languages for distributed programming

    N. Francez;D Lehmann;A Pnueli

  • Proof-theoretic semantics for a natural language fragment

    Nissim Francez;Roy Dyckhoff

  • A new approach to detection of locally indicative stability

    Nir Shavit;Nissim Francez

  • Basic simple type theory

    Nissim Francez

Frequent Co-Authors

Orna Grumberg
Orna Grumberg Technion – Israel Institute of Technology
Shmuel Katz
Shmuel Katz Technion – Israel Institute of Technology
Michael Rodeh
Michael Rodeh IBM (United States)
Krzysztof R. Apt
Krzysztof R. Apt Centrum Wiskunde & Informatica
Amir Pnueli
Amir Pnueli Weizmann Institute of Science
Edmund M. Clarke
Edmund M. Clarke Carnegie Mellon University
Daniel Lehmann
Daniel Lehmann Hebrew University of Jerusalem
Daniel Genkin
Daniel Genkin Georgia Institute of Technology
Evgeniy Gabrilovich
Evgeniy Gabrilovich Google (United States)
Reinhard Wilhelm
Reinhard Wilhelm Saarland University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring associates degrees online can be a smart starting point for those new to computer science or seeking flexible study options. These programs are designed for quick entry into tech careers and are accessible from nearly anywhere.

Affordability is another important factor. If cost is a concern, there are cheap online degrees fast that offer legitimate education and recognized credentials, making it easier to upskill without heavy student debt.

Academic history doesn’t have to be a barrier. Many college with low gpa options let students pursue a computer science degree even if their previous grades weren’t ideal. These programs offer new pathways to a tech career.

For those considering intersecting fields, earning a degree in areas like environmental science can open doors to specialized technology roles. There are also high-paying jobs with environmental science degree backgrounds—especially when combined with computing skills.

Best Scientists Citing Nissim Francez

Trending Scientists

Recently Published Articles