• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 24 matches

• 1982
• 
  Marco Bellia, Enrico Dameri, Pierpaolo Degano, Giorgio Levi, Maurizio Martelli:
  Applicative communicating processes in first order logic. Symposium on Programming 1982: 1-14
• 
  David B. Benson:
  A machine level semantics for nondeterministic, parallel programs. Symposium on Programming 1982: 15-25
• 
  Jan A. Bergstra, Jan Willem Klop:
  A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36
• 
  Ernesto Costa:
  Automatic program transformation viewed as theorem proving. Symposium on Programming 1982: 37-46
• 
  Philippe Darondeau:
  An enlarged definition and complete axiomatization of observational congruence of finite processes. Symposium on Programming 1982: 47-62
• 
  Ph. Deschamp:
  Perluette: A compilers producing system using abstract data types. Symposium on Programming 1982: 63-77
• 
  Pär Emanuelson:
  From abstract model to efficient compilation of patterns. Symposium on Programming 1982: 91-104
• 
  Agneta Eriksson:
  Computer-based synthesis of logic programs. Symposium on Programming 1982: 105-115
• 
  Marie-Paule Flé, Gérard Roucairol:
  On some syntactic equivalence of program schemas and related transformations. Symposium on Programming 1982: 116-131
• 
  Rob Gerth, Willem P. de Roever, Marly Roncken:
  Procedures and concurrency: A study in proof. Symposium on Programming 1982: 132-163
• 
  Pedro Guerreiro:
  Another characterization of weakest preconditions. Symposium on Programming 1982: 164-177
• 
  Matthew Hennessy:
  Powerdomains and nondeterministic recursive definitions. Symposium on Programming 1982: 178-193
• 
  Peter G. Hibbard, Thomas L. Rodeheffer:
  Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code. Symposium on Programming 1982: 194-211
• 
  J. Roger Hindley:
  The simple semantics for Coppe-Dezani-Sallé types. Symposium on Programming 1982: 212-226
• 
  László Kozma:
  Proving the correctness of implementations of shared data abstractions. Symposium on Programming 1982: 227-241
• 
  Alfred Laut, Helmuth Partsch:
  Tuning algebraic specifications by type merging. Symposium on Programming 1982: 283-304
• 
  Jacek Leszczylowski, Martin Wirsing:
  A system for reasoning within and about algebraic specifications. Symposium on Programming 1982: 257-282
• 
  Alberto Pettorossi, Andrzej Skowron:
  Communicating agents for applicative concurrent programming. Symposium on Programming 1982: 305-322
• 
  Axel Poigné:
  On effective computations of nondeterministic schemes. Symposium on Programming 1982: 323-336
• 
  Jean-Pierre Queille, Joseph Sifakis:
  Specification and verification of concurrent systems in CESAR. Symposium on Programming 1982: 337-351
• 
  John M. Rushby:
  Proof of separability: A verification technique for a class of a security kernels. Symposium on Programming 1982: 352-367
• 
  Miklós Szöts, Sándor Csizmazia:
  A method for program synthesis. Symposium on Programming 1982: 368-380
• 
  Judy A. Townley:
  The use of transformations to implement an algorithm. Symposium on Programming 1982: 381-408
• 
  Mariangiola Dezani-Ciancaglini, Ugo Montanari:
  International Symposium on Programming, 5th Colloquium, Torino, Italy, April 6-8, 1982, Proceedings. Lecture Notes in Computer Science 137, Springer 1982, ISBN 3-540-11494-7 [contents]