Efficient and Correct Stencil Computation via Pattern Matching and Static Typing

@inproceedings{Orchard2011EfficientAC,
  title={Efficient and Correct Stencil Computation via Pattern Matching and Static Typing},
  author={Dominic A. Orchard and Alan Mycroft},
  booktitle={DSL},
  year={2011}
}
  • Dominic A. Orchard, Alan Mycroft
  • Published in DSL 2011
  • Computer Science
  • Stencil computations, involving operations over the elements of an array, are a common programming pattern in scientific computing, games, and image processing. As a programming pattern, stencil computations are highly regular and amenable to optimisation and parallelisation. However, general-purpose languages obscure this regular pattern from the compiler, and even the programmer, preventing optimisation and obfuscating (in)correctness. This paper furthers our work on the Ypnos domain-specific… CONTINUE READING

    Paper Mentions

    Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
    1
    Programming contextual computations
    14
    Context-aware programming languages
    1
    The four Rs of programming language design
    3

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 30 REFERENCES