Upload
others
View
4
Download
0
Embed Size (px)
Citation preview
in Computer Science
Edited by G. Goos and J. Hartmanis
115
Automata, Languages and Programming Eighth Colloquium Acre (Akko), Israel July 13-17,1981
Edited by S. Even and O. Kariv
Springer-Verlag Berlin Heidelberg New York 1981
8th International Colloquium on Automata Languages & Programming
ICALP 81 July 13-17, 1981 Acre (Akko), Israel
TABLE OF CONTENTS
Monday, July 13, Morning SESSION 1: A. Paz, Chairman C.P. Schnorr
Refined Analysis and Improvements on Some Factoring Algorithms 1 J. Heintz & M. Sieveking
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of the Variables 16 F.P. Preparata s j.E. Vuillemin
Area-Time Optimal VLSI Networks for Computing Integer Multiplication and Discrete Fourier Transform 29
SESSION 2: F.P. Preparata, Chairman J.-W. Hong, K. Mehlhorn & A.L. Rosenberg
Cost Tradeoffs in Graph Embeddings, with Applications 41 J.H. Reif „
Minimum S-T Cut of a Planar Undirected Network in 0(n log n) Time 56 E. Welzl
On the Density of Color-Families 68
Monday, July 13, Afternoon
SESSION 3: R. Sethi, Chairman
С Beeri fi M.Y. Vardi The Implication Problem for Data Dependencies 73
J.A. Makowsky Characterizing Data Base Dependencies 86
M. Sharir Data Flow Analysis of Applicative Programs 98
SESSION 4: C. Boehm, Chairman
N.D. Jones Flow Analysis of Lambda Expressions 114
J. Loeckx Algorithmic Specifications of Abstract Data Types 129
P.A. Subrahmanyam Nondeterminism in Abstract Data Types 148
VI
Tuesday, July 14, morning
SESSION 5: E. Shamir, Chairman
J.D. Ullman (Invited Speaker) A View of Directions in Relational Database Theory 165
C. Reutenauer A New Characterization of the Regular Languages 177
SESSION 6: H. Maurer, Chairman
J.E. Pin Langages Reconnaissables et Codage Prefixe Pur 184
J. Engelfriet S G. File
Passes, Sweeps and Visits 193
Tuesday, July 14, Afternoon
SESSION 7: G. Rozenberg, Chairman S. Sippu s E. Soisalon-Soininen
On LALR(k) Testing 208 E. Ukkonen
On Size Bounds for Deterministic Parsers 2.18 Y. Itzhaik S A. Yehudai
A Decision Procedure for the Equivalence of Two dpdas One of which is Linear 229
SESSION 8: Z. Manna, Chairman
A.R. Meyer, G. Mirkowska s R.S. Streett The Deducibility Problem in Propositional Dynamic Logic . 238
M. Ben-Ari, J.Y. Halpern & A. Pnueli Finite Models for Deterministic Propositional Dynamic
Logic ". 249
D. Lehmann, A. Pnueli S J. Stavi Impartiality, Justice and Fairness: The Ethics of
Concurrent Termination 264
Wednesday, July 15, Morning
SESSION 9: K. Mehlhorn, Chairman
A.S. Fraenkel & D. Lichtenstein Computing a Perfect Strategy for nxn Chess Requires Time
Exponential in n 278
O.H. Ibarra, B.S. Leininger & S. Moran On the Complexity of Simple Arithmetic Expressions 294
M. Snir Proving Lower Bounds for Linear Decision Trees 305
VII
SESSION 10: M. Nivat, Chairman M. Blattner & М. Latteux
Parikh-Bounded Languages 316 J. Karhumäki
Generalized Parikh Mappings and Homomorphisms 324 S. Istrail
Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types 333
Thursday, July 16, Morning
SESSION 11: J.W. deBakker, Chairman
E. Engeler (Invited Speaker) Problems and Logics of Programs not included
J.A. Bergstra S J.V. Tucker Algebraically Specified Programming Systems and Hoare's
Logic 348
SESSION 12: A.R. Meyer, Chairman
M. Moriconi & R.L. Schwartz Automatic Construction of Verification Condition
Generators from Hoare Logics 363
R. Sethi
Circular Expressions: Elimination of Static Environments 378
Thursday, July 16, Afternoon
SESSION 13: A. Salomaa, Chairman
B. Courcelle An Axiomatic Approach to the Korenjak-Hopcroft
Algorithms 393 E. Ehrenfeucht & G. Rozenberg
On the (Generalized) Post Correspondence Problem with Lists of Length 2 408
A. Itai, A.G. Konheim & M. Rodeh A Sparse Table Implementation of Priority Queues 417
SESSION 14: С P. Schnorr, Chairman A. Pettorossi
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems 432 N. Dershowitz
Termination of Linear Rewriting Systems 448 A. Pnueli S R. Zarhi
Realizing an Equational Specification 439
VIM
Friday, July 17, Morning
SESSION 15: A. Pnueli, Chairman
K.R. Apt & G.D. Plotkin A Cook's Tour of Countable Nondeterminism 479
E.M. Gurari s O.H. Ibarra The Complexity of Decision Problems for Finite-Turn
Multicounter Machines 495
K.N. King Alternating Multihead Finite Automata 506
SESSION 16: S. Even, Chairman
J. Pearl The Solution for the Branching Factor of the Alpha-Beta
Pruning Algorithm 521
K. Lieberherr Uniform Complexity and Digital Signatures 530
A. Shamir On the Generation of Cryptographically Strong Pseudo-
Random Sequences 544
Errata:
J.A. Makowsky (ICALP 80, pp. 409-421) Measuring the Expressive Power of Dynamic Logics: An
Application of Abstract Model Theory 551
Author Index 552