Josep Díaz
Proceedings of the 10th Colloquium on Automata, Languages and Programming
ICALP, 1983.

@proceedings{ICALP-1983,
	address       = "Barcelona, Spain",
	editor        = "Josep Díaz",
	isbn          = "3-540-12317-2",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 10th Colloquium on Automata, Languages and Programming}",
	volume        = 154,
	year          = 1983,
}

Contents (59 items)

9 ×#on the
8 ×#semantics
4 ×#complexity
4 ×#multi
4 ×#problem
4 ×#process
3 ×#algebra
3 ×#algorithm
3 ×#bound
3 ×#data type

ICALP-1983-Abramsky #multi #on the #semantics

On Semantic Foundations for Applicative Multiprogramming (SA), pp. 1–14.

ICALP-1983-AptD #axiom #logic #using

An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (KRA, CD), pp. 15–27.

ICALP-1983-Arnold #behaviour #infinity

Topological Characterizations of Infinite Behaviours of Transition Systems (AA), pp. 28–38.

ICALP-1983-BakkerBKM #branch #linear #recursion #semantics

Linear Time and Branching Time Semantics for Recursion with Merge (JWdB, JAB, JWK, JJCM), pp. 39–51.

ICALP-1983-BakkerZ #ada #process #semantics

Processes and a Fair Semantics for the Ada Rendez-Vous (JWdB, JIZ), pp. 52–66.

ICALP-1983-BraP #dependence

Conditional Dependencies for Horizontal Decompositions (PDB, JP), pp. 67–82.

ICALP-1983-Brookes #csp #on the

On the Relationship of CCS and CSP (SDB), pp. 83–96.

ICALP-1983-BrookesR #behaviour #equivalence #logic #programming

Behavioural Equivalence Relations Induced by Programming Logics (SDB, WCR), pp. 97–108.

ICALP-1983-ChandraFL #bound #constant #problem

Lower Bounds for Constant Depth Circuits for Prefix Problems (AKC, SF, RJL), pp. 109–117.

ICALP-1983-ChoffrutK #bound #morphism #testing

Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.

ICALP-1983-CohenLP #distributed #problem #symmetry

Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (SC, DJL, AP), pp. 128–136.

ICALP-1983-CulikS #ambiguity #problem

Ambiguity and Decision Problems Concerning Number Systems (KCI, AS), pp. 137–146.

ICALP-1983-DarondeauK #on the #parallel #semantics

On the Observational Semantics of Fair Parallelism (PD, LK), pp. 147–159.

ICALP-1983-Dehne #algorithm #diagrams #nearest neighbour #on the

On O(N^4) Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Searching (FKHAD), pp. 160–172.

ICALP-1983-DelestV #algebra

Algebraic Languages and Polyominoes Enumeration (MPD, GV), pp. 173–181.

ICALP-1983-EdelsbrunnerW #on the #set

On the Number of Equal-Sized Semispaces of a Set of Points in the Plane (HE, EW), pp. 182–187.

ICALP-1983-EhrigWT #algebra #constraints #generative #specification

Algebraic Specifications with Generating Constraints (HE, EGW, JWT), pp. 188–202.

ICALP-1983-Fraenkel #fibonacci #game studies

Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches (ASF), pp. 203–225.

ICALP-1983-Gabarro #complexity

Initial Index: A New Complexity Function for Languages (JG), pp. 226–236.

ICALP-1983-Ganzinger #compilation #composition #data type #semantics

Modular Compiler Descriptions Based on Abstract Semantic Data Types (HG), pp. 237–249.

ICALP-1983-GathenK #finite #multi #polynomial

Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields (JvzG, EK), pp. 250–263.

ICALP-1983-GoltzR #process

Processes of Place/Transition-Nets (UG, WR), pp. 264–277.

ICALP-1983-HalpernMM #hardware #semantics

A Hardware Semantics Based on Temporal Intervals (JYH, ZM, BCM), pp. 278–291.

ICALP-1983-HambruschS #bound #graph #problem

Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.

ICALP-1983-HartS #concurrent #how #probability

Concurrent Probabilistic Program, or: How to Schedule if You Must (SH, MS), pp. 304–318.

ICALP-1983-HartmanisHY #set

Computation Times of NP Sets of Different Densities (JH, YY), pp. 319–330.

ICALP-1983-HsiangD #proving #theorem proving

Rewrite Methods for Clausal and Non-Clausal Theorem Proving (JH, ND), pp. 331–346.

ICALP-1983-Indermark #complexity #infinity

Complexity of Infinite Trees (KI), pp. 347–360.

ICALP-1983-JouannaudKK #algorithm #equation #incremental #unification

Incremental Construction of Unification Algorithms in Equational Theories (JPJ, CK, HK), pp. 361–373.

ICALP-1983-Kamimura #attribute grammar #automaton

Tree Automata and Attribute Grammars (TK), pp. 374–384.

ICALP-1983-KamimuraT #effectiveness

Effectively Given Spaces (TK, AT), pp. 385–396.

ICALP-1983-Karhumaki #monad

A Note on Intersections of Free Submonoids of a Free Monoid (JK), pp. 397–407.

ICALP-1983-LangSSS #algorithm #performance #sorting

A Fast Sorting Algorithm for VLSI (HWL, MS, HS, HS), pp. 408–419.

ICALP-1983-LatteuxL #composition #morphism #on the

On the Composition of Morphisms and Inverse Morphisms (ML, JL), pp. 420–432.

ICALP-1983-RestM #complexity #finite #on the

On the Group Complexity of a Finite Language (EBLR, SWM), pp. 433–444.

ICALP-1983-LehmannS #reasoning

Reasoning with Time and Chance (DJL, SS), pp. 445–457.

ICALP-1983-Lenstra #multi

Factoring Multivariate Integral Polynomials (AKL), pp. 458–465.

ICALP-1983-LescanneS #case study #data type #on the

On the Study Data Structures: Binary Tournaments with Repeated Keys (PL, JMS), pp. 466–477.

ICALP-1983-MakedonS #linear

Minimizing Width in Linear Layouts (FM, IHS), pp. 478–490.

ICALP-1983-MannaP #precedence #proving

Proving Precedence Properties: The Temporal Way (ZM, AP), pp. 491–512.

ICALP-1983-Moller #algebra #data-driven #evaluation #functional #lazy evaluation #semantics

An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven) Evaluation and its Application to a Functional Language (BM), pp. 513–526.

ICALP-1983-MunroP #data type

Searchability in Merging and Implicit Data Structures (JIM, PVP), pp. 527–535.

ICALP-1983-MycroftN #abstract interpretation #using

Strong Abstract Interpretation Using Power Domains (AM, FN), pp. 536–547.

ICALP-1983-NicolaH #equivalence #process #testing

Testing Equivalence for Processes (RDN, MH), pp. 548–560.

ICALP-1983-OlderogH #communication #process #semantics

Specification-Oriented Semantics for Communicating Processes (ERO, CARH), pp. 561–572.

ICALP-1983-Orponen #complexity

Complexity Classes of Alternating Machines with Oracles (PO), pp. 573–584.

ICALP-1983-Pansiot #french

A Propos d’une Conjecture de F. Dejean sur les Répétitions dans les Mots (JJP), pp. 585–596.

ICALP-1983-PaulVW #parallel

Parallel Dictionaries in 2-3 Trees (WJP, UV, HW), pp. 597–609.

ICALP-1983-Perrin #french

Varietes de Semigroupes et Mots Infinis (DP), pp. 610–616.

ICALP-1983-Pin #french

Arbres et Hierarchies de Concatenation (JÉP), pp. 617–628.

ICALP-1983-ReifS #logic #multi #network

A Multiprocess Network Logic with Temporal and Spatial Modalities (JHR, APS), pp. 629–639.

ICALP-1983-SatoT #logic programming #source code

Enumeration of Success Patterns in Logic Programs (TS, HT), pp. 640–652.

ICALP-1983-SchoningB

Immunity (US, RVB), pp. 653–661.

ICALP-1983-Smyth #perspective

Power Domains and Predicate Transformers: A Topological View (MBS), pp. 662–675.

ICALP-1983-SpinradV #2d #morphism #partial order #recognition

Recognition and Isomorphism of Two Dimensional Partial Orders (JPS, JV), pp. 676–686.

ICALP-1983-Vitanyi #on the #simulation

On the Simulation of Many Storage Heads by a Single One (PMBV), pp. 687–694.

ICALP-1983-Winskel

Synchronisation Trees (GW), pp. 695–711.

ICALP-1983-YannakakisKCP #clustering #graph

Cutting and Partitioning a Graph aifter a Fixed Pattern (MY, PCK, SSC, CHP), pp. 712–722.

ICALP-1983-Lange

Context-Free Controlled ETOL Systems (KJL), pp. 723–733.