Sciweavers

6608 search results - page 307 / 1322
» On the Completeness of Model Checking
Sort
View
SIGSOFT
2001
ACM
16 years 7 months ago
Detecting implied scenarios in message sequence chart specifications
Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenarios describe how system compo...
Jeff Kramer, Jeff Magee, Sebastián Uchitel
PETRA
2009
ACM
16 years 1 months ago
A technological infrastructure design for a pediatric oncology network
In Italy, the service of Pediatric oncology is very centralized and granted by high-specialized medical structures. In the Italian Regione Campania there are just few of such medi...
Aniello Murano
196
Voted
IEEEPACT
2006
IEEE
16 years 27 days ago
Testing implementations of transactional memory
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
Chaiyasit Manovit, Sudheendra Hangal, Hassan Chafi...
195
Voted
PLDI
2003
ACM
16 years 3 days ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
226
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman