101 search results - page 17 / 21 » Error Correcting Analysis for Tree Languages |
196
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
139
click to vote
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
119
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
122
click to vote
POPL
2010
ACM
16 years 12 days ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
145
click to vote
POPL
2011
ACM
14 years 5 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...