Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Francez, Nissim"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
When are different type-logical semantic definitions defining equivalent meanings?
Nissim Francez
Journal of Computer and System Sciences
78
(3), 2012, pp. 960-969
Commutation-augmented pregroup grammars and push-down automata with cancellation
Nissim Francez
,
Michael Kaminski
Information and Computation
206
(9-10), 2008, pp. 1018-1032
An algebraic characterization of deterministic regular languages over infinite alphabets
Nissim Francez
,
Michael Kaminski
Theoretical Computer Science
306
(1-3), 2003, pp. 155-175
A logic-based approach to program flow analysis
Mooly Sagiv
,
Nissim Francez
,
Michael Rodeh
,
Reinhard Wilhelm
Acta Informatica
35
(6), 1998, pp. 457-504
Program composition via unification
Limor Fix
,
Nissim Francez
,
Orna Grumberg
Theoretical Computer Science
131
(1), 1994, pp. 139-179
Finite-memory automata
Michael Kaminski
,
Nissim Francez
Theoretical Computer Science
134
(2), 1994, pp. 329-363
Finite-state unification automata and relational languages
Yael Shemesh
,
Nissim Francez
Information and Computation
114
(2), 1994, November, pp. 192-213
Program composition via unification
Limor Fix
,
Nissim Francez
,
Orna Grumberg
Lecture Notes in Computer Science
623
, 1992, pp. 672-684
Preserving liveness: Comments on ``Safety and liveness from a methodological point of view''
Martin Abadi
,
Bowen Alpern
,
Krzysztof R. Apt
,
Nissim Francez
,
Shmuel Katz
,
Leslie Lamport
,
Fred B. Schneider
Information Processing Letters
40
, 1991, pp. 141-142
Cooperating proofs for distributed programs with multiparty interactions
Nissim Francez
Information Processing Letters
32
, 1989, pp. 235-242
Fairness in context-free grammars under every choice-strategy
Sara Porat
,
Nissim Francez
Information and Computation
80
(3), 1989, pp. 249-268
Infinite trees, markings, and well-foundedness
Ran Rinat
,
Nissim Francez
,
Orna Grumbert
Information and Computation
79
(2), 1988, pp. 131-154
Fairness in context-free grammars under canonical derivations
Sera Porat
,
Nissim Francez
Lecture Notes in Computer Science
182
, 1985, pp. 255-266
Proof rules for communication abstractions
Gad Taubenfeld
,
Nissim Francez
Lecture Notes in Computer Science
181
, 1984, pp. 118-118
Proof rules for communication abstractions
Gadi Taubenfeld
,
Nissim Francez
Lecture Notes in Computer Science
181
, 1984, pp. 443-465
Semantics of nondeterminism, concurrency and communication
Nissim Francez
,
C.A.R. Hoare
,
Willem P. de Roever
Lecture Notes in Computer Science
64
, 1978, pp. 191-200
On the non-compactness of the class of program schemas
Nissim Francez
,
Giora Slutzky
Information Processing Letters
2
, 1973, pp. 141-142