Sciweavers

IPL
2008
118views more  IPL 2008»
13 years 11 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
DAGSTUHL
2006
14 years 26 days ago
Program Compression
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...
William S. Evans
ATVA
2006
Springer
123views Hardware» more  ATVA 2006»
14 years 3 months ago
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
Alastair F. Donaldson, Alice Miller
PEPM
1998
ACM
14 years 3 months ago
Inherited Limits
We show the evolution of partial evaluators over the past ten years from a particular perspective: the attempt to remove limits on the structure of residual programs that are inher...
Torben Æ. Mogensen
ASPLOS
2000
ACM
14 years 3 months ago
Slipstream Processors: Improving both Performance and Fault Tolerance
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effec...
Karthik Sundaramoorthy, Zachary Purser, Eric Roten...