ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
Source code is the target and final outcome of software development. By focusing our research and analysis on source code only, we risk forgetting that software is the product of...
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
—Dynamic reconfiguration – the ability to hot swap a component, or to introduce a new component into the system – is essential to supporting evolutionary change in long-live ...
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
A dependability case is an explicit, end-to-end argument, based on concrete evidence, that a system satisfies a critical property. We report on a case study constructing a depend...
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
Successful software systems continuously change their requirements and thus code. When this happens, some existing tests get broken because they no longer reflect the intended be...
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
We present the first IDE augmented with static detection of inconsistent paths for simplifying the development and debugging of any application involving XPath expressions. Categ...
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...