6568 search results - page 1015 / 1314 » Reducing the Complexity of Reductions |
170
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
164
Voted
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
194
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
176
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
170
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, a novel diagnosis method is proposed. The proposed technique uses machine learning techniques instead of traditional cause-effect and/or effect-cause analysis. The ...