5 search results - page 1 / 1 » Introspective pushdown analysis of higher-order programs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
FOSSACS
2007
Springer
13 years 10 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
ICFP
2012
ACM
11 years 7 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
FSTTCS
2010
Springer
13 years 1 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...