Sciweavers

1882 search results - page 162 / 377
» Transformational Programming and Forests
Sort
View
MICRO
1993
IEEE
131views Hardware» more  MICRO 1993»
15 years 2 months 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...
GPCE
2008
Springer
14 years 11 months ago
Program refactoring using functional aspects
A functional aspect is an aspect that has the semantics of a transformation; it is a function that maps a program to an advised program. Functional aspects are composed by functio...
Sven Apel, Christian Kästner, Don S. Batory
COMPUTER
2008
92views more  COMPUTER 2008»
14 years 10 months ago
Can Programming Be Liberated, Period?
higher, more appropriate, level of abstraction. It still entails writing programs, usually by using symbols, keywords, and operational instructions to tell the computer what we wan...
David Harel
TCS
2010
14 years 8 months ago
A trajectory-based strict semantics for program slicing
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
Richard W. Barraclough, David Binkley, Sebastian D...
155
Voted
RTA
2011
Springer
14 years 27 days ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl