15777 search results - page 2774 / 3156 » Engineering in Software |
204
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
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...
176
click to vote
SIGSOFT
2004
ACM
16 years 7 months ago
2004
ACM
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
231
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
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...
155
click to vote
SIGSOFT
2002
ACM
16 years 7 months ago
2002
ACM
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...
194
click to vote
ICSE
2004
IEEE-ACM
16 years 7 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...