Sciweavers

454 search results - page 39 / 91
» Visualization of Program Dependence Graphs
Sort
View
COMPSAC
2007
IEEE
14 years 2 months ago
A Combined Concept Location Method for Java Programs
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...
Dapeng Liu, Shaochun Xu
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 3 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
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 ...
Hans D. Mittelmann, Jiming Peng
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 10 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
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...
CP
2000
Springer
14 years 25 days ago
Practical Investigation of Constraints with Graph Views
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...
Tobias Müller
FMCO
2003
Springer
102views Formal Methods» more  FMCO 2003»
14 years 1 months ago
Preserving Properties Under Change
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...
Heike Wehrheim