Sciweavers

5832 search results - page 117 / 1167
» Software complexity and maintainability
Sort
View
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 3 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
ICST
2008
IEEE
15 years 10 months ago
Efficient Test Data Generation for Variables with Complex Dependencies
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...
Armin Beer, Stefan Mohacsi
DATE
2005
IEEE
131views Hardware» more  DATE 2005»
15 years 9 months ago
Unified Modeling of Complex Real-Time Control Systems
Complex real-time control system is a software dense and algorithms dense system, which needs modern software engineering techniques to design. UML is an object-oriented industria...
He Hai, Zhong Yi-fang, Cai Chi-lan
TAPSOFT
1997
Springer
15 years 8 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
ICSE
2007
IEEE-ACM
16 years 3 months ago
Korat: A Tool for Generating Structurally Complex Test Inputs
This paper describes the Korat tool for constraint-based generation of structurally complex test inputs for Java programs. Korat takes (1) an imperative predicate that specifies t...
Aleksandar Milicevic, Sasa Misailovic, Darko Marin...