Conferences in DBLP
Tirza Hirst , David Harel On the Power of Bounded Concurrency II: The Pushdown Automata Level. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:1-17 [Conf ] Xavier Gérard Viennot Trees Everywhere. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:18-41 [Conf ] Marco Bellia , Michele Bugliesi , M. Eugenia Occhiuto Combinatory Forms for Equational Programming: Instances, Unification and Narrowing. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:42-56 [Conf ] Gérard Boudol , Kim Guldstrand Larsen Graphical versus Logical Specifications. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:57-71 [Conf ] Jiazhen Cai , Robert Paige , Robert Endre Tarjan More Efficient Bottom-Up Tree Pattern Matching. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:72-86 [Conf ] Didier Caucal On the Regular Structure of Prefix Rewriting. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:87-102 [Conf ] Edmund M. Clarke , Anca Browne , Robert P. Kurshan A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:103-116 [Conf ] Maxime Crochemore , Jean Neraud Unitary Monoid with Two Generators: An Algorithmic Point of View. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:117-131 [Conf ] Pierre-Louis Curien , Giorgio Ghelli Coherence of Subsumption. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:132-146 [Conf ] Uffe Engberg , Glynn Winskel Petri Nets as Models of Linear Logic. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:147-161 [Conf ] Gian Luigi Ferrari , Ugo Montanari Towards the Unification of Models for Concurrency. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:162-176 [Conf ] Dominique Geniet , René Schott , Loÿs Thimonier A Markovian Concurrency Measure. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:177-190 [Conf ] Kristoffer Høgsbro Holm Graph Matching in Operational Semantics and Typing. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:191-205 [Conf ] A. J. Kfoury , Jerzy Tiuryn , Pawel Urzyczyn ML Typability is DEXTIME-Complete. [Citation Graph (1, 0)][DBLP ] CAAP, 1990, pp:206-220 [Conf ] Emmanuel Kounalis Testing for Inductive (Co)-Reducibility. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:221-238 [Conf ] Guy Louchard , René Schott Probabilistic Analysis of Some Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:239-253 [Conf ] Michael I. Schwartzbach Infinite Values in Hierarchical Imperative Types. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:254-268 [Conf ] Helmut Seidl Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:269-284 [Conf ]