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
[1]
Hilfe
Suche: Author="Stavi, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fair termination revisited -- with delay
K.R. Apt
,
A. Pnueli
,
J. Stavi
Theoretical Computer Science
33
(1), 1984, pp. 65-84
Propositional dynamic logic of nonregular programs
D. Harel
,
A. Pnueli
,
J. Stavi
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 222-243
Pair termination revisited - With delay
K.R. Apt
,
A. Pnueli
,
J. Stavi
Proceedings of the 2nd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1982 (Bangalore, India, December 13-15, 1981)
, 1982, pp. 146-170
Propositional dynamic logic of context-free programs
D. Harel
,
A. Pnueli
,
J. Stavi
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 310-321
Impartiality, justice and fairness: The ethics of concurrent termination
D. Lehmann
,
A. Pnueli
,
J. Stavi
Lecture Notes in Computer Science
115
, 1981, pp. 264-277
A complete axiomatic system for proving deductions about recursive programs
D. Harel
,
A. Pnueli
,
J. Stavi
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 249-260