| 2008 |
|---|
| 96 | EE | Nissim Francez,
Michael Kaminski:
Commutation-augmented pregroup grammars and push-down automata with cancellation.
Inf. Comput. 206(9-10): 1018-1032 (2008) |
| 95 | EE | Sharon Shoham,
Nissim Francez:
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules.
Studia Logica 90(2): 161-188 (2008) |
| 2007 |
|---|
| 94 | EE | Nissim Francez,
Michael Kaminski:
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages.
Studia Logica 87(2-3): 295-321 (2007) |
| 2006 |
|---|
| 93 | EE | Anna Zamansky,
Nissim Francez,
Yoad Winter:
A 'Natural Logic' inference system using the Lambek calculus.
Journal of Logic, Language and Information 15(3): 273-295 (2006) |
| 92 | EE | Tatyana Veksler,
Nissim Francez:
A Lambek Automaton.
Logic Journal of the IGPL 14(5): 659-708 (2006) |
| 2005 |
|---|
| 91 | EE | Nissim Francez:
Lambek-Calculus with General Elimination Rules and Continuation Semantics.
LACL 2005: 101-113 |
| 90 | EE | Efrat Jaeger,
Nissim Francez,
Shuly Wintner:
Unification Grammars and Off-Line Parsability.
Journal of Logic, Language and Information 14(2): 199-234 (2005) |
| 2003 |
|---|
| 89 | EE | Yaroslav Fyodorov,
Yoad Winter,
Nissim Francez:
Order-Based Inference in Natural Logic.
Logic Journal of the IGPL 11(4): 385-416 (2003) |
| 88 | EE | Nissim Francez,
Michael Kaminski:
An algebraic characterization of deterministic regular languages over infinite alphabets.
Theor. Comput. Sci. 306(1-3): 155-175 (2003) |
| 2002 |
|---|
| 87 | EE | Efrat Jaeger,
Nissim Francez,
Shuly Wintner:
Guaranteeing Parsing Termination of Unification Grammars.
COLING 2002 |
| 2000 |
|---|
| 86 | EE | Rani Nelken,
Nissim Francez:
Querying Temporal Databases Using Controlled Natural Language.
COLING 2000: 1076-1080 |
| 85 | | Rani Nelken,
Nissim Francez:
The Algebraic Semantics of Interrogative NPs.
Grammars 3(2/3): 259-273 (2000) |
| 1999 |
|---|
| 84 | | Rachel Ben-Eliyahu-Zohary,
Nissim Francez,
Michael Kaminski:
Similarity Preservation in Default Logic.
Ann. Math. Artif. Intell. 25(1-2): 137-160 (1999) |
| 83 | | Shuly Wintner,
Nissim Francez:
Off-Line Parsability and the Well-Foundedness of Subsumption.
Journal of Logic, Language and Information 8(1): 1-16 (1999) |
| 1998 |
|---|
| 82 | EE | Nissim Francez:
Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar.
LACL 1998: 31-47 |
| 81 | | Frank S. de Boer,
Nissim Francez,
M. van Hulst,
Frank A. Stomp:
A proof theory of asynchronously communicating sequential processes.
PROCOMET 1998: 49-67 |
| 80 | EE | Shmuel Sagiv,
Nissim Francez,
Michael Rodeh,
Reinhard Wilhelm:
A Logic-Based Approach to Program Flow Analysis.
Acta Inf. 35(6): 457-504 (1998) |
| 1997 |
|---|
| 79 | EE | Nissim Francez:
On Fibring Feature Logics with Concatenation Logics.
LACL 1997: 200-211 |
| 78 | EE | Shuly Wintner,
Nissim Francez:
Off-line Parsability and the Well-foundedness of Subsumption
CoRR cmp-lg/9709011: (1997) |
| 77 | EE | Shuly Wintner,
Evgeniy Gabrilovich,
Nissim Francez:
Amalia - A Unified Platform for Parsing and Generation
CoRR cmp-lg/9709014: (1997) |
| 1996 |
|---|
| 76 | | Rani Nelken,
Nissim Francez:
Automatic Translation of Natural Language System Specifications.
CAV 1996: 360-371 |
| 75 | EE | Shuly Wintner,
Nissim Francez:
Parsing with Typed Feature Structures
CoRR cmp-lg/9601010: (1996) |
| 74 | EE | Shuly Wintner,
Nissim Francez:
Parsing with Typed Feature Structures
CoRR cmp-lg/9601011: (1996) |
| 1995 |
|---|
| 73 | EE | Rani Nelken,
Nissim Francez:
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT.
EACL 1995: 261-266 |
| 72 | EE | Rani Nelken,
Nissim Francez:
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT
CoRR cmp-lg/9502023: (1995) |
| 71 | EE | Shuly Wintner,
Nissim Francez:
Abstract Machine for Typed Feature Structures
CoRR cmp-lg/9504009: (1995) |
| 70 | EE | Nissim Francez:
Contrastive Logic.
Logic Journal of the IGPL 3(5): 725-744 (1995) |
| 1994 |
|---|
| 69 | | Yael Shemesh,
Nissim Francez:
Finite-State Unification Automata and Relational Languages
Inf. Comput. 114(2): 192-213 (1994) |
| 68 | | Limor Fix,
Nissim Francez,
Orna Grumberg:
Program Composition via Unification.
Theor. Comput. Sci. 131(1): 139-179 (1994) |
| 67 | | Michael Kaminski,
Nissim Francez:
Finite-Memory Automata.
Theor. Comput. Sci. 134(2): 329-363 (1994) |
| 1993 |
|---|
| 66 | | Paul C. Attie,
Nissim Francez,
Orna Grumberg:
Fairness and Hyperfairness in Multi-Party Interactions.
Distributed Computing 6(4): 245-254 (1993) |
| 1992 |
|---|
| 65 | | Limor Fix,
Nissim Francez,
Orna Grumberg:
Program Composition via Unification.
ICALP 1992: 672-684 |
| 64 | | Jean-Michel Couvreur,
Nissim Francez,
Mohamed G. Gouda:
Asynchronous Unison (Extended Abstract).
ICDCS 1992: 486-493 |
| 63 | | Nissim Francez,
Ralph-Johan Back,
Reino Kurki-Suonio:
On Equivalence-Completions of Fairness Assumtions.
Formal Asp. Comput. 4(6): 582-591 (1992) |
| 1991 |
|---|
| 62 | | Nissim Francez,
Ira R. Forman:
Synchrony Loosening Transformations for Interacting Processes.
CONCUR 1991: 203-219 |
| 61 | | Limor Fix,
Nissim Francez,
Orna Grumberg:
Program Composition and Modular Verification.
ICALP 1991: 93-114 |
| 60 | | Martín Abadi,
Bowen Alpern,
Krzysztof R. Apt,
Nissim Francez,
Shmuel Katz,
Leslie Lamport,
Fred B. Schneider:
Preserving Liveness: Comments on ``Safety and Liveness from a Methodological Point of View''.
Inf. Process. Lett. 40(3): 141-142 (1991) |
| 1990 |
|---|
| 59 | | Nissim Francez,
Ira R. Forman:
Superimposition for Interacting Processes.
CONCUR 1990: 230-245 |
| 58 | | Nissim Francez:
Distributed Logic Programming.
Dagstuhl Seminar on Parallelization in Inference Systems 1990: 356 |
| 57 | | Michael Kaminski,
Nissim Francez:
Finite-Memory Automata (Extended Abstract)
FOCS 1990: 683-688 |
| 56 | | Nissim Francez,
Ira R. Forman:
Conflict Propogation.
ICCL 1990: 155-168 |
| 55 | | Amir Rahat,
Nissim Francez,
Oded Shmueli:
On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs.
JELIA 1990: 454-471 |
| 54 | | Shmuel Sagiv,
Nissim Francez,
Michael Rodeh,
Reinhard Wilhelm:
A Logic-Based Approach to Data Flow Analysis Problem.
PLILP 1990: 277-292 |
| 53 | | Paul C. Attie,
Nissim Francez,
Orna Grumberg:
Fairness and Hyperfairness in Multi-Party Interactions.
POPL 1990: 292-305 |
| 52 | | Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett. 34(1): 57 (1990) |
| 51 | | Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett. 35(5): 275 (1990) |
| 1989 |
|---|
| 50 | | Shmuel Sagiv,
O. Edelstein,
Nissim Francez,
Michael Rodeh:
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.
POPL 1989: 36-48 |
| 49 | EE | Michael Evangelist,
Nissim Francez,
Shmuel Katz:
Multiparty Interactions for Interprocess Communication and Synchronization.
IEEE Trans. Software Eng. 15(11): 1417-1426 (1989) |
| 48 | | Sara Porat,
Nissim Francez:
Fairness in Context-Free Grammars under Every Choice-strategy
Inf. Comput. 80(3): 249-268 (1989) |
| 47 | | Nissim Francez:
Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett. 32(5): 235-242 (1989) |
| 1988 |
|---|
| 46 | | Luc Bougé,
Nissim Francez:
A Compositional Approach to Superimposition.
POPL 1988: 240-249 |
| 45 | | Krzysztof R. Apt,
Nissim Francez,
Shmuel Katz:
Appraising Fairness in Languages for Distributed Programming.
Distributed Computing 2(4): 226-241 (1988) |
| 44 | | Ran Rinat,
Nissim Francez,
Orna Grumberg:
Infinite Trees, Markings and Well-Foundedness
Inf. Comput. 79(2): 131-154 (1988) |
| 1987 |
|---|
| 43 | | Krzysztof R. Apt,
Nissim Francez,
Shmuel Katz:
Appraising Fairness in Languages for Distributed Programming.
POPL 1987: 189-198 |
| 1986 |
|---|
| 42 | | Ran Rinat,
Nissim Francez,
Orna Grumberg:
Infinite Trees, Markings and Well Foundedness.
CAAP 1986: 238-253 |
| 41 | | Sara Porat,
Nissim Francez:
Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.
CADE 1986: 21-41 |
| 40 | | Nir Shavit,
Nissim Francez:
A New Approach to Detection of Locally Indicative Stability.
ICALP 1986: 344-358 |
| 39 | | Orna Grumberg,
Nissim Francez,
Shmuel Katz:
A Complete Rule for Equifair Termination.
J. Comput. Syst. Sci. 33(3): 313-332 (1986) |
| 38 | | Nissim Francez,
Brent Hailpern,
Gadi Taubenfeld:
Script: A Communication Abstraction Mechanism and Its Verification.
Sci. Comput. Program. 6(1): 35-88 (1986) |
| 1985 |
|---|
| 37 | | Nissim Francez,
Orna Grumberg,
Shmuel Katz,
Amir Pnueli:
Proving Termination of Prolog Programs.
Logic of Programs 1985: 89-105 |
| 36 | | Sara Porat,
Nissim Francez:
Fairness in Term Rewriting Systems.
RTA 1985: 287-300 |
| 35 | | Sara Porat,
Nissim Francez:
Fairness in Context-Free Grammars under Canonical Derivations.
STACS 1985: 255-266 |
| 34 | EE | Nissim Francez,
Shaula Yemini:
Symmetric Intertask Communication.
ACM Trans. Program. Lang. Syst. 7(4): 622-636 (1985) |
| 33 | | Orna Grumberg,
Nissim Francez,
Johann A. Makowsky,
Willem P. de Roever:
A Proof Rule for Fair Termination of Guarded Commands
Information and Control 66(1/2): 83-102 (1985) |
| 32 | | Nissim Francez,
Brent Hailpern:
Script: A Communication Abstraction Mechanism.
Operating Systems Review 19(2): 53-67 (1985) |
| 1984 |
|---|
| 31 | | Gadi Taubenfeld,
Nissim Francez:
Proof Rules for Communication Abstractions (Abstract).
FSTTCS 1984: 118 |
| 30 | | Orna Grumberg,
Nissim Francez,
Shmuel Katz:
Fail Termination of Communicating Processe.
PODC 1984: 254-265 |
| 29 | | Nissim Francez,
Dexter Kozen:
Generalized Fair Termination.
POPL 1984: 46-53 |
| 28 | EE | Krzysztof R. Apt,
Nissim Francez:
Modeling the Distributed Termination Convention of CSP.
ACM Trans. Program. Lang. Syst. 6(3): 370-379 (1984) |
| 27 | | A. Prasad Sistla,
Edmund M. Clarke,
Nissim Francez,
Albert R. Meyer:
Can Message Buffers Be Axiomatized in Linear Temporal Logic?
Information and Control 63(1/2): 88-112 (1984) |
| 26 | | Tzilla Elrad,
Nissim Francez:
A Weakest Precondition Semantics for Communicating Processes.
Theor. Comput. Sci. 29: 231-250 (1984) |
| 25 | | Nissim Francez,
Daniel J. Lehmann,
Amir Pnueli:
A Linear-History Semantics for Languages for Distributed Programming.
Theor. Comput. Sci. 32: 25-46 (1984) |
| 1983 |
|---|
| 24 | | Orna Grumberg,
Nissim Francez,
Shmuel Katz:
A Compete Proof Rule for Strong Equifair Termination.
Logic of Programs 1983: 257-278 |
| 23 | | Liuba Shrira,
Nissim Francez,
Michael Rodeh:
Distributed k-Selection: From a Sequential to a Distributed Algorithm.
PODC 1983: 143-153 |
| 22 | | Nissim Francez,
Brent Hailpern:
Script: A Communication Abstraction Mechanism.
PODC 1983: 213-227 |
| 21 | | Nissim Francez:
Product Properties and Their Direct Verification.
Acta Inf. 20: 329-344 (1983) |
| 20 | | Nissim Francez:
Extended Naming Conventions for Communicating Processes.
Sci. Comput. Program. 3(1): 101-114 (1983) |
| 1982 |
|---|
| 19 | | A. Prasad Sistla,
Edmund M. Clarke,
Nissim Francez,
Yuri Gurevich:
Can Message Buffers be Characterized in Linear Temporal Logic?
PODC 1982: 148-156 |
| 18 | | Nissim Francez:
Extended Naming Conventions for Communicating Processes.
POPL 1982: 40-45 |
| 17 | | Nissim Francez,
Michael Rodeh:
Achieving Distributed Termination without Freezing.
IEEE Trans. Software Eng. 8(3): 287-292 (1982) |
| 16 | | Sara Porat,
Nissim Francez,
Shlomo Moran,
Shmuel Zaks:
Fair Deriviations in Context-Free Grammars
Information and Control 55(1-3): 108-116 (1982) |
| 15 | | Tzilla Elrad,
Nissim Francez:
Decomposition of Distributed Programs into Communication-Closed Layers.
Sci. Comput. Program. 2(3): 155-173 (1982) |
| 1981 |
|---|
| 14 | | Liuba Shrira,
Nissim Francez:
An Experimental Implementation of CSP.
ICDCS 1981: 126-136 |
| 1980 |
|---|
| 13 | | Nissim Francez,
Daniel J. Lehmann,
Amir Pnueli:
A Linear History Semantics for Distributed Languages (Extended Abstract)
FOCS 1980: 143-151 |
| 12 | | Nissim Francez,
Michael Rodeh:
A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme
FOCS 1980: 373-379 |
| 11 | EE | Nissim Francez:
Distributed Termination.
ACM Trans. Program. Lang. Syst. 2(1): 42-55 (1980) |
| 10 | EE | Krzysztof R. Apt,
Nissim Francez,
Willem P. de Roever:
A Proof System for Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst. 2(3): 359-385 (1980) |
| 1979 |
|---|
| 9 | | Nissim Francez:
On Achieving Distributed Termination.
Semantics of Concurrent Computation 1979: 300-315 |
| 8 | | Nissim Francez,
C. A. R. Hoare,
Daniel J. Lehmann,
Willem P. de Roever:
Semantics of Nondeterminism, Concurrency, and Communication.
J. Comput. Syst. Sci. 19(3): 290-308 (1979) |
| 1978 |
|---|
| 7 | | Nissim Francez,
C. A. R. Hoare,
Willem P. de Roever:
Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract).
MFCS 1978: 191-200 |
| 6 | | Nissim Francez,
Amir Pnueli:
A Proof Method for Cyclic Programs.
Acta Inf. 9: 133-157 (1978) |
| 5 | | Nissim Francez:
An Application of a Method for Analysis of Cyclic Programs.
IEEE Trans. Software Eng. 4(5): 371-378 (1978) |
| 1977 |
|---|
| 4 | | Nissim Francez,
Boris Klebansky,
Amir Pnueli:
Backtracking in Recursive Computations
Acta Inf. 8: 125-144 (1977) |
| 3 | | Nissim Francez:
Another Advantage of Keyword Notation for Parameter Communication with Subprograms.
Commun. ACM 20(8): 604-605 (1977) |
| 2 | | Nissim Francez:
A Case for a Forward Predicate Transformer.
Inf. Process. Lett. 6(6): 196-198 (1977) |
| 1973 |
|---|
| 1 | | Nissim Francez,
Giora Slutzki:
On the Non-Compactness of the Class of Program Schemas.
Inf. Process. Lett. 2(5): 141-142 (1973) |
