Linda
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Comparing communication primitives via their relative expressive power
- Dynamic management of capabilities in a network aware coordination language
- LMNtal as a hierarchical logic programming language
- NetWorkSpace: A coordination system for high-productivity environments
- A process algebraic view of Linda coordination primitives
- Refining multiset transformers
- Entailment-based actions for coordination
- CS-Prolog
- The Linda alternative to message-passing systems
- Case studies in asynchronous data parallelism
- Distributed programming with logic tuple spaces
- simpA
- Klava
- Fairness in shared invocation servicing
- New architectures for constructed complex systems
- MetaKlaim
- SafeDpi
- MANIFOLD
- A transition system semantics for the control-driven coordination language MANIFOLD
- Comparing three semantics for Linda-like languages
- Types for access control
- Linda-based applicative and imperative process algebras
- IC2D
- Towards an integration science. The influence of Richard Bellman on our research.
- GRID Infoware
- SLMC
- A semantic theory of the Internet of Things
- Semantic models of a timed distributed dataspace architecture
- A coordination approach to mobile components
- AgentSpeak
- Jason
- Moise+
- Reo
- PICCOLA
- On the expressiveness of Linda coordination primitives.
- Trace and testing equivalence on asynchronous processes
- 2APL
- Expired data collection in shared dataspaces.
- Abstractions for fault-tolerant global computing
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Asynchronous communication model based on linear logic
- COWS
- CLIPS
- Erlang
- LMNtal
- Process calculi as a tool for studying coordination, contracts and session types
- On the expressiveness of multiplicities in data-based coordination languages
- From distributed coordination to field calculus and aggregate computing
- Reoservice
- PAGODA
- Pict
- WADE
- Satin
- CometG
- Rebeca
- Viptos
- KLAIM
- LIME
- Sumatra
- Twisted
- NetWorkSpace
- XPi
- Janus
- MOMI
- Lucinda
- Chord
- QuakeTM
- Succinct
- SCELlight
- Expressiveness of concurrent intensionality
- tKlaim
- Gridbus
- HBase
- A formal approach to the engineering of domain-specific distributed systems
- TK
- PIPER
- PICL
- Jadex
- CArtAgO
- Fuzzydl
- Pastry
- Basic observables for a calculus for global computing
- On the collective sort problem for distributed tuple spaces
- SDEF
- Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
- A process algebraic view of shared dataspace coordination
- On the expressive power of \textsc{Klaim}-based calculi
- Scheme
- The seal calculus
- MOMI: a calculus for mobile mixins
- Quantitative information in the tuple space coordination model
- INGRES
- Implementing set objects in dynamic distributed systems
- GraphBLAS
- A sorted semantic framework for applied process calculi (extended abstract)
- Comparative analysis of the expressiveness of shared dataspace coordination
- Defining actions in concurrent declarative programming
- Structuring operational semantics: simplification and computation
- Comparing three coordination models: Reo, ARC, and RRD
- Coordination models Orc and Reo compared
This page was built for software: Linda
