Sciweavers

335 search results - page 66 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
IROS
2006
IEEE
116views Robotics» more  IROS 2006»
14 years 1 months ago
On the Importance of Asymmetries in Grasp Quality Metrics for Tendon Driven Hands
Abstract— Grasp quality measures are important for understanding how to plan for and maintain appropriate and secure grasps for pick and place operations and tool use. Most grasp...
Jiaxin L. Fu, Nancy S. Pollard
FM
2005
Springer
98views Formal Methods» more  FM 2005»
14 years 1 months ago
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...
Richard Banach, Michael Poppleton, Czeslaw Jeske, ...
OOPSLA
2004
Springer
14 years 29 days ago
Practical predicate dispatch
Predicate dispatch is an object-oriented (OO) language mechanism for determining the method implementation to be invoked upon a message send. With predicate dispatch, each method ...
Todd D. Millstein
SYSTOR
2010
ACM
14 years 12 days ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman