177 search results - page 8 / 36 » Higher-Order Abstract Non-interference |
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
125
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
100
click to vote
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem. Our solution handles untyped programs, including unrestri...
125
click to vote
ITP
2010
15 years 5 months ago
2010
Abstract. In order to make existing formalizations available for settheoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This c...
130
Voted
ESOP
2008
Springer
15 years 3 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...