933 search results - page 85 / 187 » Fully automatic cross-associations |
166
Voted
ICSE
1997
IEEE-ACM
15 years 10 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
172
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
154
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
140
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
144
Voted
ADAEUROPE
2003
Springer
15 years 9 months ago
2003
Springer
Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the conce...