Sciweavers

5109 search results - page 707 / 1022
» On Learning Limiting Programs
Sort
View
FAST
2008
15 years 7 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
154
Voted
CCS
2008
ACM
15 years 7 months ago
Code injection attacks on harvard-architecture devices
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
Aurélien Francillon, Claude Castelluccia
174
Voted
ICFP
2010
ACM
15 years 6 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
CCS
2010
ACM
15 years 5 months ago
AccessMiner: using system-centric models for malware protection
Models based on system calls are a popular and common approach to characterize the run-time behavior of programs. For example, system calls are used by intrusion detection systems...
Andrea Lanzi, Davide Balzarotti, Christopher Krueg...
160
Voted
BMCBI
2007
116views more  BMCBI 2007»
15 years 5 months ago
primetv: a viewer for reconciled trees
Background: Evolutionary processes, such as gene family evolution or parasite-host cospeciation, can often be viewed as a tree evolving inside another tree. Relating two given tre...
Bengt Sennblad, Eva Schreil, Ann-Charlotte Berglun...