Jonathan Stavi

14 papers A* 4Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
1990 J jnl
On Models of the Elementary Theory of (Z, +, 1).
J. Symb. Log.
Mark E. Nadel, Jonathan Stavi
1984 J jnl
Countably decomposable admissible sets.
Ann. Pure Appl. Log.
Menachem Magidor, Saharon Shelah, Jonathan Stavi
1984 J jnl
Fair Termination Revisited-With Delay.
Theor. Comput. Sci.
Krzysztof R. Apt, Amir Pnueli, Jonathan Stavi
1983 J jnl
On the Standard Part of Nonstandard Models of Set Theory.
J. Symb. Log.
Menachem Magidor, Saharon Shelah, Jonathan Stavi
1983 J jnl
Propositional Dynamic Logic of Nonregular Programs.
J. Comput. Syst. Sci.
David Harel, Amir Pnueli, Jonathan Stavi
1981 — conf
Further Results on Propositional Dynamic Logic of Nonregular Programs.
Logic of Programs
David Harel, Amir Pnueli, Jonathan Stavi
1981 A* conf
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination.
ICALP
Daniel Lehmann, Amir Pnueli, Jonathan Stavi
1981 A* conf
Propositional Dynamic Logic of Context-Free Programs
FOCS
David Harel, Amir Pnueli, Jonathan Stavi
1980 A* conf
On the Temporal Analysis of Fairness.
POPL
Dov M. Gabbay, Amir Pnueli, Saharon Shelah, Jonathan Stavi
1980 J jnl
Triangle
J. Symb. Log.
Larry M. Manevitz, Jonathan Stavi
1977 A* conf
A Complete Axiomatic System for Proving Deductions about Recursive Programs
STOC
David Harel, Amir Pnueli, Jonathan Stavi
1977 J jnl
The Pure Part of HYP(M).
J. Symb. Log.
Mark E. Nadel, Jonathan Stavi
1973 J jnl
A Converse of the Barwise Completeness Theorem.
J. Symb. Log.
Jonathan Stavi
1973 — —
Boolean models for some expressive languages and their applications (מודלים בוליאניים לשפות עשירות ושימושיהם.).
Jonathan Stavi