The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Nissim Francez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  93. Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. [Citation Graph (, )][DBLP]


  94. Proof-Theoretic Semantics for a Natural Language Fragment. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.608secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002