Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=506

• Embeddings among concurrent programming languages
  Ehud Shapiro
  Lecture Notes in Computer Science 506, 1991, pp. 58
• Loosely-coupled processes
  Jayadev Misra
  Lecture Notes in Computer Science 506, 1991, pp. 1-26
• Rendez-vous with metric semantics
  J.W. de Bakker, E.P. de Vink
  Lecture Notes in Computer Science 506, 1991, pp. 27-57
• Invariants and paradigms of concurrency theory
  Ryszard Janicki, Maciej Koutny
  Lecture Notes in Computer Science 506, 1991, pp. 59-74
• Acceptance automata: A framework for specifying and verifying TCSP parallel systems
  Luis M. Alonso, Ricardo Peña
  Lecture Notes in Computer Science 506, 1991, pp. 75-91
• Models for dynamically placed concurrent processes
  J. Fanchon, D. Millot
  Lecture Notes in Computer Science 506, 1991, pp. 92-109
• Formalisation of the behavior of actors by colored Petri nets and some applications
  Yamina Sami, Guy Vidal-Naquet
  Lecture Notes in Computer Science 506, 1991, pp. 110-127
• Program refinement in fair transition systems
  Ambuj K. Singh
  Lecture Notes in Computer Science 506, 1991, pp. 128-147
• Communication abstraction and refinement
  J.T. Yantchev
  Lecture Notes in Computer Science 506, 1991, pp. 148-165
• On the semantics of languages for massively parallel SIMD architectures
  Luc Bougé
  Lecture Notes in Computer Science 506, 1991, pp. 166-183
• A denotational real-time semantics for shared processors
  Jozef Hooman
  Lecture Notes in Computer Science 506, 1991, pp. 184-201
• Concurrent clean
  E.G.J.M.H. Nöcker, J.E.W. Smetsers, M.C.J.D. van Eekelen, M.J. Plasmeijer
  Lecture Notes in Computer Science 506, 1991, pp. 202-219
• The Scriptic programming language
  André van Delft
  Lecture Notes in Computer Science 506, 1991, pp. 220-237
• Structural operational semantics for Kernel Andorra Prolog
  Seif Haridi, Catuscia Palamidessi
  Lecture Notes in Computer Science 506, 1991, pp. 238-253
• Customization of first-class tuple-spaces in a higher-order language
  Suresh Jagannathan
  Lecture Notes in Computer Science 506, 1991, pp. 254-276
• A formal specification of the process trellis
  Michael Factor
  Lecture Notes in Computer Science 506, 1991, pp. 277-294
• Strong bisimilarity on nets revisited
  C. Autant, Z. Belmesk, Ph. Schnoebelen
  Lecture Notes in Computer Science 506, 1991, pp. 295-312
• A configuration approach to parallel programming
  Jeff Magee, Naranker Dulay
  Lecture Notes in Computer Science 506, 1991, pp. 313-330
• Chaotic linear system solvers in a variable-grain data-driven multiprocessor system
  Jean-Luc Gaudiot, Chih-Ming Lin
  Lecture Notes in Computer Science 506, 1991, pp. 331-348
• Parallel associative combinator evaluation
  Martin Waite, Bret Giddings, Simon Lavington
  Lecture Notes in Computer Science 506, 1991, pp. 349-366
• Static analysis of term graph rewriting systems
  Chris Hankin
  Lecture Notes in Computer Science 506, 1991, pp. 367-384
• Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor
  J. Briat, M. Favre, C. Geyer, J. Chassin de Kergommeaux
  Lecture Notes in Computer Science 506, 1991, pp. 385-402
• Flexible scheduling of OR-parallelism in Aurora: The Bristol scheduler
  Anthony Beaumont, S. Muthu Raman, Péter Szeredi, David H.D. Warren
  Lecture Notes in Computer Science 506, 1991, pp. 403-420
• Virtual memory support for OR-parallel logic programming systems
  André Véron, Jiyang Xu, S.A. Delgado-Rannauro, K. Schuerman
  Lecture Notes in Computer Science 506, 1991, pp. 421-438
• Interfacing engines and schedulers in OR-parallel Prolog systems
  Péter Szeredi, Rong Yang, Mats Carlsson
  Lecture Notes in Computer Science 506, 1991, pp. 439-453