200 search results - page 16 / 40 » Symbolic Equivalences for Open Systems |
CONCURRENCY
2000
13 years 7 months ago
2000
When comparing OpenMP to other parallel programming models, it is easier to choose between OpenMP and MPI than between OpenMP and POSIX Threads (Pthreads). With languages like C a...
ACMMSP
2006
ACM
14 years 1 months ago
2006
ACM
Open nesting provides a loophole in the strict model of atomic transactions. Moss and Hosking suggested adapting open nesting for transactional memory, and Moss and a group at Sta...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...