352 search results - page 14 / 71 » Evaluating the imprecision of static analysis |
102
click to vote
COMPSAC
2009
IEEE
15 years 8 months ago
2009
IEEE
—A software birthmark is an inherent characteristic of a program that can be used to identify that program. By comparing the birthmarks of two programs, it is possible to infer i...
128
click to vote
DELTA
2004
IEEE
15 years 5 months ago
2004
IEEE
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
SIGSOFT
2002
ACM
16 years 2 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...
145
Voted
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
112
click to vote
ACL
2004
15 years 3 months ago
2004
This paper introduces an indexing method based on static analysis of grammar rules and type signatures for typed feature structure grammars (TFSGs). The static analysis tries to p...