Theoretical Computer Science 1996: Vol 167 Table of Contents PDF
Preview Theoretical Computer Science 1996: Vol 167 Table of Contents
THEORETICAL COMPUTER SCIENCE Algorithms, automata, complexity and games VOLUME 167, NUMBERS 1-2, 30 OCTOBER 1996 Selected Papers of TAPSOFT ‘95 Guest Editors: P.D. Mosses M. Nielsen M.1I. Schwartzbach 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 fur Mathematik CONTENTS P.D. Mosses, M. Nielsen and M./. Schwartzbach Foreword M. Hofmann and D. Sannella On behavioural abstraction and behavioural satisfaction in higher-order logic B. Jonsson and Y.-K. Tsay Assumption/guarantee specifications in linear-time temporal logic D. Kozen Rational spaces and set constraints 73 A. Middeldorp, S. Okui and T. Ida Lazy narrowing: Strong completeness and eager variable elimination 95 M. Sagiv, T. Reps and S. Horwitz Precise interprocedural dataflow analysis with applications to constant propagation 131 K. Salomaa Decidability of equivalence for deterministic synchronized tree automata 171 D. Sands Proving the correctness of recursion-based automatic program transformations D. Sangiorgi m-Calculus, internal mobility, and agent-passing calculi Author Index Volume 167
The list of books you might like
