Sciweavers

4854 search results - page 13 / 971
» It's the Programming, Stupid
Sort
View
PLDI
2009
ACM
15 years 4 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
ISHPC
2000
Springer
15 years 1 months ago
Automatic Generation of OpenMP Directives and Its Application to Computational Fluid Dynamics Codes
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technolo...
Haoqiang Jin, Michael A. Frumkin, Jerry C. Yan
HASKELL
2007
ACM
15 years 1 months ago
Why it's nice to be quoted: quasiquoting for haskell
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
Geoffrey Mainland
CL
2006
Springer
14 years 9 months ago
Inter-language reflection: A conceptual model and its implementation
Meta programming is the act of reasoning about a computational system. For example, a program in Prolog can reason about a program written in Smalltalk. Reflection is a more power...
Kris Gybels, Roel Wuyts, Stéphane Ducasse, ...
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
15 years 1 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers