2137 search results - page 72 / 428 » Proving Abstract Non-interference |
CLEIEJ
2006
14 years 10 months ago
2006
This work presents a formal description of a subset of a C-like language in the form of an operational semantics. We give semantics to the following statements (presented in alpha...
74
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract-- The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the op...
EJC
2006
14 years 10 months ago
2006
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
IJCM
2008
14 years 10 months ago
2008
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
CORR
2007
Springer
14 years 10 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...