3. ICALP 1976:
Edinburgh,
U.K.
S. Michaelson,
Robin Milner (Eds.):
Third International Colloquium on Automata,
Languages and Programming,
University of Edinburgh,
July 20-23,
1976. Edinburgh University Press,
ISBN 0-85224-308-1
- Matti Linna:
On omega-sets Associated with Context-Free Languages.
1-19
- Eljas Soisalon-Soininen, Esko Ukkonen:
A Characterization of LL(k) Languages.
20-30
- Leslie G. Valiant:
The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets.
31-37
- Antonio Restivo:
On a Family of Codes Related to Factorization of Cyclotomic Polynomials.
38-44
- Dominique Perrin:
Sur la longeur moyenne des codes préfixes.
45-51
- Jacques Sakarovitch:
Sur les monoïdes syntactiques des langages algébriques déterministes.
52-65
- Joffroy Beauquier:
Générateurs algébriques non-ambigus.
66-73
- André Arnold, Max Dauchet:
Bi-transductions de forêts.
74-86
- Fred Kröger:
Logical Rules of Natural Reasoning about Programs.
87-98
- Maarten H. van Emden:
Verification Conditions as Programs.
99-119
- Witold Lipski Jr.:
Informational Systems with Incomplete Information.
120-130
- J. Schwarz:
Event Based Reasoning - A System for Proving Correct Termination of Programs.
131-146
- Giuseppe Longo, Marisa Venturini Zilli:
A Theory of Computation with an Identity Discriminator.
147-167
- Gérard Berry, Bruno Courcelle:
Program Equivalence and Canonical Forms in Stable Discrete Interpretations.
168-188
- Irène Guessarian:
Semantic Equivalence of Program Schemes and its Syntactic Characterization.
189-200
- Daniel Brand:
Proving Programs Incorrect.
201-227
- Robert Cartwright:
User-Defined Data Types as an Aid to Verifying LISP Programs.
228-256
- Daniel P. Friedman, David S. Wise:
CONS Should Not Evaluate its Arguments.
257-284
- John Gill, István Simon:
Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures.
285-306
- William F. McColl:
The Depth of Boolean Functions.
307-321
- Claus-Peter Schnorr:
Optimal Algorithms for Self-Reducible Problems.
322-337
- Helmut Alt, Kurt Mehlhorn:
Lower Bounds for the Space Complexity of Context-Free Recognition.
338-354
- Zvi Galil:
On Enumeration Procedures for Theorem Proving and for Integer Programming.
355-381
- Jan van Leeuwen:
On the Construction of Huffman Trees.
382-410
- Max Fontet:
A Linear Algorithm for Testing Isomorphism of Planar Graphs.
411-424
- Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer:
A Note on the Average Time to Compute Transitive Closures.
425-434
- J. W. de Bakker:
Semantics and Termination of Nondeterministic Recursive Programs.
435-477
- Matthew Hennessy, Edward A. Ashcroft:
The Semantics of Nondeterminism.
478-493
- Irene Greif:
On Proofs of Programs for Synchronization.
494-507
- Hans-Dieter Ehrich:
Outline of an Algebraic Theory of Structured Objects.
508-530
- Michel Sintzoff:
Eliminating Blind Alleys from Backtrack Programs.
531-557
Copyright © Tue Nov 17 00:28:48 2009
by Michael Ley (ley@uni-trier.de)
