A large body of research in the measurement of software complexity has been focused on imperative programs, but little e ort has been made for logic programs. In this paper, a set of complexity metrics for concurrent logic programs are proposed, which are speci cally designed to quantify the information ow of concurrent logic programs. These metrics are de ned based on the argument dependence n...

As multitasking environments and applications become more and more common, the quality and efficiency of these applications becomes more and more important. While for single-threaded programs there are many complexity metrics in use since the 1970’s, so far there was no way to efficiently measure and compare the complexity of multitasking programs, and the affect of the concurrency on the overa...

This paper introduces a set of simple software complexity metrics that has been inspired by developments within cognitive psychology. Complexity measures are constructed by analysing the distance between components of a program. The greater the distance between program fragments, the greater the resulting spatial complexity of a program. Suggestions are made as to how spatial complexity measure...

The paper discusses the reasons of complexity rise in ERP system SAP R/3 and proposes a method for measuring complexity of SAP. A program in ABAP for measuring complexity of particular SAP implementation is proposed as a tool for keeping ERP complexity under control. Main principle of the measurement method is counting the number of items or relations in the system. The program is based on coun...

Most program profiling methods output the execution time of one specific program execution, but not its computational complexity class in terms of the big-O notation. Perfrewrite is a tool based on LLVM’s Clang compiler to rewrite a program such that it tracks semantic information while the program executes and uses it to guessmemory usage, communication and computational complexity. While sour...

We study a class of program schemes, NPSB, in which, aside from basic assignments, nondeterministic guessing and while loops, we have access to arrays; but where these arrays are binary write-once in that they are initialized to ‘zero’ and can only ever be set to ‘one’. We show, amongst other results, that: NPSB can be realized as a vectorized Lindström logic; there are problems accepted by pro...

the present meta-analysis was conducted to provide a quantitative measure of the overall effects of task complexity on chinese efl learners’ language production. based on the strict inclusion criteria, 12 primary studies were synthesized according to key features. eleven of them were meta-analyzed to investigate effects of raising the resource-directing task complexity. results revealed that ...

In [] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal μ-calculus and Modal μ-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program comp...