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="Sistla, A.P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reasoning about systems with many processes
S.M. German
,
A.P. Sistla
Journal of the ACM
39
(3), 1992, July, pp. 675-735
Proving correctness with respect to nondeterministic safety specifications
A.P. Sistla
Information Processing Letters
39
, 1991, pp. 45-49
On verifying that a concurrent program satisfies a nondeterministic specification
A.P. Sistla
Information Processing Letters
32
, 1989, pp. 17-23
A multiprocess network logic with temporal and spatial modalities
J. Reif
,
A.P. Sistla
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 41-53
The complexity of propositional linear temporal logics
A.P. Sistla
,
E.M. Clarke
Journal of the ACM
32
(3), 1985, pp. 733-749
The complementation problem for Büchi automata with applications to temporal logic
A.P. Sistla
,
M.Y. Vardi
,
P. Wolper
Lecture Notes in Computer Science
194
, 1985, pp. 465-474
Reasoning about infinite computation paths
P. Wolper
,
M.Y. Vardi
,
A.P. Sistla
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 185-194
The complexity of propositional linear temporal logics
A.P. Sistla
,
E.M. Clarke
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 159-168