9. ICALP 1982: Aarhus, Denmark

Mogens Nielsen, Erik Meineche Schmidt (Eds.): Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings. Lecture Notes in Computer Science 140 Springer 1982, ISBN 3-540-11576-5 BibTeX

@proceedings{DBLP:conf/icalp/1982,
  editor    = {Mogens Nielsen and
               Erik Meineche Schmidt},
  title     = {Automata, Languages and Programming, 9th Colloquium, Aarhus,
               Denmark, July 12-16, 1982, Proceedings},
  booktitle = {ICALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {140},
  year      = {1982},
  isbn      = {3-540-11576-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Ralph-Johan Back, Heikki Mannila: Locality in Modular Systems. 1-13 BibTeX
Mordechai Ben-Ari: On-the-Fly Garbage Collection: New Algorithms Inspired by Program Proofs. 14-22 BibTeX
Jan A. Bergstra, Jan Willem Klop: Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. 23-34 BibTeX
Klaus J. Berkling, Elfriede Fehr: A Modification of the Lambda-Calculus as a Base for Functional Programming Languages. 35-47 BibTeX
Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn: On the Power of Nondeterminism in Dynamic Logic. 48-60 BibTeX
Alberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini: Equivalence and Membership Problems for Regular Trace Languages. 61-71 BibTeX
Norbert Blum: On the Power of Chain Rules in Context Free Grammars. 72-82 BibTeX
Franz-Josef Brandenburg: Extended Chomsky-Schützenberger Theorems. 83-93 BibTeX
Luca Cardelli: Real Time Agents. 94-106 BibTeX
John Case, Christopher Lynes: Machine Inductive Inference and Language Identification. 107-115 BibTeX
Gérard Comyn, Max Dauchet: Approximations of Infinitary Objects. 116-127 BibTeX
Karel Culik II: On Test Sets and the Ehrenfeucht Conjecture. 128-140 BibTeX
Werner Damm, Andreas Goerdt: An Automata-Theoretic Characterization of the OI-Hierarchy. 141-153 BibTeX
David P. Dobkin, David G. Kirkpatrick: Fast Detection of Polyhedral Intersections. 154-165 BibTeX
Pavol Duris, Zvi Galil: On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. 166-175 BibTeX
Pavol Duris, Juraj Hromkovic: Multihead Finite State Automata and Concatenation. 176-186 BibTeX
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg: Conditions Enforcing Regularity of Context-Free Languages. 187-191 BibTeX
Andrzej Ehrenfeucht, Grzegorz Rozenberg: Repetitions in Homomorphisms and Languages. 192-211 BibTeX
Antony A. Faustini: An Operational Semantics for Pure Dataflow. 212-224 BibTeX
César Fernández, P. S. Thiagarajan: Some Properties of D-Continuous Causal Nets. 225-238 BibTeX
Philippe Flajolet, Jean-Marc Steyaert: A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization. 239-251 BibTeX
Rob Gerth: A Sound and Complete Hoare Axiomatization of the Ada-Rendevous. 252-264 BibTeX
Joseph A. Goguen, José Meseguer: Universal Realization, Persistent Interconnection and Implementation of Abstract Modules. 265-281 BibTeX
Gaston H. Gonnet, J. Ian Munro: Heaps on Heaps. 282-291 BibTeX
A. Goralciková, Pavel Goralcik, Václav Koubek: A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties. 292-299 BibTeX
John V. Guttag, Deepak Kapur, David R. Musser: Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. 300-312 BibTeX
David Harel, Dexter Kozen: A Programming Language for the Inductive Sets, and Applications. 313-329 BibTeX
K. Kalorkoti: A Lower Bound for the Formula Size of Rational Functions. 330-338 BibTeX
Juhani Karhumäki: On the Equivalence Problem for Binary DOL Systems. 339-347 BibTeX
Dexter Kozen: Results on the Propositional µ-Calculus. 348-359 BibTeX
Yael Krevner, Amiram Yehudai: An Iteration Theorem for Simple Precedence Languages (Extended Abstract). 360-368 BibTeX
Andrzej Lingas: The Power of Non-Rectilinear Holes. 369-383 BibTeX
Damian Niwinski: Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). 384-396 BibTeX
Dominique Perrin: Completing Biprefix Codes. 397-406 BibTeX
Nicholas Pippenger: Advances in Pebbling (Preliminary Version). 407-417 BibTeX
Gordon D. Plotkin: A Powerdomain for Countable Non-Determinism (Extended Abstract). 418-428 BibTeX
Jean-Claude Raoult, Ravi Sethi: Properties of a Notation for Combining Functions. 429-441 BibTeX
John H. Reif: On the Power of Probabilistic Choice in Synchronous Parallel Computations. 442-450 BibTeX
Christophe Reutenauer: Biprefix Codes and Semisimple Algebras. 451-457 BibTeX
Andrzej Salwicki: Algorithmic Theories of Data Structures. 458-472 BibTeX
Donald Sannella, Martin Wirsing: Implementation of Parameterised Specifications (Extended Abstract). 473-488 BibTeX
Hartmut Schmeck: Algebraic Semantics of Recursive Flowchart Schemes. 489-501 BibTeX
Alan L. Selman, Yacov Yacobi: The Complexity of Promise Problems. 502-509 BibTeX
Joseph Sifakis: Global and Local Invariants in Transition Systems. 510-522 BibTeX
Michael Sipser: On Relativization and the Existence of Complete Sets. 523-531 BibTeX
Robert D. Tennent: Semantics of Interference Control. 532-545 BibTeX
Paul M. B. Vitányi: Efficient Simulations of Multicounter Machines. 546-560 BibTeX
Glynn Winskel: Event Structure Semantics for CCS and Related Languages. 561-576 BibTeX
Dana S. Scott: Domains for Denotational Semantics. 577-613 BibTeX