Sciweavers

15727 search results - page 2723 / 3146
» Software Engineering - Introduction
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
SIGSOFT
2004
ACM
16 years 7 months ago
Merging partial behavioural models
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
Marsha Chechik, Sebastián Uchitel
209
Voted
SIGSOFT
2003
ACM
16 years 7 months ago
Protecting C programs from attacks via invalid pointer dereferences
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
Suan Hsi Yong, Susan Horwitz
SIGSOFT
2002
ACM
16 years 7 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
WWW
2009
ACM
16 years 7 months ago
All your contacts are belong to us: automated identity theft attacks on social networks
Social networking sites have been increasingly gaining popularity. Well-known sites such as Facebook have been reporting growth rates as high as 3% per week [5]. Many social netwo...
Leyla Bilge, Thorsten Strufe, Davide Balzarotti, E...
« Prev « First page 2723 / 3146 Last » Next »