Sciweavers

443 search results - page 12 / 89
» Relations in Concurrency
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 11 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
SEW
2006
IEEE
14 years 1 months ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
KDD
1995
ACM
128views Data Mining» more  KDD 1995»
13 years 11 months ago
Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach
The main objective of machine discovery is the determination of relations between data and of data models. In the paper we describe a method for discovery of data models represent...
Andrzej Skowron, Zbigniew Suraj
FUIN
2007
120views more  FUIN 2007»
13 years 7 months ago
Concurrent Turing Machines
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
Berndt Farwer, Manfred Kudlek, Heiko Rölke