5832 search results - page 118 / 1167 » Software complexity and maintainability |
126
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
112
click to vote
APL
1998
ACM
15 years 8 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
114
click to vote
FSTTCS
1994
Springer
15 years 7 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
119
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
114
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...