Sciweavers

505 search results - page 74 / 101
» Global Model Checking of Ordered Multi-Pushdown Systems
Sort
View
ISSTA
2004
ACM
14 years 25 days ago
Automating commutativity analysis at the design level
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by different use...
Greg Dennis, Robert Seater, Derek Rayside, Daniel ...
CONCUR
2000
Springer
13 years 11 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
CLEF
2009
Springer
13 years 8 months ago
Information Retrieval Baselines for the ResPubliQA Task
This paper describes the baselines proposed for the ResPubliQA 2009 task. These baselines are purely based on information retrieval techniques. The selection of an adequate retrie...
Joaquín Pérez-Iglesias, Guillermo Ga...
IPPS
2009
IEEE
14 years 2 months ago
Scalable RDMA performance in PGAS languages
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
Montse Farreras, George Almási, Calin Casca...
ENTCS
2007
103views more  ENTCS 2007»
13 years 7 months ago
Policy-based Coordination in PAGODA: A Case Study
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environme...
Carolyn L. Talcott