Sciweavers

ASWEC
2010
IEEE
13 years 8 months ago
Model-Centered Customizable Architectural Design Decisions Management
—Architectural Design Decisions (ADD) form a key element of Architectural Knowledge (AK), which plays a vital role in the software architecture process. To help manage ADDs, seve...
Lianping Chen, Muhammad Ali Babar, Haiqi Liang
ASWEC
2010
IEEE
13 years 8 months ago
Scenario-Based Validation: Beyond the User Requirements Notation
—A quality-driven approach to software development and testing demands that, ultimately, the requirements of stakeholders be validated against the actual behavior of an implement...
Dave Arnold, Jean-Pierre Corriveau, Wei Shi
ASWEC
2010
IEEE
13 years 8 months ago
On the Use of Properties in Java Applications
—When building software systems, developers have to weigh the benefits of using one specific solution approach against the risks and costs of using another one. This process is...
Markus Lumpe, Samrian Mahmud, Rajesh Vasa
ASWEC
2010
IEEE
13 years 8 months ago
Studying Software Evolution for Taming Software Complexity
—Reducing software complexity is key to reducing software maintenance costs. To discover complexity-reducing practices, in this paper we study the evolution of seven sizable open...
Steve D. Suh, Iulian Neamtiu
ASWEC
2010
IEEE
13 years 8 months ago
Modeling Multigrid Algorithms for Variational Imaging
Isabel Dietrich, Reinhard German, Harald Koestler,...
ASWEC
2010
IEEE
13 years 8 months ago
Support for Business Process Flexibility in Service Compositions: An Evaluative Survey
— Service compositions provide a promising way to realize and coordinate automated support for business activities and processes. These business processes and their automated sup...
Malinda Kapuruge, Jun Han, Alan W. Colman
AOSD
2010
ACM
13 years 8 months ago
An architecture for composing embedded domain-specific languages
Embedded domain-specific languages (EDSLs) are said to be easier to compose than DSLs that are implemented by preprocessors. However, existing approaches focus on composition scen...
Tom Dinkelaker, Michael Eichberg, Mira Mezini
FSTTCS
2008
Springer
13 years 8 months ago
Some Sieving Algorithms for Lattice Problems
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
Vikraman Arvind, Pushkar S. Joglekar
FSTTCS
2008
Springer
13 years 8 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
FSTTCS
2008
Springer
13 years 8 months ago
A new upper bound for 3-SAT
Josep Díaz, Lefteris M. Kirousis, Dieter Mi...