Concept location is one of the fundamental activities during software maintenance which locates the parts of the source code where a specific concept is implemented. The methods f...
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...