Sciweavers

6829 search results - page 1264 / 1366
» Quantitative Generalizations of Languages
Sort
View
139
Voted
SIGSOFT
2009
ACM
16 years 4 months ago
Darwin: an approach for debugging evolving programs
Debugging refers to the laborious process of finding causes of program failures. Often, such failures are introduced when a program undergoes changes and evolves from a stable ver...
Dawei Qi, Abhik Roychoudhury, Zhenkai Liang, Kapil...
145
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
SIGSOFT
2007
ACM
16 years 4 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SIGSOFT
2007
ACM
16 years 4 months ago
Mining specifications of malicious behavior
Malware detectors require a specification of malicious behavior. Typically, these specifications are manually constructed by investigating known malware. We present an automatic t...
Mihai Christodorescu, Somesh Jha, Christopher Krue...
SIGSOFT
2007
ACM
16 years 4 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...
« Prev « First page 1264 / 1366 Last » Next »