Sciweavers

1882 search results - page 107 / 377
» Transformational Programming and Forests
Sort
View
SCAM
2003
IEEE
15 years 3 months ago
Slicing the SCAM Mug: A Case Study in Semantic Slicing
In this paper we describe an improved formalisation of slicing in WSL transformation theory and apply the result to a particularly challenging slicing problem: the SCAM mug [1]. W...
Martin P. Ward
PPL
2007
88views more  PPL 2007»
14 years 9 months ago
Terminating alternator
In this paper, we present an program that enables the transformation of a nonterminating alternator into a terminating alternator. Our solution is stabilization preserving and has...
Sandeep S. Kulkarni
ET
2010
83views more  ET 2010»
14 years 8 months ago
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems
—Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. For the class of static affine program...
Sven Verdoolaege, Martin Palkovic, Maurice Bruynoo...
LCPC
2005
Springer
15 years 3 months ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick
POPL
2003
ACM
15 years 3 months ago
From control effects to typed continuation passing
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
Hayo Thielecke