Sciweavers

TRIER
2002
13 years 10 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm
AIPS
2009
13 years 12 months ago
Dynamic Controllability of Temporally-flexible Reactive Programs
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
SOFTVIS
2006
ACM
14 years 4 months ago
Time travelling animated program executions
Visualizations of program executions are often generated on the fly. This has many advantages relative to off-line generation of animated video files. Video files, however, trivia...
Ken Kahn
PPOPP
2006
ACM
14 years 4 months ago
Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
Robert Springer, David K. Lowenthal, Barry Rountre...
ICTAI
2008
IEEE
14 years 5 months ago
Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang
NORDSEC
2009
Springer
14 years 5 months ago
Towards Practical Enforcement Theories
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...
Nataliia Bielova, Fabio Massacci, Andrea Michelett...
IDA
2009
Springer
14 years 5 months ago
Selecting Computer Architectures by Means of Control-Flow-Graph Mining
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
Frank Eichinger, Klemens Böhm
POPL
2010
ACM
14 years 8 months ago
Compositional May-Must Program Analysis: Unleashing the Power of Alternation
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
Aditya V. Nori, Patrice Godefroid, SaiDeep Tetali,...