7311 search results - page 1287 / 1463 » Time in State Machines |
141
click to vote
AIPS
1994
15 years 7 months ago
1994
When a plan involves hundreds or thousands of events over time it can be di cult or impossible to tell whether those events are unfolding \according to plan" and to assess th...
138
click to vote
CASCON
1996
15 years 7 months ago
1996
Software development managers strive to control all of the factors that might impact the success of their projects. However, not all of these factors have been identified, much le...
175
click to vote
AIPS
2009
15 years 7 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
159
click to vote
CHES
2010
Springer
15 years 7 months ago
2010
Springer
This paper introduces a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually s...
182
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...