Theoretical Elsevier
Computer
293
Science 126 (1994) 293
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 (Fundnmental Study) Andersen, H.R., Model checking and boolean graphs Caron, A.-C. and J.-L. Coquide, Decidability of reachability for disjoint union of term rewriting systems Coquidt, J.-L., see A.-C. Caron Courcelle, B., Monadic second-order definable graph transductions: a survey Dam, M., CTL* and ECTL* as fragments of the modal p-calculus Dill, D.L., see R. Alur Gerhard, J.A. and M. Petrich, Unification in free distributive lattices Peled, D. and A. Pnueli, Proving partial order properties (Fundamental Study) Petrich, M., see J.A. Gerhard Pnueli, A., see D. Peled Potthoff, A., Modulo-counting quantifiers over finite trees Raoult, J.-C., Preface to the Special Issue of Selected Papers of CAAP and ESOP, Rennes, France, February 1992 Regnier, L., Une equivalence sur les lambda-termes (Note) Seidl, H., Finite tree automata with cost functions Van Oostrom, V., Confluence by decreasing diagrams
Elsevier
Science B.V.
(2) 183-235 (1) 3- 30 (1) (1) (1) (1) (2) (2) (2) (2) (2) (1)
3l- 52 31p 52 533 75 77- 96 183-235 237-257 1433182 237-257 143-182 97-112
(1) (2) 28129: (1) 1133142 (2) 2599280