Sciweavers

468 search results - page 47 / 94
» Computationally Feasible Automated Mechanism Design: General...
Sort
View
AISC
1998
Springer
14 years 20 days ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
DAC
2003
ACM
14 years 9 months ago
Accurate timing analysis by modeling caches, speculation and their interaction
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
Xianfeng Li, Tulika Mitra, Abhik Roychoudhury
GROUP
2009
ACM
14 years 3 months ago
Grounding interpersonal privacy in mediated settings
Recent technologies supporting continuous connectivity enable sustained awareness within social networks, which eventually boosts interaction and therefore the need of individuals...
Natalia A. Romero, Panos Markopoulos
ICFP
2008
ACM
14 years 8 months ago
Implicitly-threaded parallelism in Manticore
The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-s...
Matthew Fluet, Mike Rainey, John H. Reppy, Adam Sh...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 2 months ago
Apply Model Checking to Security Analysis in Trust Management
Trust management is a form of access control that uses delegation to achieve scalability beyond a single organization or federation. However, delegation can be difficult to contr...
Mark Reith, Jianwei Niu, William H. Winsborough