Sciweavers

2661 search results - page 361 / 533
» Model Checking Performability Properties
Sort
View
JDWM
2007
112views more  JDWM 2007»
15 years 18 days ago
Empowering the OLAP Technology to Support Complex Dimension Hierarchies
Comprehensive data analysis has become indispensable in a variety of domains. OLAP (On-Line Analytical Processing) systems tend to perform poorly or even fail when applied to comp...
Svetlana Mansmann, Marc H. Scholl
PPOPP
2012
ACM
13 years 8 months ago
Synchronization views for event-loop actors
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
Joeri De Koster, Stefan Marr, Theo D'Hondt
142
Voted
FORTE
1994
15 years 2 months ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
SIGSOFT
2007
ACM
16 years 1 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
214
Voted
POPL
2009
ACM
16 years 1 months ago
The semantics of progress in lock-based transactional memory
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
Rachid Guerraoui, Michal Kapalka