523 search results - page 55 / 105 » A General Model for Reachability Testing of Concurrent Progr... |
113
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
150
Voted
CCS
2011
ACM
14 years 2 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
138
Voted
VEE
2012
ACM
13 years 10 months ago
2012
ACM
As cloud-based computation becomes increasingly important, providing a general computational interface to support datacenterscale programming has become an imperative research age...
145
click to vote
INFORMS
1998
15 years 2 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
128
Voted
POPL
2012
ACM
13 years 10 months ago
2012
ACM
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...