12194 search results - page 44 / 2439 » cans 2010 |
94
Voted
ECCC
2007
15 years 15 days ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
ENTCS
2007
15 years 15 days ago
2007
We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a v...
88
Voted
ENTCS
2007
15 years 15 days ago
2007
Composing and orchestrating software components is a fundamental concern in modern software engineering. This paper addresses the possibility of such orchestration being dynamic, ...
94
Voted
ENTCS
2002
15 years 10 days ago
2002
In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented languag...
105
Voted
ENTCS
2002
15 years 10 days ago
2002
We show that the traditional notion of superposition as used for supporting parallel program design can subsume both composition and refinement relationships when non-deterministi...