Sciweavers

4719 search results - page 554 / 944
» Newtonian program analysis
Sort
View
LCPC
1999
Springer
15 years 11 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
ISCA
1992
IEEE
125views Hardware» more  ISCA 1992»
15 years 11 months ago
Limits of Control Flow on Parallelism
This paper discusses three techniques useful in relaxing the constraints imposed by control flow on parallelism: control dependence analysis, executing multiple flows of control s...
Monica S. Lam, Robert P. Wilson
TAPSOFT
1995
Springer
15 years 10 months ago
Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
Hanne Riis Nielson, Flemming Nielson
CCS
2008
ACM
15 years 8 months ago
On the protocol composition logic PCL
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
Cas J. F. Cremers
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 8 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...