Nissim Francez

157 papers A* 18A 5B 7C 1Journal 101Unranked 22
YearRankTypeTitle / Venue / Authors
2025 J jnl
Another Look at Modality and Connexivity.
Logica Universalis
Nissim Francez
2025 J jnl
Negation-cohesive connectives: a generalization of connexivity.
Log. J. IGPL
Nissim Francez
2023 J jnl
A Dialectic Contra-Classical Logic.
Logica Universalis
Nissim Francez
2022 J jnl
A Generalization of Falsity in Finitely-many Valued Logics.
Fundam. Informaticae
Nissim Francez
2022 J jnl
A generalization of falsity in finitely-many valued logics.
CoRR
Nissim Francez
2021 J jnl
Bilateralism based on Corrective Denial.
FLAP
Nissim Francez
2021 J jnl
Calculi for Many-Valued Logics.
Logica Universalis
Michael Kaminski, Nissim Francez
2021 J jnl
On the Role of Aristotle's Connexive Axioms in Non-connexive Logics.
FLAP
Nissim Francez
2020 J jnl
Connexive Restricted Quantification.
Notre Dame J. Formal Log.
Nissim Francez
2020 J jnl
De Morgan Interpretation of the Lambek-Grishin Calculus.
Rev. Symb. Log.
Michael Kaminski, Nissim Francez
2019 J jnl
Another plan for negation.
Australas. J. Log.
Nissim Francez
2019 J jnl
Bilateralism, Trilateralism, Multilateralism and Poly-Sequents.
J. Philos. Log.
Nissim Francez
2019 J jnl
On Beall's New Interpretation of $$WK_{3}$$ W K 3.
J. Log. Lang. Inf.
Nissim Francez
2019 J jnl
On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics.
FLAP
Nissim Francez, Michael Kaminski
2019 J jnl
Structural Rules for Multi-valued Logics.
Logica Universalis
Nissim Francez, Michael Kaminski
2018 J jnl
Bilaterilism does Provide a Proof Theoretic Treatment of Classical Logic (for non-technical reasons).
FLAP
Nissim Francez
2018 J jnl
Diversification of Object-Languages for Propositional Logics.
J. Log. Lang. Inf.
Nissim Francez
2017 J jnl
A Proof Theory for First-order Logic with Definiteness.
FLAP
Nissim Francez, Bartosz Wieckowski
2017 J jnl
A Proof-Theoretic Semantics for Adjectival Modification.
J. Log. Lang. Inf.
Nissim Francez
2017 J jnl
A Proof-Theoretic Semantics for Exclusion.
Logica Universalis
Nissim Francez, Michael Kaminski
2017 — conf
A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object.
MOL
Nissim Francez
2017 J jnl
On harmony and permuting conversions.
J. Appl. Log.
Nissim Francez
2016 J jnl
Natural Deduction for Two Connexive Logics.
FLAP
Nissim Francez
2016 J jnl
Proof-Theoretic Semantics for Intensional Transitive Verbs.
J. Semant.
Nissim Francez
2016 J jnl
Relevant harmony.
J. Log. Comput.
Nissim Francez
2016 J jnl
The Lambek Calculus Extended with Intuitionistic Propositional Logic.
Stud Logica
Michael Kaminski, Nissim Francez
2016 J jnl
Views of proof-theoretic semantics: reified proof-theoretic meanings.
J. Log. Comput.
Nissim Francez
2015 J jnl
A proof-theoretic universal property of determiners.
J. Appl. Log.
Nissim Francez
2015 J jnl
On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics.
Logica Universalis
Nissim Francez
2015 J jnl
On the Notion of Canonical Derivations from Open Assumptions and its Role in Proof-Theoretic Semantics.
Rev. Symb. Log.
Nissim Francez
2015 J jnl
Proof-Theoretic Reconstruction of Generalized Quantifiers.
J. Semant.
Nissim Francez, Gilad Ben-Avi
2014 J jnl
A Logic Inspired by Natural Language: Quantifiers As Subnectors.
J. Philos. Log.
Nissim Francez
2014 J jnl
A proof-theoretic semantics for contextual domain restriction.
J. Lang. Model.
Nissim Francez
2014 J jnl
Bilateral Relevant Logic.
Rev. Symb. Log.
Nissim Francez
2014 J jnl
Bilateralism in Proof-Theoretic Semantics.
J. Philos. Log.
Nissim Francez
2014 J jnl
Harmony in Multiple-Conclusion Natural-Deduction.
Logica Universalis
Nissim Francez
2014 J jnl
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.
Stud Logica
Michael Kaminski, Nissim Francez
2014 — conf
The Granularity of Meaning in Proof-Theoretic Semantics.
LACL
Nissim Francez
2012 J jnl
A Note on Harmony.
J. Philos. Log.
Nissim Francez, Roy Dyckhoff
2012 J jnl
Editors' Preface.
Stud Logica
Nissim Francez, Ian Pratt-Hartmann
2012 J jnl
When are different type-logical semantic definitions defining equivalent meanings?
J. Comput. Syst. Sci.
Nissim Francez
2011 J jnl
Proof-Theoretic Semantic Values for Logical operators.
Rev. Symb. Log.
Nissim Francez, Gilad Ben-Avi
2010 J jnl
Extending Free Pregroups with Lower Bounds.
Stud Logica
Tamar Aizikowitz, Nissim Francez, Daniel Genkin, Michael Kaminski
2010 — conf
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars.
Essays in Memory of Amir Pnueli
Daniel Genkin, Nissim Francez, Michael Kaminski
2010 J jnl
Proof-Theoretic Semantics for Subsentential Phrases.
Stud Logica
Nissim Francez, Roy Dyckhoff, Gilad Ben-Avi
2009 — conf
Proof-Theoretic Semantics for a Natural Language Fragment.
MOL
Nissim Francez, Roy Dyckhoff
2008 J jnl
Commutation-augmented pregroup grammars and push-down automata with cancellation.
Inf. Comput.
Nissim Francez, Michael Kaminski
2008 J jnl
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules.
Stud Logica
Sharon Shoham, Nissim Francez
2007 J jnl
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages.
Stud Logica
Nissim Francez, Michael Kaminski
2007 C conf
Pushdown automata with cancellation and commutation-augmented pregroups grammars.
LATA
Nissim Francez, Michael Kaminski
2006 J jnl
A 'Natural Logic' inference system using the Lambek calculus.
J. Log. Lang. Inf.
Anna Zamansky, Nissim Francez, Yoad Winter
2006 J jnl
A Lambek Automaton.
Log. J. IGPL
Tatyana Veksler, Nissim Francez
2005 — conf
Lambek-Calculus with General Elimination Rules and Continuation Semantics.
LACL
Nissim Francez
2005 J jnl
Unification Grammars and Off-Line Parsability.
J. Log. Lang. Inf.
Efrat Jaeger, Nissim Francez, Shuly Wintner
2003 J jnl
An algebraic characterization of deterministic regular languages over infinite alphabets.
Theor. Comput. Sci.
Nissim Francez, Michael Kaminski
2003 J jnl
Order-Based Inference in Natural Logic.
Log. J. IGPL
Yaroslav Fyodorov, Yoad Winter, Nissim Francez
2002 B conf
Guaranteeing Parsing Termination of Unification Grammars.
COLING
Efrat Jaeger, Nissim Francez, Shuly Wintner
2000 B conf
Querying Temporal Databases Using Controlled Natural Language.
COLING
Rani Nelken, Nissim Francez
2000 J jnl
The Algebraic Semantics of Interrogative NPs.
Grammars
Rani Nelken, Nissim Francez
1999 J jnl
Off-Line Parsability and the Well-Foundedness of Subsumption.
J. Log. Lang. Inf.
Shuly Wintner, Nissim Francez
1999 J jnl
Similarity Preservation in Default Logic.
Ann. Math. Artif. Intell.
Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski
1998 J jnl
A Logic-Based Approach to Program Flow Analysis.
Acta Informatica
Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm
1998 — conf
A proof theory of asynchronously communicating sequential processes.
PROCOMET
Frank S. de Boer, Nissim Francez, M. van Hulst, Frank A. Stomp
1998 — conf
Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar.
LACL
Nissim Francez
1998 B conf
System Demonstration Natural Language Generation With Abstract Machine.
INLG
Evgeniy Gabrilovich, Nissim Francez, Shuly Wintner
1997 J jnl
Amalia - A Unified Platform for Parsing and Generation
CoRR
Shuly Wintner, Evgeniy Gabrilovich, Nissim Francez
1997 J jnl
Off-line Parsability and the Well-foundedness of Subsumption
CoRR
Shuly Wintner, Nissim Francez
1997 — conf
On Fibring Feature Logics with Concatenation Logics.
LACL
Nissim Francez
1997 J jnl
Splitting the Reference Time: The Analogy between Nominal and Temporal Anaphora Revisited1.
J. Semant.
Rani Nelken, Nissim Francez
1996 A* conf
Automatic Translation of Natural Language System Specifications.
CAV
Rani Nelken, Nissim Francez
1996 — book
Interacting processes - a multiparty approach to coordinated distributed processing.
Nissim Francez, Ira R. Forman
1996 J jnl
Parsing with Typed Feature Structures
CoRR
Shuly Wintner, Nissim Francez
1996 J jnl
Parsing with Typed Feature Structures
CoRR
Shuly Wintner, Nissim Francez
1995 J jnl
Abstract Machine for Typed Feature Structures
CoRR
Shuly Wintner, Nissim Francez
1995 J jnl
Contrastive Logic.
Log. J. IGPL
Nissim Francez
1995 — conf
Parsing with Typed Feature Structures.
IWPT
Shuly Wintner, Nissim Francez
1995 J jnl
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT
CoRR
Rani Nelken, Nissim Francez
1995 A conf
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT.
EACL
Rani Nelken, Nissim Francez
1994 J jnl
Abstract Machine for Typed Feature Structures.
CoRR
Shuly Wintner, Nissim Francez
1994 J jnl
Fairness in term rewriting systems.
Methods Log. Comput. Sci.
Sara Porat, Nissim Francez
1994 J jnl
Finite-Memory Automata.
Theor. Comput. Sci.
Michael Kaminski, Nissim Francez
1994 J jnl
Finite-State Unification Automata and Relational Languages
Inf. Comput.
Yael Shemesh, Nissim Francez
1994 J jnl
Program Composition via Unification.
Theor. Comput. Sci.
Limor Fix, Nissim Francez, Orna Grumberg
1993 J jnl
Fairness and Hyperfairness in Multi-Party Interactions.
Distributed Comput.
Paul C. Attie, Nissim Francez, Orna Grumberg
1992 A conf
Asynchronous Unison (Extended Abstract).
ICDCS
Jean-Michel Couvreur, Nissim Francez, Mohamed G. Gouda
1992 J jnl
On Equivalence-Completions of Fairness Assumtions.
Formal Aspects Comput.
Nissim Francez, Ralph-Johan Back, Reino Kurki-Suonio
1992 A* conf
Program Composition via Unification.
ICALP
Limor Fix, Nissim Francez, Orna Grumberg
1992 — book
Program verification.
Nissim Francez
1991 J jnl
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View".
Inf. Process. Lett.
Martín Abadi, Bowen Alpern, Krzysztof R. Apt, Nissim Francez, Shmuel Katz, Leslie Lamport, Fred B. Schneider
1991 A* conf
Program Composition and Modular Verification.
ICALP
Limor Fix, Nissim Francez, Orna Grumberg
1991 B conf
Synchrony Loosening Transformations for Interacting Processes.
CONCUR
Nissim Francez, Ira R. Forman
1990 — conf
A Logic-Based Approach to Data Flow Analysis Problem.
PLILP
Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm
1990 — conf
Conflict Propogation.
ICCL
Nissim Francez, Ira R. Forman
1990 J jnl
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett.
Nissim Francez
1990 J jnl
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett.
Nissim Francez
1990 — conf
Distributed Logic Programming.
Dagstuhl Seminar on Parallelization in Inference Systems
Nissim Francez
1990 A* conf
Fairness and Hyperfairness in Multi-Party Interactions.
POPL
Paul C. Attie, Nissim Francez, Orna Grumberg
1990 A* conf
Finite-Memory Automata (Extended Abstract)
FOCS
Michael Kaminski, Nissim Francez
1990 — conf
Interacting processes: a language for coordinated distributed programming.
Jerusalem Conference on Information Technology
Nissim Francez, Ira R. Forman
1990 B conf
On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs.
JELIA
Amir Rahat, Nissim Francez, Oded Shmueli
1990 — conf
Sematics-Driven Decompositions for the Verification of Distributed Programs.
Programming Concepts and Methods
Limor Fix, Nissim Francez, Orna Grumberg
1990 B conf
Superimposition for Interacting Processes.
CONCUR
Nissim Francez, Ira R. Forman
1989 J jnl
Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett.
Nissim Francez
1989 J jnl
Fairness in Context-Free Grammars under Every Choice-strategy
Inf. Comput.
Sara Porat, Nissim Francez
1989 J jnl
Multiparty Interactions for Interprocess Communication and Synchronization.
IEEE Trans. Software Eng.
Michael Evangelist, Nissim Francez, Shmuel Katz
1989 A* conf
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.
POPL
Shmuel Sagiv, Orit Edelstein, Nissim Francez, Michael Rodeh
1988 A* conf
A Compositional Approach to Superimposition.
POPL
Luc Bougé, Nissim Francez
1988 J jnl
Appraising Fairness in Languages for Distributed Programming.
Distributed Comput.
Krzysztof R. Apt, Nissim Francez, Shmuel Katz
1988 J jnl
Infinite Trees, Markings and Well-Foundedness
Inf. Comput.
Ran Rinat, Nissim Francez, Orna Grumberg
1987 A* conf
Appraising Fairness in Languages for Distributed Programming.
POPL
Krzysztof R. Apt, Nissim Francez, Shmuel Katz
1987 J jnl
Fairness and the axioms of control predicates.
Int. J. Parallel Program.
Nissim Francez, Shmuel Katz
1986 J jnl
A Complete Rule for Equifair Termination.
J. Comput. Syst. Sci.
Orna Grumberg, Nissim Francez, Shmuel Katz
1986 A* conf
A New Approach to Detection of Locally Indicative Stability.
ICALP
Nir Shavit, Nissim Francez
1986 — book
Fairness.
Nissim Francez
1986 A conf
Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.
CADE
Sara Porat, Nissim Francez
1986 — conf
Infinite Trees, Markings and Well Foundedness.
CAAP
Ran Rinat, Nissim Francez, Orna Grumberg
1986 J jnl
Script: A Communication Abstraction Mechanism and Its Verification.
Sci. Comput. Program.
Nissim Francez, Brent Hailpern, Gadi Taubenfeld
1985 J jnl
A Proof Rule for Fair Termination of Guarded Commands
Inf. Control.
Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever
1985 — conf
An environment for logic programming.
SLIPE
Nissim Francez, Shalom Goldenberg, Ron Y. Pinter, Michael L. Tiomkin, Shalom Tsur
1985 A conf
Fairness in Context-Free Grammars under Canonical Derivations.
STACS
Sara Porat, Nissim Francez
1985 — conf
Fairness in Term Rewriting Systems.
RTA
Sara Porat, Nissim Francez
1985 — conf
Proving Termination of Prolog Programs.
Logic of Programs
Nissim Francez, Orna Grumberg, Shmuel Katz, Amir Pnueli
1985 J jnl
Script: A Communication Abstraction Mechanism.
ACM SIGOPS Oper. Syst. Rev.
Nissim Francez, Brent Hailpern
1985 J jnl
Symmetric Intertask Communication.
ACM Trans. Program. Lang. Syst.
Nissim Francez, Shaula Yemini
1984 J jnl
A Linear-History Semantics for Languages for Distributed Programming.
Theor. Comput. Sci.
Nissim Francez, Daniel Lehmann, Amir Pnueli
1984 J jnl
A Weakest Precondition Semantics for Communicating Processes.
Theor. Comput. Sci.
Tzilla Elrad, Nissim Francez
1984 J jnl
Can Message Buffers Be Axiomatized in Linear Temporal Logic?
Inf. Control.
A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Albert R. Meyer
1984 A* conf
Fail Termination of Communicating Processe.
PODC
Orna Grumberg, Nissim Francez, Shmuel Katz
1984 A* conf
Generalized Fair Termination.
POPL
Nissim Francez, Dexter Kozen
1984 J jnl
Modeling the Distributed Termination Convention of CSP.
ACM Trans. Program. Lang. Syst.
Krzysztof R. Apt, Nissim Francez
1984 — conf
Proof Rules for Communication Abstractions (Abstract).
FSTTCS
Gadi Taubenfeld, Nissim Francez
1984 — conf
Script: A Communication Abstraction Mechanism and its Verification.
Logics and Models of Concurrent Systems
Nissim Francez, Brent Hailpern, Gadi Taubenfeld
1983 — conf
A Compete Proof Rule for Strong Equifair Termination.
Logic of Programs
Orna Grumberg, Nissim Francez, Shmuel Katz
1983 A* conf
A methodology for verifying request processing protocols.
SIGCOMM
Christos Nikolaou, Edmund M. Clarke, Nissim Francez, Stephen A. Schuman
1983 A* conf
Distributed k-Selection: From a Sequential to a Distributed Algorithm.
PODC
Liuba Shrira, Nissim Francez, Michael Rodeh
1983 J jnl
Extended Naming Conventions for Communicating Processes.
Sci. Comput. Program.
Nissim Francez
1983 J jnl
Product Properties and Their Direct Verification.
Acta Informatica
Nissim Francez
1983 A* conf
Script: A Communication Abstraction Mechanism.
PODC
Nissim Francez, Brent Hailpern
1982 J jnl
Achieving Distributed Termination without Freezing.
IEEE Trans. Software Eng.
Nissim Francez, Michael Rodeh
1982 A* conf
Can Message Buffers be Characterized in Linear Temporal Logic?
PODC
A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich
1982 J jnl
Decomposition of Distributed Programs into Communication-Closed Layers.
Sci. Comput. Program.
Tzilla Elrad, Nissim Francez
1982 A* conf
Extended Naming Conventions for Communicating Processes.
POPL
Nissim Francez
1982 J jnl
Fair Deriviations in Context-Free Grammars
Inf. Control.
Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks
1981 A conf
An Experimental Implementation of CSP.
ICDCS
Liuba Shrira, Nissim Francez
1980 A* conf
A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme
FOCS
Nissim Francez, Michael Rodeh
1980 A* conf
A Linear History Semantics for Distributed Languages (Extended Abstract)
FOCS
Nissim Francez, Daniel Lehmann, Amir Pnueli
1980 J jnl
A Proof System for Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst.
Krzysztof R. Apt, Nissim Francez, Willem P. de Roever
1980 J jnl
Distributed Termination.
ACM Trans. Program. Lang. Syst.
Nissim Francez
1979 — conf
On Achieving Distributed Termination.
Semantics of Concurrent Computation
Nissim Francez
1979 J jnl
Semantics of Nondeterminism, Concurrency, and Communication.
J. Comput. Syst. Sci.
Nissim Francez, C. A. R. Hoare, Daniel J. Lehmann, Willem P. de Roever
1978 J jnl
A Proof Method for Cyclic Programs.
Acta Informatica
Nissim Francez, Amir Pnueli
1978 J jnl
An Application of a Method for Analysis of Cyclic Programs.
IEEE Trans. Software Eng.
Nissim Francez
1978 B conf
Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract).
MFCS
Nissim Francez, C. A. R. Hoare, Willem P. de Roever
1977 J jnl
A Case for a Forward Predicate Transformer.
Inf. Process. Lett.
Nissim Francez
1977 J jnl
Another Advantage of Keyword Notation for Parameter Communication with Subprograms.
Commun. ACM
Nissim Francez
1977 J jnl
Backtracking in Recursive Computations.
Acta Informatica
Nissim Francez, Boris Klebansky, Amir Pnueli
1973 J jnl
On the Non-Compactness of the Class of Program Schemas.
Inf. Process. Lett.
Nissim Francez, Giora Slutzki