Sciweavers

632 search results - page 103 / 127
» Combining programming with theorem proving
Sort
View
SOFSEM
2009
Springer
14 years 4 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
POPL
2010
ACM
14 years 5 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
RAID
2007
Springer
14 years 1 months ago
Understanding Precision in Host Based Intrusion Detection
Abstract. Many host-based anomaly detection systems monitor process execution at the granularity of system calls. Other recently proposed schemes instead verify the destinations of...
Monirul I. Sharif, Kapil Singh, Jonathon T. Giffin...
CADE
2008
Springer
14 years 8 months ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic
FOAL
2009
ACM
14 years 2 months ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory