Sciweavers

606 search results - page 52 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
HPCA
2009
IEEE
16 years 11 days ago
Dacota: Post-silicon validation of the memory subsystem in multi-core designs
The number of functional errors escaping design verification and being released into final silicon is growing, due to the increasing complexity and shrinking production schedules ...
Andrew DeOrio, Ilya Wagner, Valeria Bertacco
CCS
2004
ACM
15 years 5 months ago
Lessons learned using alloy to formally specify MLS-PCA trusted security architecture
In order to solve future Multi Level Security (MLS) problems, we have developed a solution based on the DARPA Polymorphous Computing Architecture (PCA). MLS-PCA uses a novel distr...
Brant Hashii
CAV
2000
Springer
97views Hardware» more  CAV 2000»
15 years 4 months ago
Detecting Errors Before Reaching Them
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
DIMVA
2009
15 years 27 days ago
Defending Browsers against Drive-by Downloads: Mitigating Heap-Spraying Code Injection Attacks
Drive-by download attacks are among the most common methods for spreading malware today. These attacks typically exploit memory corruption vulnerabilities in web browsers and brows...
Manuel Egele, Peter Wurzinger, Christopher Kruegel...
IPPS
2007
IEEE
15 years 6 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...