Sciweavers

1710 search results - page 54 / 342
» High-Level Programs and Program Conditions
Sort
View
SIGSOFT
2005
ACM
14 years 8 months ago
Arithmetic program paths
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
Manos Renieris, Shashank Ramaprasad, Steven P. Rei...
TAICPART
2010
IEEE
133views Education» more  TAICPART 2010»
13 years 6 months ago
Localizing Defects in Multithreaded Programs by Mining Dynamic Call Graphs
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...
Frank Eichinger, Victor Pankratius, Philipp W. L. ...
GG
2004
Springer
14 years 1 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
LOPSTR
1994
Springer
14 years 2 days ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
MP
2006
103views more  MP 2006»
13 years 8 months ago
Assessing solution quality in stochastic programs
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
Güzin Bayraksan, David P. Morton