PARLE '91. Parallel Architectures and Languages Europe

Inhaltsverzeichnis

• Loosely-coupled processes (preliminary version).
• Rendez-vous with metric semantics.
• Embeddings among concurrent programming languages.
• Invariants and paradigms of concurrency theory.
• Acceptance Automata: A framework for specifying and verifying TCSP parallel systems.
• Models for dynamically placed concurrent processes.
• Formalisation of the behavior of actors by colored Petri nets and some applications.
• Program refinement in fair transition systems.
• Communication abstraction and refinement.
• On the semantics of languages for massively parallel SIMD architectures.
• A denotational real-time semantics for shared processors.
• Concurrent clean.
• The scriptic programming language.
• Structural operational semantics for Kernel Andorra Prolog.
• Customization of first-class tuple-spaces in a higher-order language.
• A formal specification of the process trellis.
• Strong bisimilarity on nets revisited.
• A configuration approach to parallel programming.
• Chaotic linear system solvers in a variable-grain data-driven multiprocessor system.
• Parallel associative combinator evaluation.
• Static analysis of term graph rewriting systems.
• Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor.
• Flexible scheduling of or-parallelism in Aurora: The Bristol scheduler.
• Virtual memory support for OR-parallel logic programming systems.
• Interfacing engines and schedulers in Or-Parallel Prolog systems.
• Reduction of code space in parallel logic programming systems.
• Search level parallel processing of production systems.