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: Journal=Theor.~Comput.~Sci. AND Volume=167
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On behavioural abstraction and behavioural satisfaction in higher-order logic
Martin Hofmann
,
Donald Sannella
Theoretical Computer Science
167
(1-2), 1996, pp. 3-45
Assumption/guarantee specifications in linear-time temporal logic
Bengt Jonsson
,
Yih-Kuen Tsay
Theoretical Computer Science
167
(1-2), 1996, pp. 47-72
Rational spaces and set constraints
Dexter Kozen
Theoretical Computer Science
167
(1-2), 1996, pp. 73-94
Lazy narrowing: Strong completeness and eager variable elimination
Aart Middeldorp
,
Satoshi Okui
,
Tetsuo Ida
Theoretical Computer Science
167
(1-2), 1996, pp. 95-130
Precise interprocedural dataflow analysis with applications to constant propagation
Mooly Sagiv
,
Thomas Reps
,
Susan Horwitz
Theoretical Computer Science
167
(1-2), 1996, pp. 131-170
Decidability of equivalence for deterministic synchronized automata
Kai Salomaa
Theoretical Computer Science
167
(1-2), 1996, pp. 171-192
Proving the correctness of recursion-based automatic program transformations
David Sands
Theoretical Computer Science
167
(1-2), 1996, pp. 193-233
\pi
-calculus, internal mobility, and agent-passing calculi
Davide Sangiorgi
Theoretical Computer Science
167
(1-2), 1996, pp. 235-274