2137 search results - page 64 / 428 » Proving Abstract Non-interference |
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
VMCAI
2009
Springer
15 years 4 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...
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. This pearl examines how to verify functional programs written using the state monad. It uses Coq’s Program framework to provide strong specifications for the standard ...
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...