5832 search results - page 147 / 1167 » Software complexity and maintainability |
128
click to vote
SIGSOFT
1994
ACM
15 years 8 months ago
1994
ACM
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
159
click to vote
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
129
Voted
CC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
223
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
135
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...