Sciweavers

681 search results - page 90 / 137
» Superblock formation using static program analysis
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICS
2001
Tsinghua U.
14 years 9 days ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
IPPS
1996
IEEE
14 years 10 hour ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
PASTE
2005
ACM
14 years 1 months ago
An empirical framework for comparing effectiveness of testing and property-based formal analysis
Today, many formal analysis tools are not only used to provide certainty but are also used to debug software systems – a role that has traditional been reserved for testing tool...
Jeremy S. Bradbury, James R. Cordy, Jürgen Di...
SP
2008
IEEE
14 years 2 months ago
Preventing Memory Error Exploits with WIT
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
Periklis Akritidis, Cristian Cadar, Costin Raiciu,...