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="N{\'e}meti, I."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the strength of temporal proofs
H. Andréka
,
I. Németi
,
I. Sain
Lecture Notes in Computer Science
379
, 1989, pp. 135-144
A unifying theorem for algebraic semantics and dynamic logics
H. Andréka
,
I. Guessarian
,
I. Németi
Information and Computation
72
(1), 1987, pp. 31-45
A unifying theorem for algebraic semantics and dynamic logics
H. Andreka
,
I. Guessarian
,
I. Németi
Lecture Notes in Computer Science
199
, 1985, pp. 8-17
A complete logic for reasoning about programs via nonstandard model theory II
H. Andréka
,
I. Németi
,
I. Sain
Theoretical Computer Science
17
, 1982, pp. 259-278
A complete logic for reasoning about programs via nonstandard model theory I
H. Andréka
,
I. Németi
,
I. Sain
Theoretical Computer Science
17
, 1982, pp. 193-212
Every free algebra in the variety generated by the representable dynamic algebras is separable and representable (Note)
I. Németi
Theoretical Computer Science
17
, 1982, pp. 343-347
A characterization of Floyd-provable programs
H. Andréka
,
I. Németi
,
I. Sain
Lecture Notes in Computer Science
118
, 1981, pp. 162-171
Completeness problems in verification of programs and program schemes
H. Andréka
,
I. Németi
,
I. Sain
Lecture Notes in Computer Science
74
, 1979, pp. 208-218