Measuring static complexity
نویسندگان
چکیده
منابع مشابه
Measuring Static Complexity
The concept of "pattern" is introduced, formally defined, and used to analyze various measures of the complexity of finite binary sequences and other objects. The standard Kolmogoroff.Chaitin.Solomonoff complexity measure is considered, along with Bennett’s ’logical depth; Koppel’s "sophistication’, and Chaitin’s analysis ofthe complexity of geometric objects. The pattern.theoretic point of vie...
متن کاملMeasuring the Effect of Code Complexity on Static Analysis Results
To understand the effect of code complexity on static analysis, thirty-five format string vulnerabilities were selected from the National Vulnerability Database. We analyzed two sets of code for each vulnerability. The first set of code contained the vulnerability, while the second was a later version of the code in which the vulnerability had been fixed. We examined the effect of both code com...
متن کاملIdea: Measuring the Effect of Code Complexity on Static Analysis Results
To understand the effect of code complexity on static analysis, thirty-five format string vulnerabilities were studied. We analyzed two code samples for each vulnerability, one containing the vulnerability and one in which the vulnerability was fixed. We examined the effect of code complexity on the quality of static analysis results, including successful detection and false positive rates. Sta...
متن کاملMeasuring Testing Complexity
Since the birth of Software Industry there is a special interest in measuring the effort in terms of time and cost that a task requires. Nowadays, since applications are essential for Industry, the software developers need to measure different kind of aspects: quality, cost, reliability, etc. Complexity is another important aspect in which software engineers are interested. But, what does we me...
متن کاملMeasuring semantic complexity
We define semantic comple=ity using a new concept of mesni~g automata. We measure the semantic complexity of understanding of prepositional phrases, of aa "in depth understanding system", and ofa :natural language interface to an on-line calendar. We argue that it is possible to measure some semantic complexities of-natural langu~e processin8 systems before building them, and that.systems:that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1992
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171292000188