Sciweavers

2000 search results - page 126 / 400
» Program Transformation and Proof Transformation
Sort
View
GI
2009
Springer
15 years 8 months ago
Tapir: Language Support to Reduce the State Space in Model-Checking
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
Ronald Veldema, Michael Philippsen
120
Voted
POPL
1998
ACM
15 years 7 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
141
Voted
FPCA
1995
15 years 7 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
PDSE
1998
108views more  PDSE 1998»
15 years 4 months ago
An Algebraic Framework for Optimizing Parallel Programs
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
Ichiro Satoh
113
Voted
WLP
1997
Springer
15 years 7 months ago
Extending Homeomorphic Embedding in the Context of Logic Programming
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
Michael Leuschel