Theoretical Computer Science 1997: Vol 189 Table of Contents

1 Pages·1997·0.12 MB·English

Theoretical Computer Science
Logic, semantics and theory of programming
Volume 189, Numbers 1-2, 15 December 1997
Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts,
Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com-
pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fiir Mathematik
Contents
Fundamental Studies
D. Niwifski
Fixed point characterization of infinite behavior of finite-state systems
L. Bougé, D. Cachera, Y. Le Guyadec, G. Utard and B. Virot
Formal validation of data-parallel programs: a two-component assertional
proof system for a simple language
Contributions
H.-D. Burkhard
Fairness and control in multi-agent systems
T. Eiter, G. Gottlob and N. Leone
Abduction from logic programs: Semantics and complexity
P. Brémond-Grégoire and |. Lee
A process algebra of communicating shared resources with dense time
and priorities
Notes
M. Mezghiche
cB-Machine with Af-reduction
A. Bergeron
On the rational behaviors of concurrent timers
S. Cicerone and F. Parisi-Presicce
On the complexity of specification morphisms
Author index volume 189