127
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
137
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
142
Voted
CSMR
2004
IEEE
15 years 7 months ago
2004
IEEE
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
165
Voted
CSMR
2004
IEEE
15 years 7 months ago
2004
IEEE
In software product families, the full benefit of reuse can only be achieved if traceability of requirements to architecture, components and further down to source code is support...
104
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
