Sciweavers

769 search results - page 51 / 154
» Analysis of recursively parallel programs
Sort
View
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 10 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
CJ
2010
150views more  CJ 2010»
13 years 6 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
MICRO
1993
IEEE
131views Hardware» more  MICRO 1993»
14 years 29 days ago
Superblock formation using static program analysis
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
Richard E. Hank, Scott A. Mahlke, Roger A. Bringma...
IPPS
1998
IEEE
14 years 13 days ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
LOPSTR
2004
Springer
14 years 2 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
Pedro López-García, Francisco Bueno,...