Abstract is missing.
- On Semantic Foundations for Applicative MultiprogrammingSamson Abramsky. 1-14
- An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract)Krzysztof R. Apt, Carole Delporte. 15-27
- Topological Characterizations of Infinite Behaviours of Transition SystemsAndré Arnold. 28-38
- Linear Time and Branching Time Semantics for Recursion with MergeJ. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer. 39-51
- Processes and a Fair Semantics for the Ada Rendez-VousJ. W. de Bakker, Jeffery I. Zucker. 52-66
- Conditional Dependencies for Horizontal DecompositionsPaul De Bra, Jan Paredaens. 67-82
- On the Relationship of CCS and CSPStephen D. Brookes. 83-96
- Behavioural Equivalence Relations Induced by Programming LogicsStephen D. Brookes, William C. Rounds. 97-108
- Lower Bounds for Constant Depth Circuits for Prefix ProblemsAshok K. Chandra, Steven Fortune, Richard J. Lipton. 109-117
- Test Sets for Morphisms with Bounded DelayChristian Choffrut, Juhani Karhumäki. 118-127
- Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract)Shimon Cohen, Daniel J. Lehmann, Amir Pnueli. 128-136
- Ambiguity and Decision Problems Concerning Number SystemsKarel Culik II, Arto Salomaa. 137-146
- On the Observational Semantics of Fair ParallelismPhilippe Darondeau, Laurent Kott. 147-159
- On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor SearchingFrank K. H. A. Dehne. 160-172
- Algebraic Languages and Polyominoes EnumerationMarie-Pierre Delest, Gérard Viennot. 173-181
- On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract)Herbert Edelsbrunner, Emo Welzl. 182-187
- Algebraic Specifications with Generating ConstraintsHartmut Ehrig, Eric G. Wagner, James W. Thatcher. 188-202
- Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci SearchesAviezri S. Fraenkel. 203-225
- Initial Index: A New Complexity Function for LanguagesJoaquim Gabarró. 226-236
- Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract)Harald Ganzinger. 237-249
- Polynomial-Time Factorization of Multivariate Polynomials over Finite FieldsJoachim von zur Gathen, Erich Kaltofen. 250-263
- Processes of Place/Transition-NetsUrsula Goltz, Wolfgang Reisig. 264-277
- A Hardware Semantics Based on Temporal IntervalsJoseph Y. Halpern, Zohar Manna, Ben C. Moszkowski. 278-291
- Lower Bounds for Solving Undirected Graph Problems on VLSISusanne E. Hambrusch, Janos Simon. 292-303
- Concurrent Probabilistic Program, or: How to Schedule if You MustSergiu Hart, Micha Sharir. 304-318
- Computation Times of NP Sets of Different DensitiesJuris Hartmanis, Yaacov Yesha. 319-330
- Rewrite Methods for Clausal and Non-Clausal Theorem ProvingJieh Hsiang, Nachum Dershowitz. 331-346
- Complexity of Infinite TreesKlaus Indermark. 347-360
- Incremental Construction of Unification Algorithms in Equational TheoriesJean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner. 361-373
- Tree Automata and Attribute GrammarsTsutomu Kamimura. 374-384
- Effectively Given SpacesTsutomu Kamimura, Adrian Tang. 385-396
- A Note on Intersections of Free Submonoids of a Free MonoidJuhani Karhumäki. 397-407
- A Fast Sorting Algorithm for VLSIHans-Werner Lang, Manfred Schimmler, Hartmut Schmeck, Heiko Schröder. 408-419
- On the Composition of Morphisms and Inverse MorphismsMichel Latteux, Jeannine Leguy. 420-432
- On the Group Complexity of a Finite LanguageEvelyne Barbin-Le Rest, Stuart W. Margolis. 433-444
- Reasoning with Time and Chance (Extended Abstract)Daniel J. Lehmann, Saharon Shelah. 445-457
- Factoring Multivariate Integral PolynomialsArjen K. Lenstra. 458-465
- On the Study Data Structures: Binary Tournaments with Repeated KeysPierre Lescanne, Jean-Marc Steyaert. 466-477
- Minimizing Width in Linear LayoutsFillia Makedon, Ivan Hal Sudborough. 478-490
- Proving Precedence Properties: The Temporal WayZohar Manna, Amir Pnueli. 491-512
- An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven) Evaluation and its Application to a Functional LanguageBernhard Möller. 513-526
- Searchability in Merging and Implicit Data StructuresJ. Ian Munro, Patricio V. Poblete. 527-535
- Strong Abstract Interpretation Using Power Domains (Extended Abstract)Alan Mycroft, Flemming Nielson. 536-547
- Testing Equivalence for ProcessesRocco De Nicola, Matthew Hennessy. 548-560
- Specification-Oriented Semantics for Communicating ProcessesErnst-Rüdiger Olderog, C. A. R. Hoare. 561-572
- Complexity Classes of Alternating Machines with OraclesPekka Orponen. 573-584
- A Propos d une Conjecture de F. Dejean sur les Répétitions dans les MotsJean-Jacques Pansiot. 585-596
- Parallel Dictionaries in 2-3 TreesWolfgang J. Paul, Uzi Vishkin, Hubert Wagener. 597-609
- Varietes de Semigroupes et Mots InfinisDominique Perrin. 610-616
- Arbres et Hierarchies de ConcatenationJean-Eric Pin. 617-628
- A Multiprocess Network Logic with Temporal and Spatial ModalitiesJohn H. Reif, A. Prasad Sistla. 629-639
- Enumeration of Success Patterns in Logic ProgramsTaisuke Sato, Hisao Tamaki. 640-652
- Immunity (Extended Abstract)Uwe Schöning, Ronald V. Book. 653-661
- Power Domains and Predicate Transformers: A Topological ViewMichael B. Smyth. 662-675
- Recognition and Isomorphism of Two Dimensional Partial OrdersJeremy Spinrad, Jacobo Valdes. 676-686
- On the Simulation of Many Storage Heads by a Single One (Extended Abstract)Paul M. B. Vitányi. 687-694
- Synchronisation TreesGlynn Winskel. 695-711
- Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract)Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou. 712-722
- Context-Free Controlled ETOL SystemsKlaus-Jörn Lange. 723-733