Sciweavers

168 search results - page 9 / 34
» Imperative Program Transformation by Rewriting
Sort
View
JLP
2007
114views more  JLP 2007»
13 years 8 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
GG
2010
Springer
13 years 6 months ago
Declarative Mesh Subdivision Using Topological Rewriting in MGS
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
Antoine Spicher, Olivier Michel, Jean-Louis Giavit...
APLAS
2000
ACM
14 years 1 months ago
A New Criterion for Safe Program Transformations
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...
Yasuhiko Minamide
IWFM
1998
117views Formal Methods» more  IWFM 1998»
13 years 10 months ago
A Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
PLILP
1998
Springer
14 years 26 days ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...