Theoretical Computer Science 1994: Vol 126 Index

1 Pages·1994·0.09 MB·English

Theoretical Computer Science 126 (1994) 293
Elsevier
Author Index Volume 126 (1994)
(The issue number is given in front of the page numbers)
Alur, R. and D.L. Dill, A theory of timed automata (Fundamental Study) (2) 183-235
Andersen, H.R., Model checking and boolean graphs (1) 3- 30
Caron, A.-C. and J.-L. Coquidé, Decidability of reachability for disjoint union of term
rewriting systems (1) 31- 52
Coquide, J.-L., see A.-C. Caron (1) 31- 52
Courcelle, B., Monadic second-order definable graph transductions: a survey (1) 53- 75
Dam, M., CTL* and ECTL* as fragments of the modal p-calculus (1) 77- 96
Dill, D.L., see R. Alur (2) 183-235
Gerhard, J.A. and M. Petrich, Unification in free distributive lattices (2) 237-257
Peled, D. and A. Pnueli, Proving partial order properties (Fundamental Study) (2) 143-182
Petrich, M., see J.A. Gerhard (2) 237-257
Pnueli, A., see D. Peled (2) 143-182
Potthoff, A.. Modulo-counting quantifiers over finite trees (1) 97-112
Raoult, J.-C., Preface to the Special Issue of Selected Papers of CAAP and ESOP, Rennes,
France, February 1992 (1) 1
Regnier, L., Une équivalence sur les lambda-termes (Note) (2) 281-292
Seidl, H., Finite tree automata with cost functions (1) 113-142
Van Oostrom, V., Confluence by decreasing diagrams (2) 259-280
Elsevier Science B.V.