Sciweavers

2398 search results - page 227 / 480
» Constraint Programming and Graph Algorithms
Sort
View
172
Voted
SCAM
2002
IEEE
15 years 11 months ago
Precise Call Graph Construction in the Presence of Function Pointers
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
JGAA
2000
85views more  JGAA 2000»
15 years 6 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
POPL
1993
ACM
15 years 10 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
PLDI
2011
ACM
14 years 9 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
PAAPP
2006
141views more  PAAPP 2006»
15 years 6 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko