101 search results - page 17 / 21 » Error Correcting Analysis for Tree Languages |
PLDI
2003
ACM
14 years 23 days 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....
PLDI
2009
ACM
14 years 2 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 ...
PLDI
2003
ACM
14 years 23 days 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...
POPL
2010
ACM
14 years 4 months 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...
POPL
2011
ACM
12 years 10 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...