899 search results - page 148 / 180 » A CTL-Based Logic for Program Abstractions |
127
click to vote
POPL
1993
ACM
15 years 4 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
110
click to vote
ICFP
2008
ACM
16 years 11 days ago
2008
ACM
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
134
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
PPOPP
2009
ACM
16 years 29 days ago
2009
ACM
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
LOPSTR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...