Sciweavers

1559 search results - page 125 / 312
» Fundamentals of Generic Programming
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ICPP
2002
IEEE
15 years 2 months ago
Pattern-Based Parallel Programming
The advantages of pattern-based programming have been well-documented in the sequential literature. However patterns have yet to make their way into mainstream parallel computing,...
Steven Bromling, Steve MacDonald, John Anvik, Jona...
SIGSOFT
1994
ACM
15 years 2 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
ECOOP
2008
Springer
14 years 11 months ago
Externalizing Java Server Concurrency with CAL
One of the most important decisions about the architecture of a server program is its concurrency mechanisms. However, a good concurrency model for general-purpose server programs ...
Charles Zhang, Hans-Arno Jacobsen
IJNSEC
2008
150views more  IJNSEC 2008»
14 years 10 months ago
Tamper Resistant Software Through Intent Protection
One approach to protect distributed systems implemented with mobile code is through program obfuscation. Disguising program intent is a form of information hiding that facilitates...
Alec Yasinsac, J. Todd McDonald